B"Alice and Bob begin their day with a quick game. They first choose a starting number X0 xe2 x80 x89 xe2 x89 xa5 xe2 x80 x893 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 xe2 x80 x89< xe2 x80 x89Xi xe2 x80 x89- xe2 x80 x891 and then finds the minimum Xi xe2 x80 x89 xe2 x89 xa5 xe2 x80 x89Xi xe2 x80 x89- xe2 x80 x891 such that p divides Xi. Note that if the selected prime p already divides Xi xe2 x80 x89- xe2 x80 x891, 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. The input contains a single integer X2 (4 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89X2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89106). It is guaranteed that the integer X2 is composite, that is, is not prime. Output a single integer -- the minimum possible X0. In the first test, the smallest possible starting number is X0 xe2 x80 x89= xe2 x80 x896. One possible course of the game is as follows: In the second case, let X0 xe2 x80 x89= xe2 x80 x8915. "...