The package for this problem was not updated by the problem writer or Codeforces administration after we've upgraded the judging servers. To adjust the time limit constraint, a solution execution time will be multiplied by 2. For example, if your solution works for 400 ms on judging servers, then the value 800 ms will be displayed and used to determine the verdict.

The following languages are only available languages for the problems from the contest

Unknown Language Round #1:

- ActiveTcl 8.5

Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.

No tag edit access

The problem statement has recently been changed. View the changes.

×
E. Prime Segment

time limit per test

2 secondsmemory limit per test

64 megabytesinput

standard inputoutput

standard outputPositive 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

Codeforces (c) Copyright 2010-2022 Mike Mirzayanov

The only programming contests Web 2.0 platform

Server time: Oct/04/2022 13:19:26 (j3).

Desktop version, switch to mobile version.

Supported by

User lists

Name |
---|