perm_rep2

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

int main(void)
{
    int n,r;
    vector<int> v;
    set<int> s;
    cin>>n;
    while(n)
        v.push_back(n%10),n/=10;
    sort(v.begin(),v.end());
    do
    {
        r=0;
        for(auto i:v)
            r*=10,r+=i;
        if(s.find(r) == s.end())
            cout<<r<<'\n',s.insert(r);
    } while(next_permutation(v.begin(),v.end()));
    return 0;
}