#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<int,int> P;
#define REP(i,n) for(int i=0;i<int(n);i++)


int main(void){
	cin.tie(nullptr);  ios_base::sync_with_stdio(false);
	int i,j,k;

	int T;
	cin >> T;
	while(T--){
		string s;
		cin >> s;

		int n=s.size();

		if(n<=2){
			cout << s << endl;
			continue;
		}

		if(s[0]=='0' && s[1]=='b'){

			ll x=0,e=1;
			for(i=n-1;i>=2;i--){
				x+=(s[i]-'0')*e;
				e*=2;
			}

			cout << x << endl;
		}


		else if(s[0]=='0' && s[1]=='o'){

			ll x=0,e=1;
			for(i=n-1;i>=2;i--){
				x+=(s[i]-'0')*e;
				e*=8;
			}

			cout << x << endl;
		}

		else if(s[0]=='0' && s[1]=='x'){

			ll x=0,e=1;
			for(i=n-1;i>=2;i--){
				if(s[i]-'0'<=9) x+=(s[i]-'0')*e;
				if(s[i]=='a') x+=10*e;
				if(s[i]=='b') x+=11*e;
				if(s[i]=='c') x+=12*e;
				if(s[i]=='d') x+=13*e;
				if(s[i]=='e') x+=14*e;
				if(s[i]=='f') x+=15*e;

				e*=16;
			}

			cout << x << endl;
		}

		else{
			cout << s << endl;
		}


	}



	return 0;
}