#include <iostream>
#include <algorithm>
using namespace std;

bool cmp(int x,int y){
	return x < y;
}
int main(){
	int n;
	cin >> n;
	if(n%100 == 0){
		cout << n;
		return 0;
	}
	
	int a[3];
	a[0]=n/100;
	a[1]=n%100;
	a[1]/= 10;
	a[2]=n%10;
	sort(a,a+3,cmp);
	if(a[0] == 0) swap(a[0],a[1]);
	
	for(int i=0;i < 3;i++) cout << a[i];

	return 0;
}