5765: On Sum of Fractions
内存限制：256 MB
时间限制：2 S
题面：传统
评测方式：文本比较
上传者：
提交：1
通过：1
题目描述
B. On Sum of Fractions
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
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.
.
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
2 2 3
Output
1/6 7/30
输入样例 复制
输出样例 复制