There is a popular apps named “Exbook” like “Facebook”. To sign up in this app , You have to make a strong password with more than 3 digits and less than 10 digits . But I am a pro hacker and so I make a Exbook hacking site . You need to login in this site to hack exbook account and then you will get a portal. You can give any user exbook login link using this site and when anyone login into exbook using your link ,you can see his/her password .
But I made a mistake and so you cannot find original password in your portal . The portal showing you by adding two in every digit . So , now you have to find out the original password of an user if I give you the password which is showing in your portal .

-----Input:-----
The first line contains a single integer t (1 ≤ t ≤ 1000) — the number of test cases.
The first line of each test case contains a single integer n which is showing in your portal . Mind it , every digit of n is greater than one .

-----Output:-----
Print , original password of user .

-----Sample Input:-----
2
3527
47269

-----Sample Output:-----
1305
25047

Difficulty: UNKNOWN_DIFFICULTY

Solutions:
t = int(input())
for i in range(0, t):
	p = input()
	l = list(p)
	for j in range(0, len(l)):
		l[j] = int(l[j])
		l[j] = l[j] - 2
	for j in range(0, len(l)):
		l[j] = str(l[j])
	q = ''.join(l)
	print(q)


t = int(input())
for i in range(t):
	n = input()
	l = len(n)
	list1 = list(n)
	str1 = ''
	for j in range(l):
		str1 += str(int(list1[j]) - 2)
	print(str1)


for _ in range(int(input())):
	n = input()
	for i in n:
		print(int(i) - 2, end='')
	print()


for _ in range(int(input())):
	s = list(str(input()))
	for i in range(len(s)):
		s[i] = int(s[i]) - 2
	print(''.join([str(i) for i in s]))


try:
	for i in range(int(input())):
		a = int(input())
		b = str(a)
		c = list(b)
		for i in range(len(c)):
			c[i] = int(c[i])
		ab = []
		for i in c:
			i = i - 2
			ab.append(i)
		for i in ab:
			print(i, end='')
		print('')
except:
	pass


for t in range(int(input())):
	n = input()
	num = ''
	for c in n:
		num += str(int(c) - 2)
	print(num)


for _ in range(int(input())):
	n = input()
	res = ''
	for i in n:
		res += str(int(i) - 2)
	print(res)


t = int(input())
for z in range(t):
	N = map(str, input())
	s = ''
	for i in N:
		s += str(int(i) - 2)
	print(s)


def fun():
	T = int(input())
	for i in range(T):
		x = input()
		st = str('')
		for j in x:
			n = str(int(j) - 2)
			st += n
		print(st)
fun()


test_cases = int(input())
for t in range(test_cases):
	password = input()
	r = ''
	for i in range(len(password)):
		r = r + str(int(password[i]) - 2)
	print(r)


def password(n):
	num = str(n)
	hack = ''
	for i in num:
		hack = hack + str(int(i) - 2)
	print(hack)
for _ in range(int(input())):
	n = int(input())
	password(n)


try:
	for t in range(int(input())):
		n = input()
		m = list(n)
		for (i, j) in enumerate(m):
			m[i] = str(int(j) - 2)
		print(''.join(m))
except EOFError:
	pass


for _ in range(int(input())):
	s = input()
	for i in s:
		print(int(i) - 2, end='')
	print('')


t = int(input())
ans = []
for _ in range(t):
	n = input()
	a = []
	place = 1
	for i in n:
		a.append(str(int(i) - 2))
	a = ''.join(a)
	ans.append(a)
for _ in ans:
	print(_)


t = int(input())
while t:
	n = int(input())
	l = []
	while n > 0:
		temp = n % 10
		n //= 10
		l.append(temp)
	for i in range(len(l)):
		l[i] -= 2
	s = ''
	l.reverse()
	for i in l:
		s += str(i)
	print(s)
	t -= 1


try:
	cases = int(input())
	for _ in range(cases):
		l = ''
		m = input()
		for i in range(len(m)):
			l += str(int(m[i]) - 2)
		print(l)
except:
	pass


t = int(input())
for _ in range(t):
	num = input()
	l = [str(int(x) - 2) for x in num]
	ans = ''.join(l)
	print(ans)


for _ in range(int(input())):
	s = input()
	a = ''
	for i in s:
		a = a + str(int(i) - 2)
	print(a)


for _ in range(int(input())):
	digits = list(input())
	(inc, out) = (0, '')
	while inc < len(digits):
		out += str(int(digits[inc]) - 2)
		inc += 1
	print(out)


import sys
import math
import bisect
from sys import stdin, stdout
from math import gcd, floor, sqrt, log
from collections import defaultdict as dd
from bisect import bisect_left as bl, bisect_right as br
sys.setrecursionlimit(100000000)
ii = lambda : int(input())
si = lambda : input()
jn = lambda x, l: x.join(map(str, l))
sl = lambda : list(map(str, input().strip()))
mi = lambda : list(map(int, input().split()))
mif = lambda : list(map(float, input().split()))
lii = lambda : list(map(int, input().split()))
ceil = lambda x: int(x) if x == int(x) else int(x) + 1
ceildiv = lambda x, d: x // d if x % d == 0 else x // d + 1
flush = lambda : stdout.flush()
stdstr = lambda : stdin.readline()
stdint = lambda : int(stdin.readline())
stdpr = lambda x: stdout.write(str(x))
mod = 1000000007
for _ in range(ii()):
	n = si()
	ans = ''
	for i in range(len(n)):
		ans = ans + str(int(n[i]) - 2)
	print(ans)


for _ in range(int(input())):
	n = int(input())
	s = str(n)
	l = len(s)
	ans = ''
	for i in range(l):
		ans = ans + str(int(s[i]) - 2)
	print(ans)


try:
	T = int(input())
	if T >= 1 and T <= 1000:
		for i in range(T):
			num = input()
			if len(num) > 3 and len(num) < 10 ** 10:
				arr = []
				for x in num:
					arr.append(int(x) - 2)
				arr = list(map(str, arr))
				res = ''.join(arr)
				print(res)
except Exception:
	pass


for _ in range(int(input())):
	s = input()
	a = [int(s[i]) - 2 for i in range(len(s))]
	for i in range(len(s)):
		print(a[i], end='')
	print()