#define _GLIBCXX_DEBUG
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define ALL(v) v.begin(), v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

int main() {
  int n;
  cin>>n;
  
  vector<int> A={1,2,3,4,5,6,7,8,9,0};
  
  do{
    if(n==1){
      if(100*A[0]+10*A[1]+A[2]+100*A[3]+10*A[4]+A[5]==1000*A[1]+100*A[6]+10*A[2]+A[1] 
         && A[0]!=0 && A[3]!=0 && A[1]!=0){
        cout<<1000*A[1]+100*A[6]+10*A[2]+A[1]<<endl;
        return 0;
      }
    }
    else if(n==2){
      if(1000*A[0]+100*A[0]+10*A[1]+A[2]+1000*A[3]+100*A[4]+10*A[5]+A[6]==
         10000*A[7]+1000*A[8]+100*A[1]+10*A[2]+A[9] && A[0]!=0 && A[3]!=0 && A[7]!=0){
        cout<<10000*A[7]+1000*A[8]+100*A[1]+10*A[2]+A[9]<<endl;
        return 0;
      }
    }
    else if(n==3){
      if(100000*A[0]+10000*A[1]+1000*A[2]+100*A[3]+10*A[4]+A[5]+
         10000*A[6]+1000*A[3]+100*A[5]+10*A[7]+A[8]==
         100000*A[1]+10000*A[3]+1000*A[9]+100*A[4]+10*A[3]+A[9]
         && A[0]!=0 && A[6]!=0 && A[1]!=0){
        cout<<100000*A[1]+10000*A[3]+1000*A[9]+100*A[4]+10*A[3]+A[9]<<endl;
        return 0;
      }
    }
  }while(next_permutation(ALL(A)));
  
  return 0;
}