#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

void solve() {
  string n; cin >> n;
  if (n.length() <= 1 || isdigit(n[1])) {
    cout << n << '\n';
    return;
  }
  int base = 0;
  ll ans = 0;
  if (n.starts_with("0b")) {
    base = 2;
  } else if (n.starts_with("0o")) {
    base = 8;
  } else if (n.starts_with("0x")) {
    base = 16;
    n.erase(n.begin(), next(n.begin(), 2));
    for (const char c : n) {
      ans = ans * base + (isdigit(c) ? c - '0' : c - 'a' + 10);
    }
    cout << ans << '\n';
    return;
  }
  n.erase(n.begin(), next(n.begin(), 2));
  for (const char c : n) {
    ans = ans * base + (c - '0');
  }
  cout << ans << '\n';
}

int main() {
  int q; cin >> q;
  while (q--) solve();
  return 0;
}