By Eduardo Gomes Carvalho Brazil
Write a program which reads an given integer N and prints a twin prime which has the maximum size among twin primes less than or equals to N.
According to wikipedia "A twin prime is a prime number that is either 2 less or 2 more than another prime number—for example, either member of the twin prime pair (41, 43). In other words, a twin prime is a prime that has a prime gap of two".
The entry must contain an integer N, where (5 ≤ N ≤ 1000).
The output must contain two integers X and Y separated by space, representing the two closest twin prime numbers less than or equal to N.
|Input Sample||Output Sample|