Chef's company wants to make ATM PINs for its users, so that they could use the PINs for withdrawing their hard-earned money. One of these users is Reziba, who lives in an area where a lot of robberies take place when people try to withdraw their money. 
Chef plans to include a safety feature in the PINs: if someone inputs the reverse of their own PIN in an ATM machine, the Crime Investigation Department (CID) are immediately informed and stop the robbery. However, even though this was implemented by Chef, some people could still continue to get robbed. The reason is that CID is only informed if the reverse of a PIN is different from that PIN (so that there wouldn't be false reports of robberies).
You know that a PIN consists of $N$ decimal digits. Find the probability that Reziba could get robbed. Specifically, it can be proven that this probability can be written as a fraction $P/Q$, where $P \ge 0$ and $Q > 0$ are coprime integers; you should compute $P$ and $Q$.

-----Input-----
- The first line of the input contains a single integer $T$ denoting the number of test cases. The description of $T$ test cases follows.
- The first and only line of each test case contains a single integer $N$ denoting the length of each PIN. 

-----Output-----
For each test case, print a single line containing two space-separated integers — the numerator $P$ and denominator $Q$ of the probability.

-----Constraints-----
- $1 \le T \le 100$
- $1 \le N \le 10^5$

-----Subtasks-----
Subtask #1 (10 points): $N \le 18$
Subtask #2 (20 points): $N \le 36$
Subtask #3 (70 points): original constraints

-----Example Input-----
1
1

-----Example Output-----
1 1

-----Explanation-----
Example case 1: A PIN containing only one number would fail to inform the CID, since when it's input in reverse, the ATM detects the same PIN as the correct one. Therefore, Reziba can always get robbed — the probability is $1 = 1/1$.

Starter code:

Solutions:
for i in range(int(input())):
 n = int(input())
 q = "1"+"0"*(n//2)
 print(1,q)

# cook your dish here
for i in range(int(input())):
 n = int(input())
 q = "1"+"0"*(n//2)
 print(1,q)

# cook your dish here
for _ in range(int(input())):
 n = int(input())
 q = "1"+"0"*(n//2)
 print(1,q)
  


for _ in range(int(input())):
 n = int(input())
 q = "1"+"0"*(n//2)
 print(1,q)
  


# cook your dish he
def gcd(a,b):
  
 # Everything divides 0 
 if (b == 0):
   return a
 return gcd(b, a%b)

t = int(input())

for _ in range(t):
 n = int(input())
 # p=9
 # #tot=9
 # q=0
 # flag=0
 # num=0
 # if n==1:
 #     print(1 , end=" ")
 #     flag=1
 #     print(1)
 # else:
 #     for i in range(2,n+1):
 #         if i%2==0:
 #             pass
 #         else:
 #             p*=10
   
 # if flag==0:
 #     #print(gcd(3,4))
 #     q= 10**n - 10**(n-1)
 #     print(str(p//gcd(p,q)) + " " + str(q//gcd(p,q)))
 
 q="1"+"0"*(n//2)
 print(1, q)


# cook your dish here
for _ in range(int(input())):
 n=int(input())
 q="1"+"0"*(n//2)
 print(1,q)

# cook your dish he
def gcd(a,b):
  
 # Everything divides 0 
 if (b == 0):
   return a
 return gcd(b, a%b)

t = int(input())

def isPalindrome(n: int) -> bool: 
 
 # Find reverse of n 
 rev = 0
 i = n 
 while i > 0: 
  rev = rev * 10 + i % 10
  i //= 10
 
 # If n and rev are same,  
 # then n is palindrome 
 return (n == rev)

for _ in range(t):
 n = int(input())
 p=9
 tot=9
 q=0
 flag=0
 num=0
 if n==1:
  print(1 , end=" ")
  flag=1
  print(1)
 else:
  for i in range(2,n+1):
   if i%2==0:
    pass
   else:
    p*=10
   
 if flag==0:
  #print(gcd(3,4))
  q= 10**n - 10**(n-1)
  print(str(p//gcd(p,q)) + " " + str(q//gcd(p,q)))

# cook your dish here
for _ in range(int(input())):
 n=int(input())
 print(1,10**(n//2))

# cook your dish here
t=int(input())
while(t>0):
 t-=1
 n=int(input())
 #n,m,k=map(int,input().split())
 #l=list(map(int,input().split()))
 q=10**(n-int((n+1)/2))
 p=1
 '''if(n==1):
     q=1'''
 print(p,q)


for _ in range(int(input())):
 N = int(input())
 d = '1' + '0'*(N//2)
 print(1, d)

# cook your dish here

t=int(input())
while(t>0):
 t-=1
 n=int(input())
 #n,m,k=map(int,input().split())
 #l=list(map(int,input().split()))
 q=10**(n-int((n+1)/2))
 p=1
 '''if(n==1):
     q=1'''
 print(p,q)


# cook your dish he
t=int(input())
for i in range(t):
 n=int(input())
 q=10**(n-int((n+1)/2))
 p=1
 if n==1:
  q=1
 print(p,q)


# cook your dish here
from sys import stdin, stdout
from math import floor
ans = []

for _ in range(int(stdin.readline())):
 n = int(stdin.readline())
 ans.append(f'1 {"1" + "0" * floor(n / 2)}')
stdout.write('\n'.join(ans))


# cook your dish here
import math
for _ in range(int(input())):
 n = int(input())
 r = n-math.ceil(n/2)
 print(1,10 ** r)

# cook your dish here
import math
for _ in range(int(input())):
 n = int(input())
 a=n-math.ceil(n/2)
 print(1,10**a)

# cook your dish here
# cook your dish here
import math
tt=int(input())
for i in range(tt):
 n=int(input())
 a=n-math.ceil(n/2)
 print(1,10**a)

# cook your dish here
import math
for h in range(int(input())):
  n=int(input())
  a=math.ceil(n/2)
  a=n-a
  print("1 1",end="")
  for i in range(1,a+1):
   print(0,end="")
  print()

t=int(input())
for i in range(t):
 n=int(input())
 def compute_hcf(x, y):
  while(y):
   x, y = y, x % y
  return x
 if(n==1):
  print(1,end=" ")
  print(1)
 elif(n>1):
  a=0
  b=10**n
  if(n%2==0):
   a+=10**(n//2)
  elif(n%2!=0):
   a+=10**((n//2)+1)
  hcf=0
  hcf=compute_hcf(a,b)
  a1=0
  b1=0
  a1=a//hcf
  b1=b//hcf
  print(a1,end=" ")
  print(b1)
   
    


for _ in range(int(input())):
 n=int(input())
 q=10**(n//2)
 print(1,q)

# cook your dish here
import math
for i in range(int(input())):
 n=int(input())
 p=1
 q=10**(n//2)
 print(p," ",q)

# cook your dish here
import math
t=int(input())
for i in range(t):
 n=int(input())
 q=10**(n//2)
 print(1,q)
 


t=int(input()) 
for _ in range(t):
 n=int(input()) 
 str1='1 '+'1'+(n//2)*'0' 
 print(str1) 


# cook your dish here
import math
tt=int(input())
for i in range(tt):
 n=int(input())
 a=n-math.ceil(n/2)
 print(1,10**a)

# cook your dish here
import math
tt=int(input())
for i in range(tt):
 n=int(input())
 b=math.ceil(n/2)
 nu=10**b
 de=10**n
 q=math.gcd(nu,de)
 print(nu//q,de//q)