E. Prime Segmenttime limit per test2 secondsmemory limit per test64 megabytesinputstandard inputoutputstandard 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.InputThe only given line contains an integer number n (2 ≤ n ≤ 10000).OutputPrint the space separated pair of the required numbers a, b.ExamplesInput10Output7 11Input97Output97 97
Input10
Output7 11
['*special problem', 'brute force', 'math', 'number theory', '*1800']