#define _USE_MATH_DEFINES
#include  <cmath>
#include <cstdio>
#include <vector>
#include <iostream>
#include <algorithm>
#include <string>
#include<math.h>
#include<iomanip>
#include<stdio.h>
#include <stdlib.h>
#include<stdio.h>
#include <queue>
#include<map>
#include <fstream>
#include <sstream>
#include<set>
#include<stack>
#include<time.h>
#include <sys/types.h>
#include <tuple>
#include <numeric>
#include <iterator>

typedef long long int ll;
//#include<bits/stdc++.h>


using namespace std;

ll gcd(ll a, ll b) {
    if (a < b)swap(a, b);
    if (b == 0)return a;
    return gcd(b, a % b);
}
int lcm(int a, int b) {
    return a * b / gcd(a, b);
}

long long mod_exp(long long b, long long e, long long m) {
    if (e > 0 && b == 0) return 0;
    long long ans = 1;
    b %= m;

    while (e > 0) {
        if ((e & 1LL)) ans = (ans * b) % m;
        e = e >> 1LL;
        b = (b * b) % m;
    }

    return ans;
}


int main()
{

    int Q;
    Q = 1;
    cin >> Q;



    while (Q--) {
        string p;
        cin >> p;
        if (p.size() < 3)cout << p << endl;
        else {
            if (p[1] >= '1' && p[1] <= '9')cout << p << endl;
            else {
                ll x = 0;
                if (p[1] == 'b') {
                    reverse(p.begin(), p.end());
                    ll d = 1;
                    for (int i = 0; p[i] != 'b'; i++) {
                        ll t = p[i] - '0';
                        x += t * d; d *= 2;
                        
                    }
                }
                else if (p[1] == 'o') {
                    reverse(p.begin(), p.end());
                    ll d = 1;
                    for (int i = 0; p[i] != 'o'; i++) {
                        ll t = p[i] - '0';
                        x += t * d; d *= 8;
                    }
                }
                else if (p[1] == 'x') {
                    reverse(p.begin(), p.end());
                    ll d = 1;
                    for (int i = 0; p[i] != 'x'; i++) {
                        int t;
                        if(p[i]>='0'&&p[i]<='9')t = p[i] - '0';
                        else {
                            t = p[i] - 'a' + 10;
                        }
                        x += t * d; d *= 16;
                    }
                }
                
                cout << x << endl;

            }

        }
    }
        return 0;
    }