300334: CF64E. Prime Segment

Memory Limit：64 MB Time Limit：2 S
Judge Style：Text Compare Creator：
Submit：0 Solved：0

Description

E. Prime Segmenttime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard 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.

ExamplesInput
10
Output
7 11
Input
97
Output
97 97

Input

Source/Category

加入题单

上一题 下一题 算法标签：