/*
TASK:N23
LANG:C++
*/

#include<iostream.h>
#include<stdlib.h>
 //short e=0;
 char *C,base[2],f=0;
 long u;
 struct bit{
 unsigned a:1;
 };
 union w{
 struct bit A;
 int b;
 }B;
 long power(int i, int n);
 void perm(int i, int k);
 int main()
 {
  int n,br=0,j;
  long r;
  cin>>n;
  u=2;
  u<<=n-1;
  //r=u=power(2,n);
  r=u;
  while(r>0)
  {r=r/10; br++;}
  //cout<<u<<endl;
  base[0]='2'; base[1]='3';
  C=new char [br*(br+1)];
  for(j=0;j<br*(br+1) && f==0;j++)
   perm(0,br+j);
  if(f==0)cout<<"No"<<endl;
  return 0;
 }

 long power(int i, int n)
 {
  if(n==1)return i;
  B.b=n;
  if(!B.A.a)power(i*i,n/2);
   else return i*power(i,n-1);
 }

 void perm(int i, int k)
 {
  if(f==1)return;
  if(i==k){
  C[k]=NULL;
  long h=atol(C);
  if(h%u==0){cout<<C<<endl; f=1;} return;}
  for(int j=0;j<2;j++)
   {
    C[i]=base[j];
    perm(i+1,k);
   }
  if(f==1)return;
 }