#描述#
<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>The ACM
Sequence Fn for any integer n with n >= 2 is the set of irreducible rational
numbers a/b with 0 < a < b <= n and <span class=GramE>gcd(</span>a,b)
= 1 arranged in increasing order. The first few are<o:p>/o:p</span></font></p>

<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>F2 =
{1/2} <o:p>/o:p</span></font></p>

<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>F3 =
{1/3, 1/2, 2/3} <o:p>/o:p</span></font></p>

<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>F4 =
{1/4, 1/3, 1/2, 2/3, 3/4} <o:p>/o:p</span></font></p>

<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>F5 =
{1/5, 1/4, 1/3, 2/5, 1/2, 3/5, 2/3, 3/4, 4/5}<o:p>/o:p</span></font></p>

<p class=MsoNormal><font size=2 face="Times New Roman"><span lang=EN-US
style='font-size:10.5pt;mso-bidi-font-size:10.5pt;mso-font-kerning:0pt'>Now,
your task is to print ACM Sequence given the value of n.<o:p>/o:p</span></font></p>

#格式#
##输入格式##
There are several test cases. The first line is an integer giving the number of cases.
Each test case has only one line, which contains a positive integer n (2&lt=n&lt=3000).

##输出格式##
For each test case, you should output one line, which contains the corresponding ACM Sequence. Adjacent terms are separated by a single ‘,’ and there can’t be any white spaces in your output. See Sample Output for more clarifications on the output format.

#样例1#
##样例输入1##

4
2
3
4
5

##样例输出1##

1/2
1/3,1/2,2/3
1/4,1/3,1/2,2/3,3/4
1/5,1/4,1/3,2/5,1/2,3/5,2/3,3/4,4/5

#限制#
1000ms
32768KB

#提示#

#来源#
lily