#include <iostream>
#include <vector>
#include <stack>
#include <map>
#include <list>
#include <thread>
using namespace std;
const int N = 1e5+5;
void Reverse(int a[],int l,int r)
{
while(l<r){
swap(a[l],a[r]);
l++;r--;
}
}
bool Next_permutatin(int a[],int l,int r)
{
int i=r-1;
while(i!=0&&a[i]>=a[i+1]) i--;
if(i==0) return false;
int j=r;
while(a[j]<=a[i]) j--;
swap(a[i],a[j]);
Reverse(a,i+1,r);
return true;
}
int main()
{
int a[N];
a[1]=1;a[2]=1;a[3]=2;a[4]=4;
do
{
cout<<a[1]<<a[2]<<a[3]<<a[4]<<endl;
}while(Next_permutatin(a,1,4));
}