全排列
#include<bits/stdc++.h>
#define ll long long
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
const ll MAXN = 3e18;
int main (){
int a[200005];
string s;
while(cin>>s){
for(int i=0;i<s.size();i++)a[i]=(int)(s[i]-'0');
sort(a,a+s.size());
do{
for(int i=0;i<s.size();i++)cout<<a[i];
cout<<endl;
}
while ( next_permutation(a,a+s.size()));
}
return 0;
}