#pragma GCC optimize("Ofast,unroll-loops,no-stack-protector,fast-math")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma comment(linker, "/stack:200000000")
 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef double ld;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;
typedef pair<ld,ld> pdd;
 
#define X first
#define Y second
 
//#include <boost/unordered_map.hpp>
//using namespace boost;
 
/*
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> rbtree;
rbtree T;
*/
 
using i32 = int;
using i64 = long long;
using u8 = unsigned char;
using u32 = unsigned;
using u64 = unsigned long long;
using f64 = double;
using f80 = long double;
//using i128 = __int128_t;
//using u128 = __uint128_t;
//using i128 = i64;
//using u128 = u64;
 
ll power(ll a, ll b, ll p)
{
    if (!b) return 1;
    ll t = power(a, b/2, p);
    t = t*t%p;
    if (b&1) t = t*a%p;
    return t;
}
 
ll exgcd(ll a, ll b, ll &x, ll &y)
{
    if (b == 0)
    {
        x = 1;
        y = 0;
        return a;
    }
    ll px, py;
    ll d = exgcd(b, a%b, px, py);
    x = py;
    y = px-a/b*py;
    return d;
}
 
template<class T>
inline void freshmin(T &a, const T &b)
{
    if (a > b) a = b;
}
 
template<class T>
inline void freshmax(T &a, const T &b)
{
    if (a < b) a = b;
}

template<class T>
void print(const T &a)
{
    for (auto x : a) printf("%d ", x); puts("");
}

const int MAXN = 1010;
const int INF = 1000000000;
//const int MOD = 998244353;
const int MOD = 2520;
const int INV2 = (MOD+1)/2;

int n;
int a[MAXN], b[MAXN];
int F[MAXN][4];

int main()
{
    /*
    int n = 1000;
    
    a[1] = 1;
    for (int i = 2; i <= n; ++ i)
    {
        a[i] = 0;
        for (int j = 1; j <= i-1; ++ j)
            a[i] = (a[i]+a[j]*j)%i;
    }
    
    for (int i = 1; i <= n; ++ i)
    {
        printf("%d ", a[i]);
        if (i%6 == 0) puts("");
    }
    
    */
    
    int T;
    scanf("%d", &T);
    while (T --)
    {
        ll n;
        scanf("%lld", &n);
        n --;
        ll m = n/6;
        ll ans = 0;
        if (n%6 == 0)
            ans = 1+m*4;
        else if (n%6 == 1)
            ans = 1+m*3;
        else if (n%6 == 2)
            ans = 0+m*1;
        else if (n%6 == 3)
            ans = 3+m*6;
        else if (n%6 == 4)
            ans = 0+m*1;
        else if (n%6 == 5)
            ans = 3+m*3;
        printf("%lld\n", ans);
        //printf("%d ", ans);
        //if (i%6 == 0) puts("");
    }
    
    return 0;
}