#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rrep(i,a,b) for(ll i=(ll)(a-1);i>=(ll)(b);i--)
#define MOD 998244353
#define INF 1e16
template <typename T> bool chmax(T& a,T b){if(a<b){a=b;return 1;}return 0;}
template <typename T> bool chmin(T& a,T b){if(a>b){a=b;return 1;}return 0;}
ll comb(ll x,ll y){
    ll ans=1;
    rep(i,0,y) ans*=(x-i);
    rep(i,0,y) ans/=(i+1);
    return ans;
}
ll rui(ll x){
    if(x==0) return 1;
    return 2*rui(x-1);
}
ll fac(ll x){
    if(x==0) return 1;
    return x*fac(x-1);
}
ll pow(ll x,ll n){
    ll ans=1;
    while(n>0){
        if(n&1) ans*=x;
        x*=x;
        n>>=1;
    }
    return ans;
}

map<char,ll> mp;

ll n_to_10(string x,ll n){
    ll m=x.size();
    ll a=1;
    ll res=0;
    rep(i,0,m){
        res+=mp[x[m-i-1]]*a;
        a*=n;
    }
    return res;
}

int main(){
    ll q; cin >> q;
    rep(i,0,10) mp['0'+i]=i;
    rep(i,0,26) mp['a'+i]=10+i;
    while(q--){
        string s; cin >> s;
        if(s.size()==1) cout << s << endl;
        else if(mp[s[1]]<=10) cout << s << endl;
        else if(s[1]=='b') cout << n_to_10(s.substr(2,s.size()-2),2) << endl;
        else if(s[1]=='o') cout << n_to_10(s.substr(2,s.size()-2),8) << endl;
        else cout << n_to_10(s.substr(2,s.size()-2),16) << endl;
    }
}