You are given a positive integer x. Find any such 2 positive integers a and b such that GCD(a,b)+LCM(a,b)=x.

As a reminder, GCD(a,b) is the greatest integer that divides both a and b. Similarly, LCM(a,b) is the smallest integer such that both a and b divide it.

It's guaranteed that the solution always exists. If there are several such pairs (a, b), you can output any of them.

Input

The first line contains a single integer t (1 ≤ t ≤ 100) — the number of testcases.

Each testcase consists of one line containing a single integer, x (2 ≤ x ≤ 10^9).

Output

For each testcase, output a pair of positive integers a and b (1 ≤ a, b ≤ 10^9) such that GCD(a,b)+LCM(a,b)=x. It's guaranteed that the solution always exists. If there are several such pairs (a, b), you can output any of them.

Example

Input


2
2
14


Output


1 1
6 4

Note

In the first testcase of the sample, GCD(1,1)+LCM(1,1)=1+1=2.

In the second testcase of the sample, GCD(6,4)+LCM(6,4)=2+12=14.
'''
#		SHREYANS BHAVSAR	#
#       DDIT				#
#       @shreyans_9950		#
#       CF,CC,HE,HR,GFG		#
'''

# import math
# def shrey():
	# /*!@#$%^&*()-+=*/
	# s=list(input())
	# l=len(s)
	# ans=""
	# for i in range(l):
	# 	if(i==0 or i==l-1 or i%2!=0):
	# 		ans+=s[i]

	# print(ans)
	# n=int(input())
	# a=list(map(int,input().split()))
	# c=0
	# c1=0
	# for i in range(len(a)):
	# 	if(i%2==0 and  a[i]%2!=0):
	# 		c+=1
	# 	if(i%2!=0 and a[i]%2==0):
	# 		c1+=1
	# if(c!=c1):
	# 	print(-1)
	# else:
	# 	print(c)
	# a,b=input().split()
	# a=int(a)
	# b=int(b)
	# ans=(60-b)+((23-a)*60)
	# print(ans)
	# n,k=input().split()
	# n=int(n)
	# k=int(k)
	# print(n-max(0,n%k-k//2))
	# n,k=input().split()
	# n=int(n)
	# k=int(k)
	# for i in range(k):
	# 	if(n%10!=0):
	# 		n-=1
	# 	else:
	# 		n=n//10
	# print(n)

# T = input()
# T = int(T)
# for q in range(1,T+1):
	# /*shreyans bhavsar(DDIT)*/
	# shrey()
# n = int(input())
# str1 = input()
# lst1 = []
# for i in range(n-1):
#     lst1.append(str1[i:i+2])
 
# print (max(lst1,key=lst1.count))
# n,k=input().split()
# n=int(n)
# k=int(k)
# a=list(map(int,input().split()))

# a.sort()
# # print(*a)
# if(k==0):
# 	if(a[0]>1):
# 		print(1)
# 	else:
# 		print(-1)
# else:
# 	if(k==n or a[k]!=a[k-1]):
# 		print(a[k-1])
# 	else:
# 		print(-1)
# for i in range(int(input())):
# 	l,v,u,r=map(int,input().split())
# 	print(l//v-((r//v)-((u-1)//v)))
# for i in range(int(input())):
	# a,b,c=map(int,input().split())
	# ans=max(0,abs(a-b)+abs(a-c)+abs(b-c)-4)
	# print(ans)
# for i in range(int(input())):
# 	n=int(input())
# 	b=3
# 	j=3
# 	while n%b!=0:
# 		b=2**j-1
# 		j+=1
# 	print(n//b)
# for i in range(int(input())):
# 	n=int(input())
# 	if(n%3==0):
# 		print(n//3)
# 	else:
# 		b=3
# 		c=3
# 		while(n%b!=0):
# 			b=2**c-1
# 			c+=1
# 		print(n//b)
# for q in range(int(input())):
# 	n=int(input())
# 	if((n//2)%2!=0):
# 		print("NO")
# 	else:
# 		s=0
# 		s1=0
# 		print("YES")
# 		ans=[]
# 		# ans.append(2)
# 		for i in range(0,n//2):
# 			c=2*(i+1)
# 			s+=c
# 			ans.append(c)
# 		for i in range(n//2,n-1):
# 			c=2*(i-n//2+1)-1
# 			s1+=c
# 			ans.append(c)
# 		d=s-s1
# 		ans.append(d)
# 		print(*ans)
# for q in range(int(input())):
# 	n=int(input())
# 	a=list(map(int,input().split()))
# 	c=0
# 	for i in a:
# 		if i%2!=0:
# 			c+=1
# 	if n==c:
# 		if c%2!=0:
	# 		print("YES")
	# 	else:
	# 		print("NO")
	# elif c>0 and n!=c:
	# 	print("YES")
	# else:
	# 	print("NO")
# import math
# for q in range(int(input())):
# 	n=int(input())
# 	x=(n-1)//9
# 	print(n+x)
for q in range(int(input())):
	n=int(input())
	print(1,n-1)