#include <bits/stdc++.h>
using namespace std;
template <class K>
inline bool cmax(K& a, const K& b) {
  return (a < b) ? a = b, 1 : 0;
}
template <class K>
inline bool cmin(K& a, const K& b) {
  return (a > b) ? a = b, 1 : 0;
}
inline long long read() {
  register long long s = 0;
  register char c = getchar();
  while (!isdigit(c)) c = getchar();
  while (isdigit(c)) s = (s << 1) + (s << 3) + c - '0', c = getchar();
  return s;
}
int T, c;
long long n, f[31], A, B, m, x, base, res;
int main() {
  register int i;
  T = read(), f[0] = 1;
  for (i = 1; i < 30; i++) f[i] = f[i - 1] * 4;
  while (T--) {
    n = read();
    c = lower_bound(f, f + 30, n + 1) - f - 1;
    n -= f[c] - 1, m = (n - 1) / 3, A = f[c] + m, base = 1;
    B = 0, res = A;
    while (A) {
      switch (A % 4) {
        case 1:
          B += 2 * base;
          break;
        case 2:
          B += 3 * base;
          break;
        case 3:
          B += base;
          break;
      }
      base = base * 4, A /= 4;
    }
    A = res;
    if (n % 3 == 1)
      printf("%lld\n", A);
    else if (n % 3 == 2)
      printf("%lld\n", B);
    else
      printf("%lld\n", A ^ B);
  }
  return 0;
}
