Magic Numbers 

Write a program that finds and displays all pairs of integers tex2html_wrap_inline28 and tex2html_wrap_inline30 such that:

  1. neither tex2html_wrap_inline28 nor tex2html_wrap_inline30 have any digits repeated; and
  2. tex2html_wrap_inline36 , where N is a given integer;

Input and Output

The input file consist a integer at the beginning indicating the number of test case followed by  a blank line. Each test case consists of one line of input containing N. Two input are separated by a blank line.

For each input the output consists of a sequence of zero or more lines each containing tex2html_wrap_inline28 / tex2html_wrap_inline30 = N, where tex2html_wrap_inline48 and N are the integers described above. When there are two or more solutions, sort them by increasing numerator values. Two consecutive output set will separated by a blank line. 

Sample Input

1

1234567890

Sample Output

1234567890 / 1 = 1234567890
2469135780 / 2 = 1234567890
4938271560 / 4 = 1234567890
6172839450 / 5 = 1234567890
8641975230 / 7 = 1234567890
9876543120 / 8 = 1234567890