#include <iostream>
#include <string.h>
#include <algorithm>

using namespace std;

int main(){
	int i,j,k,len,count=0;
	char X[20],tmp;
	int max;

	cin>>X;

	len=strlen(X);

	for(i=0;i<len;i++){
		max=i;
		for(j=i+1;j<len;j++){
			if(X[max]<X[j]) max=j;
		}
		tmp=X[i];
		X[i]=X[max];
		X[max]=tmp;
	}
	
	cout<<X<<endl;

	j=len-1;

	while(X[j]==X[j-1]){
		j--;
	}
	tmp=X[j-1];
	X[j-1]=X[j];
	X[j]=tmp;

	cout<<tmp<<endl;

	cout<<X<<endl;
	return 0;
}