github.com/captn3m0/codechef.git

---
category_name: easy
problem_code: COOLGUYS
problem_name: 'Cool Guys'
languages_supported:
    - ADA
    - ASM
    - BASH
    - BF
    - C
    - 'C99 strict'
    - CAML
    - CLOJ
    - CLPS
    - 'CPP 4.3.2'
    - 'CPP 4.9.2'
    - CPP14
    - CS2
    - D
    - ERL
    - FORT
    - FS
    - GO
    - HASK
    - ICK
    - ICON
    - JAVA
    - JS
    - 'LISP clisp'
    - 'LISP sbcl'
    - LUA
    - NEM
    - NICE
    - NODEJS
    - 'PAS fpc'
    - 'PAS gpc'
    - PERL
    - PERL6
    - PHP
    - PIKE
    - PRLG
    - PYTH
    - 'PYTH 3.4'
    - RUBY
    - SCALA
    - 'SCM guile'
    - 'SCM qobi'
    - ST
    - TCL
    - TEXT
    - WSPC
max_timelimit: '3'
source_sizelimit: '50000'
problem_author: Rubanenko
problem_tester: xcwgf666
date_added: 1-05-2013
tags:
    - Rubanenko
    - easy
    - number
    - sept13
editorial_url: 'http://discuss.codechef.com/problems/COOLGUYS'
time:
    view_start_date: 1379324028
    submit_start_date: 1379324028
    visible_start_date: 1379323800
    end_date: 1735669800
    current: 1493558132
layout: problem
---
All submissions for this problem are available.Given an integer **N**. Integers **A** and **B** are chosen randomly in the range **\[1..N\]**. Calculate the probability that the Greatest Common Divisor(GCD) of **A** and **B** equals to **B**.

### Input

The first line of the input contains an integer **T** denoting the number of test cases. The description of **T** test cases follows. Each test case consists of a single integer **N** on a separate line.

### Output

For each test case, output a single line containing probability as an irreducible fraction.

### Example

<pre><b>Input:</b>
3
1
2
3

<b>Output:</b>
1/1
3/4
5/9
</pre>### Constraints

1<=**T**<=103

1<=**N**<=109