#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF = 1e17+7;
const long long MOD = 1e9+7;
const double PI=acos(-1);

using namespace std;

bool is_prime(long long x){
	bool res=true;
	for(long long i=2;i*i<=x;i++){
		if(x%i==0){
			res=false;
			return res;
		}
	}
	return res;
}

int main(){
	int n;
	cin >> n;
	long long start=100001;
	long long mi;
	vector<long long> v;
	v.push_back(1);
	while(1){
		if(v.size()==10)break;
		if(is_prime(start)){
			v.push_back(start*100003);
		}
		start++;
	}
	cout << v[n-1] << endl;
}