#include <bits/stdc++.h>
// #include "atcoder/modint"

using i64 = long long;
// using Fp = atcoder::modint998244353;

int main() {
    int Q;
    std::cin >> Q;
    while (Q--) {
        std::string s;
        std::cin >> s;
        if (s.size() == 1) {
            std::cout << s << std::endl;
            continue;
        }
        i64 ans = 0;
        std::string u = s.substr(2, s.size() - 2);
        const int M = u.size();
        if (s[1] == 'b') {
            i64 base = 1;
            for (int i = 0; i < M; ++i) {
                ans += base * (u[M - i - 1] - '0');
                base *= 2;
            }
        } else if (s[1] == 'o') {
            i64 base = 1;
            for (int i = 0; i < M; ++i) {
                ans += base * (u[M - i - 1] - '0');
                base *= 8;
            }
        } else if (s[1] == 'x') {
            i64 base = 1;
            for (int i = 0; i < M; ++i) {
                auto g = u[M - i - 1] - '0';
                if (0 <= g and g <= 9) ans += base * g;
                else ans += base * (u[M - i - 1] - 'a' + 10);
                base *= 16;
            }
        } else {
            ans = std::stoll(s);
        }
        std::cout << ans << std::endl;
    }
}