#include <iostream>
#include <algorithm>
#include <vector>
using namespace std;
int main(){
	int n;	cin>>n;
	vector<int> data;
	for(int i=1;n/i>0;i=i*10){
		data.push_back((n/i)%10);
	}
	reverse(data.begin(),data.end());
	vector<int> compare(data);
	sort(compare.begin(),compare.end(),greater<int>());
	for(int i=0;i<(int)compare.size();i++){
		cout<<compare[i]<<" ";
	}
	cout<<endl;
	int a=0;
	while(data[a]==compare[a]&&a<(int)data.size())	a++;
	int b=a;
	for(int i=b+1;i<(int)data.size();i++){
		if(data[b]<=data[i])	b=i;
	}
	for(int i=0;i<(int)data.size();i++){
		cout<<data[i]<<" ";
	}	cout<<endl;
	if(data[a]!=data[b]){
		data[a]^=data[b];	data[b]^=data[a];	data[a]^=data[b];
	}
	for(vector<int>::iterator it=data.begin();it!=data.end();it++){
		cout<<*it;
	}
	cout<<endl;
	return 0;
}