#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std; typedef long long int ll; typedef pair pii; typedef pair pll; typedef vector vi; #define rep(i,x) for(int i=0;i<(int)(x);++i) #define reps(i,x) for(int i=1;i<=(int)(x);++i) #define rrep(i,x) for(int i=((int)(x)-1);i>=0;i--) #define pb push_back #define FOR(it,c) for(__typeof((c).begin()) it=(c).begin(); it!=(c).end(); ++it) #define ALLOF(c) (c).begin(), (c).end() #define DEBUG #ifdef DEBUG #define D(x) x #else #define D(x) #endif using namespace std; void print_map(map m) { FOR(itr, m) { std::cout << itr->first << " => " << itr->second << endl; } } void print_vector(vector v) { FOR(itr, v) { std::cout << *itr << ", "; } cout << endl; } vector map_vals(map m) { vector vals; FOR(itr, m) { vals.push_back(itr->second); } return vals; } bool is_not_prime(int n) { for(int i = 2; i < n; i++) { if(n % i == 0) { return true; } } return false; } int main() { cin.tie(0); ios::sync_with_stdio(false); int n; cin >> n; for(int i = n - 100; i <= n + 100; i++) { if(is_not_prime(i)) { cout << i << endl; return 0; } } return 0; }