#############################################################

import sys
sys.setrecursionlimit(10**7)

from heapq import heappop,heappush
from collections import deque,defaultdict,Counter
from bisect import bisect_left, bisect_right
from itertools import product,combinations,permutations

ipt = sys.stdin.readline

def iin():
    return int(ipt())
def lmin():
    return list(map(int,ipt().split()))

MOD = 998244353
#############################################################

for _ in range(iin()):
    S = input()
    if len(S) == 1:
        print(S)
    elif S[:2] == "0b":
        print(int(S[2:],2))
    elif S[:2] == "0o":
        print(int(S[2:],8))
    elif S[:2] == "0x":
        print(int(S[2:],16))
    else:
        print(S)