#include <bits/stdc++.h>
struct result {
  long long level;
  long long sum_up_to;
};
result find_level(long long n) {
  result res;
  res.sum_up_to = 0;
  for (long long level = 0; level <= 100; level += 2) {
    long long this_level = (1ll << level);
    if (n < res.sum_up_to + this_level) {
      res.level = level;
      return res;
    }
    res.sum_up_to += this_level;
  }
  return res;
}
long long solve1(long long n) {
  auto lvl = find_level(n);
  return (n - lvl.sum_up_to) + (1ll << lvl.level);
}
long long solve2(long long n) {
  static const long long mp[] = {0, 2, 3, 1};
  auto lvl = find_level(n);
  long long offset = (n - lvl.sum_up_to);
  long long base = ((1ll << lvl.level) << 1);
  long long spec_offset = 0;
  for (long long level = lvl.level - 2; level >= 0; level -= 2) {
    long long bitmask = 3 * (1ll << level);
    long long idx = (offset & bitmask) >> level;
    spec_offset += mp[idx] * (1ll << level);
  }
  return base + spec_offset;
}
long long solve3(long long n) {
  static const long long mp[] = {0, 3, 1, 2};
  auto lvl = find_level(n);
  long long offset = (n - lvl.sum_up_to);
  long long base = ((1ll << lvl.level) << 1) + ((1ll << lvl.level));
  long long spec_offset = 0;
  for (long long level = lvl.level - 2; level >= 0; level -= 2) {
    long long bitmask = 3 * (1ll << level);
    long long idx = (offset & bitmask) >> level;
    spec_offset += mp[idx] * (1ll << level);
  }
  return base + spec_offset;
}
void solve() {
  long long n;
  std::cin >> n;
  long long ans = 0;
  if (n % 3 == 1) {
    ans = solve1((n - 1) / 3);
  } else if (n % 3 == 2) {
    ans = solve2((n - 2) / 3);
  } else if (n % 3 == 0) {
    ans = solve3((n - 3) / 3);
  }
  std::cout << ans << "\n";
}
int main() {
  std::ios::sync_with_stdio(false);
  int t;
  std::cin >> t;
  while (t--) solve();
  return 0;
}
