#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,q,ans;
int a;
char str;
bool prime(int x){
    if(x==1)
        return 0;
    q=sqrt(x);
    for(int i=2;i<=sqrt(x);i++){
        if(x%i==0)
            return 0;
    }
    return 1;
}
void dfs(int c,int s){
    if(c>=n){
        printf("%d\n",s);
        return;
    }
    for(int i=1;i<=9;i+=2){
        if(prime(s*10+i))
            dfs(c+1,s*10+i);
    }
    return ;
}
int main()
{
#ifdef DEBUG
	freopen("input.in", "r", stdin);
	//freopen("output.out", "w", stdout);
#endif
    scanf("%d",&n);
    for(int i=2;i<=9;i++){
        if(prime(i))
            dfs(1,i);
    }
    //cout << "Hello world!" << endl;
    return 0;
}