设 为不超过 的最大素数， 为超过 的最小素数。
给定 ，求 。
Let's assume that
- is the largest prime number, that does not exceed ;
- is the smallest prime number strictly greater than .
The first line contains integer — the number of testscases.
Each of the following lines of the input contains integer ().
Print lines: the -th of them must contain the answer to the -th test as an irreducible fraction
p/q, where are integers, .