#include <iostream>
#include <iomanip>
#include <stack>
#include <queue>
#include <string>
#include <vector>
#include <cmath>
#include <algorithm>
#include <deque>
#include <set>
#include <map>
#include <bitset>
#include <atcoder/all>
#define rep(i,n) for(int i = 0; i < n; i++)

using namespace std;
using namespace atcoder;
using ll = long long;

int main() {
	int q;
	cin >> q;

	for (int i = 0; i < q; i++) {
		string s;
		cin >> s;
		if (s.size() == 1) {
			cout << s << endl;
			continue;
		}

		if (s[1] == 'b') {
			ll ans = 0;
			ll bit = 1;
			for (int i = s.size() - 1; i >= 2; i--) {
				ans += bit * (s[i] - '0');
				bit *= 2;
			}
			cout << ans << endl;
		}

		if (s[1] == 'o') {
			ll ans = 0;
			ll bit = 1;
			for (int i = s.size() - 1; i >= 2; i--) {
				ans += bit * (s[i] - '0');
				bit *= 8;
			}
			cout << ans << endl;
		}

		if (s[1] == 'x') {
			ll ans = 0;
			ll bit = 1;
			for (int i = s.size() - 1; i >= 2; i--) {
				if (s[i] - '9' <= 0)  ans += bit * (s[i] - '0');
				else ans += bit * ((s[i] - 'a') + 10);
				bit *= 16;
			}
			cout << ans << endl;
		}

		cout << s << endl;
	}
}