import bisect
import copy
import decimal
import fractions
import heapq
import itertools
import math
import random
import sys
import time
from collections import Counter,deque,defaultdict
from functools import lru_cache,reduce
from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max
def _heappush_max(heap,item):
    heap.append(item)
    heapq._siftdown_max(heap, 0, len(heap)-1)
def _heappushpop_max(heap, item):
    if heap and item < heap[0]:
        item, heap[0] = heap[0], item
        heapq._siftup_max(heap, 0)
    return item
from math import gcd as GCD
read=sys.stdin.read
readline=sys.stdin.readline
readlines=sys.stdin.readlines
write=sys.stdout.write
#import pypyjit
#pypyjit.set_param('max_unroll_recursion=-1')
#sys.set_int_max_str_digits(10**9)

idx={s:i for i,s in enumerate("0123456789abcdef")}
Q=int(readline())
for q in range(Q):
    S=readline().rstrip()
    if len(S) and S[:2]=="0b":
        S=S[2:]
        le=len(S)
        ans=sum(2**(le-1-i)*int(S[i]) for i in range(le))
    elif len(S) and S[:2]=="0o":
        S=S[2:]
        le=len(S)
        ans=sum(8**(le-1-i)*int(S[i]) for i in range(le))
    elif len(S) and S[:2]=="0x":
        S=S[2:]
        le=len(S)
        ans=sum(16**(le-1-i)*int(idx[S[i]]) for i in range(le))
    else:
        ans=int(S)
    print(ans)