#include <bits/stdc++.h>
using namespace std;
long long power(long long x, long long y);
long long mpower(long long x, long long y, long long p);
long long modInv(long long a, long long m);
long long gcdExtended(long long a, long long b, long long *x, long long *y);
bool isPrime(long long n);
long long po[63];
long long get(long long x) {
  long long a = 1, b = 2, c = 3, z = x;
  long long p = 1, q = 3, r = 1;
  while ((po[p] * po[p]) <= x) {
    a *= 4;
    b *= 4;
    c *= 4;
    p++;
  }
  p--;
  x -= po[p] * po[p] - 1;
  while (q <= x) {
    p = (x - 1) / q;
    if (p % 4 == 0) {
      a = a;
      b = b;
      c = c;
    } else if (p % 4 == 1) {
      a = a + r * 1;
      b = b + r * 2;
      c = c + r * 3;
    } else if (p % 4 == 2) {
      a = a + r * 2;
      b = b + r * 3;
      c = c + r * 1;
    } else if (p % 4 == 3) {
      a = a + r * 3;
      b = b + r * 1;
      c = c + r * 2;
    }
    r = r * 4;
    q = q * 4;
  }
  if (z % 3 == 1) {
    return a;
  } else if (z % 3 == 2) {
    return b;
  } else {
    return c;
  }
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long t, i, j, k, l, h, p, q, r, x, y, z, a, b, c, d, f, n, m,
      M = 1000000007;
  char ch, ch2, ch3;
  string s, s1, s2, s3;
  vector<long long> v, w;
  set<long long> S;
  po[0] = 1;
  for (i = 1; i < 63; i++) {
    po[i] = po[i - 1] * 2;
  }
  cin >> t;
  while (t--) {
    cin >> n;
    cout << get(n) << "\n";
  }
  return 0;
}
long long modInv(long long a, long long m) {
  long long x, y;
  long long g = gcdExtended(a, m, &x, &y);
  long long res = (x % m + m) % m;
  return res;
}
long long gcdExtended(long long a, long long b, long long *x, long long *y) {
  if (a == 0) {
    *x = 0, *y = 1;
    return b;
  }
  long long x1, y1;
  long long gcd = gcdExtended(b % a, a, &x1, &y1);
  *x = y1 - (b / a) * x1;
  *y = x1;
  return gcd;
}
long long mpower(long long x, long long y, long long p) {
  long long res = 1;
  x = x % p;
  while (y > 0) {
    if (y & 1) res = (res * x) % p;
    y = y >> 1;
    x = (x * x) % p;
  }
  return res;
}
long long power(long long x, long long y) {
  long long res = 1;
  while (y > 0) {
    if (y & 1) res = res * x;
    y = y >> 1;
    x = x * x;
  }
  return res;
}
bool isPrime(long long n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  long long p = sqrt(n);
  for (int i = 5; i <= p; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
