# Codeforces 395B. On Sum of Fractions（数学，素数间隔）

Let’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 .

Input

The 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).

Output

Print 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.

Examples
input

output

# Divide by Zero 2017 and Codeforces Round #399 (Div. 1 + Div. 2, combined)做题记录

A. Oath of the Night’s Watch

B. Code For 1

C. Jon Snow and his Favourite Number

D. Jon and Orbs

E. Game of Stones

F. Barrels and boxes

# Codeforces Beta Round #3做题记录

A. Shortest path of the king

B. Lorry

C. Tic-tac-toe

D. Least Cost Bracket Sequence