ded

#include <fstream>
#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("antigray.in");
ofstream fout("antigray.out");

struct vect{
    int vect[16];
};

bool comp(vect a,vect b){
    for(int s=15;s>-1;s--){
        if (a.vect[s]==b.vect[s])
            continue;
        else{
            if(a.vect[s]<b.vect[s])
                return true;
        else
            return false;
            }}
    return true;
}

 int main(){
     int n;
     cin>>n;
     vector<vect> vectors;
     vector<vect> tmp;
     vect a;
     a.vect[0]=0;
     vectors.push_back(a);
     for(int i=0;i<=n-1;i++){
        sort(vectors.begin(),vectors.end()-1,comp);
         for(int j=0,s=0;j<vectors.size();j++){
             tmp.resize(vectors.size()*3);
             tmp[s]=vectors[j];
             for(int f=0;f<i+1;f++){
                 vectors[j].vect[f]++;
                 if(vectors[j].vect[f]==3)
                     vectors[j].vect[f]=0;
             }
             s++;
             tmp[s]=vectors[j];
             for(int f=0;f<i+1;f++){
                 vectors[j].vect[f]++;
                 if(vectors[j].vect[f]==3)
                     vectors[j].vect[f]=0;
             }
            s++;
             tmp[s]=vectors[j];
             s++;
         }
         vectors.resize(tmp.size());
         vectors=tmp;
     }
     for(int i=0;i<vectors.size();i++){
         for(int j=n-1;j>-1;j--)
             cout<<vectors[i].vect[j];
         cout<<endl;
     }
}