As an experiment the Educational Codeforces Round 33 will be rated for Div. 2. ×

E. Prime Segment
time limit per test
2 seconds
memory limit per test
64 megabytes
input
standard input
output
standard output

Positive integer number x is called prime, if it has exactly two positive integer divisors. For example, 2, 3, 17, 97 are primes, but 1, 10, 120 are not.

You are given an integer number n, find the shortest segment [a, b], which contains n (i.e. a ≤ n ≤ b) and a, b are primes.

Input

The only given line contains an integer number n (2 ≤ n ≤ 10000).

Output

Print the space separated pair of the required numbers a, b.

Examples
Input
10
Output
7 11
Input
97
Output
97 97