#include<bits/stdc++.h>
using namespace std;

#define all(v) v.begin(),v.end()
using ll = long long;
using ull = unsigned long long;
using vll=vector<ll>;
using vvll = vector<vector<ll>>;
using P = pair<ll,ll>;
using vp=vector<pair<ll, ll>>;

const ll INF=1ll<<60;
ll mod10=1e9+7;
ll mod99=998244353;
const double PI = acos(-1);

#define rep(i,n) for (ll i=0;i<n;++i)
#define per(i,n) for(ll i=n-1;i>=0;--i)
#define rep2(i,a,n) for (ll i=a;i<n;++i)
#define per2(i,a,n) for (ll i=a;i>=n;--i)

template <typename T>
bool chmax(T &a,const T& b){
    if(a<b){
        a=b;
        return true;
    }
    return false;
}

template <typename T>
bool chmin(T &a,const T& b){
    if(a>b){
        a=b;
        return true;
    }
    return false;
}

ll powmod(ll x,ll n){
    ll res=1;
    while(n>0){
        if(n&1) res*=x;
        x*=x;
        n>>=1;
    }
    return res;
}

int main(){
    ll Q;
    cin>>Q;
    while(Q--){
        string S;
        cin>>S;
        ll N=S.size();
        ll ans=0;
        if(N<2||('0'<=S[1]&&S[1]<='9'))ans=stoll(S);
        else{
            rep2(i,2,N){
                if(S[1]=='b')ans*=2,ans+=S[i]-'0';
                else if(S[1]=='o')ans*=8,ans+=S[i]-'0';
                else{
                    if(0<=S[i]&&S[i]<='9')ans*=16,ans+=S[i]-'0';
                    else ans*=16,ans+=S[i]-'a'+10;
                }
            }
        }
        cout << ans << endl;
    }
}