# VK Cup 2018 - Round 1 A. Primal Sport

A. Primal Sport
time limit per test
1.5 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

Alice and Bob begin their day with a quick game. They first choose a starting number X0 ≥ 3 and try to reach one million by the process described below.

Alice goes first and then they take alternating turns. In the i-th turn, the player whose turn it is selects a prime number smaller than the current number, and announces the smallest multiple of this prime number that is not smaller than the current number.

Formally, he or she selects a prime p < Xi - 1 and then finds the minimum Xi ≥ Xi - 1 such that p divides Xi. Note that if the selected prime palready divides Xi - 1, then the number does not change.

Eve has witnessed the state of the game after two turns. Given X2, help her determine what is the smallest possible starting number X0. Note that the players don't necessarily play optimally. You should consider all possible game evolutions.

Input

The input contains a single integer X2 (4 ≤ X2 ≤ 106). It is guaranteed that the integer X2 is composite, that is, is not prime.

Output

Output a single integer — the minimum possible X0.

Examples
input
Copy
14

output
6

input
Copy
20

output
15

input
Copy
8192

output
8191

Note

In the first test, the smallest possible starting number is X0 = 6. One possible course of the game is as follows:

• Alice picks prime 5 and announces X1 = 10
• Bob picks prime 7 and announces X2 = 14.

In the second case, let X0 = 15.

• Alice picks prime 2 and announces X1 = 16
• Bob picks prime 5 and announces X2 = 20.

#include <iostream>

using namespace std;

const int maxn=1000006;
int prime[maxn];

void getprime()
{
int n=2;
while(n<maxn)
{
int num=2*n;
while(num<maxn)
{
prime[num]=n;
num+=n;//该数的倍数也更新一次
}
num=n+1;
while(prime[num]!=0&&num<maxn)
{
num++;//略过那些没有质因数的情况
}
n=num;
}

}

int main()
{
getprime();
//int n;
//cin>>n;
int x0,x1,x2;
int a,b;
cin>>x2;//因为取得质因数越大，则他的下一个数的最小值越小
b=prime[x2];
x0=999999;
int i;
for(i=x2-b+1;i<=x2;i++)
{
a=prime[i];
x0=min(x0,i-a+1);
}
cout<<x0<<endl;
return 0;
}


bryce1010

• 擅长领域：
• acm