B. On Sum of Fractionstime limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputLet's assume that   v(n) is the largest prime number, that does not exceed n; u(n) is the smallest prime number strictly greater than n. Find .InputThe first line contains integer t (1 ≤ t ≤ 500) — the number of testscases. Each of the following t lines of the input contains integer n (2 ≤ n ≤ 109).OutputPrint t lines: the i-th of them must contain the answer to the i-th test as an irreducible fraction "p/q", where p, q are integers, q > 0.ExamplesInput223Output1/67/30
Input223
Output1/67/30
['math', 'number theory']