Sum of Primes

A natural number $n$ is called prime if it has exactly two distinct divisors, $1$ and $n$. For example, $6$ is not prime because $2$ divides it, and $1$ is not prime because its only divisor is $1$. The numbers $2$ and $7$ are prime.

Bajtazar loves prime numbers. He wrote consecutive primes on a sheet of paper: $2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, \ldots$ He wants to choose a contiguous segment of this sequence whose sum is exactly his favorite number $N$. Write a program that, given $N$, finds any contiguous interval of the prime sequence whose sum is exactly $N$.

The first and only line of input contains one natural number $N$ ($1 \le N \le 10^{11}$), the sum Bajtazar wants.

The first and only line of output should contain two primes $L$ and $R$ ($1 \le L \le R \le N$) such that the sum of the primes in the closed interval $[L, R]$ is exactly $N$. If there are several solutions, your program may output any of them. If no solution exists, output only the single word NIE.