跳至正文
题库2587
#2587

On Sum of Fractions

查看题目操作

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

2
2
3
1/6
7/30