PROGRAMMING:Looking for twin primes
The mathematician Hilbert put forward a "twin prime conjecture" in the report of the International Congress of mathematicians in 1900
There are infinitely many primes P such that P + 2 is prime. P and P + 2, a pair of prime numbers whose difference is 2, are called "twin prime numbers"< br>
It seems that this conjecture is true, we can always find many pairs of twin primes, such as: 3 and 5, 5 and 7, 11 and 13
This conjecture has not yet been proved< br>
Now, for the given integer ` n ',
Please find the smallest pair of twin primes' p 'and' Q '(q = P + 2) greater than n.
###Input format:
An integer n of not more than 7 digits.
###Output format:
Output 'p' and 'Q' in one line with spaces between them.
###Input example:
```in
one hundred
```
###Output example:
```out
101 103
```
answer：If there is no answer, please comment
There are infinitely many primes P such that P + 2 is prime. P and P + 2, a pair of prime numbers whose difference is 2, are called "twin prime numbers"< br>
It seems that this conjecture is true, we can always find many pairs of twin primes, such as: 3 and 5, 5 and 7, 11 and 13
This conjecture has not yet been proved< br>
Now, for the given integer ` n ',
Please find the smallest pair of twin primes' p 'and' Q '(q = P + 2) greater than n.
###Input format:
An integer n of not more than 7 digits.
###Output format:
Output 'p' and 'Q' in one line with spaces between them.
###Input example:
```in
one hundred
```
###Output example:
```out
101 103
```
answer：If there is no answer, please comment