#include <algorithm>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <functional>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <utility>
#include <valarray>
#include <vector>

#define N 1000
#define MOD 1000000007
#define pe(str) return cout<<str<<endl,0
#define px(str) {cout<<str<<endl;exit(0);}
#define re(i,n) for(int i=0;i<(n);i++)
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define fe(i,n,f) for_each(i,n,f)
#define bw(a,b,c) (((a)<=(b))&&((b)<=(c)))
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

bool p(int x){
	if(x==1)return true;
	if(x==2)return true;
	rep(i,2,(int)sqrt(x)+1){
		if(x%i==0)return false;
	}
	return true;
}
int main(void){
	int n;
	cin>>n;
	rep(i,n-100,n+101){
		if(!p(i))px(i);
	}
	return 0;
}