P1094 [CF64E] Prime Segment
提高-
题目描述

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.

输入格式

见题面 Input 部分

输出格式

见题面 Output 部分

样例输入
10
样例输出
7 11