import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

q = int(input())
d = {"b":2, "o":8, "x":16}
for i in range(q):
    s = input().rstrip()
    if len(s) == 1:
        print(s)
        continue
    if s[1] not in {"b","o","x"}:
        print(s)
        continue
    if s[1] == "b" or s[1] == "o":
        n = 0
        b = 1
        for i in range(len(s) - 2):
            n += b*int(s[-i-1])
            b *= d[s[1]]
        print(n)
    else:
        n = 0
        b = 1
        for i in range(len(s) - 2):
            tmp = s[-i-1]
            if ord("a")<= ord(tmp) <=ord("z"):
                n += b*(ord(tmp)-ord("a") + 10)
            else:
                n += b*int(s[-i-1])
            b *= d[s[1]]
        print(n)