import collections,sys,math,functools,operator,itertools,bisect,heapq,decimal,string,time,random
#sys.setrecursionlimit(10**9)
q = int(input())
#alist = list(map(int,input().split()))
#alist = []
#s = input()
#n,m = map(int,input().split())
#for i in range(n):
#    alist.append(list(map(int,input().split())))
for i in range(q):
    s = input()
    if len(s) <= 1:
    	print(int(s))
    elif s[1] == 'b':
        print(int(s,base=2))
    elif s[1] == 'o':
        print(int(s,base=8))
    elif s[1] == 'x':
        print(int(s,base=16))
    else:
        print(int(s))