As the problem's title suggests, in this task, you are given a value n with the requirement to find the largest prime number ~p~ such that ~n~ is divisible by ~p~.

Input

The single value is ~n~ ~(2 ≤ n ≤ 10^4)~ - representing the value ~n~ in the problem statement.

Output

The single value is the largest prime number ~p~ that satisfies the condition mentioned above.

Sample Input 1

30

Sample Ouput 1

5