跳到主要内容
图灵 OJTURING / ONLINE JUDGE

#F2143. On Sum of Fractions

  • ID: 2149
  • 传统题
  • 2000ms
  • 256MiB
  • 尝试: 0
  • AC · 已通过: 0
  • 教学难度:待分级
  • 上传者:
  • 数学
  • 数论
  • 难度待定
  • 难度
  • 共享题库
  • Codeforces
  • 英文题面
  • 题目来源
  • 题面语言

On Sum of Fractions

题目描述

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.

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
2
2
3
Output
1/6
7/30

题目来源:fps-www.educg.net-codeforce-1-2833.xml.zip;FPS 共享题包,题包内第 1745 题。保留原作者与原赛事署名。