Consider the infinite sequence s of positive integers, created by repeating the following steps:

  1. Find the lexicographically smallest triple of positive integers (a, b, c) such that 
    * a ⊕ b ⊕ c = 0, where ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR). 
    * a, b, c are not in s. 
Here triple of integers (a_1, b_1, c_1) is considered to be lexicographically smaller than triple (a_2, b_2, c_2) if sequence [a_1, b_1, c_1] is lexicographically smaller than sequence [a_2, b_2, c_2]. 
  2. Append a, b, c to s in this order. 
  3. Go back to the first step. 



You have integer n. Find the n-th element of s.

You have to answer t independent test cases.

A sequence a is lexicographically smaller than a sequence b if in the first position where a and b differ, the sequence a has a smaller element than the corresponding element in b.

Input

The first line contains a single integer t (1 ≤ t ≤ 10^5) — the number of test cases.

Each of the next t lines contains a single integer n (1≤ n ≤ 10^{16}) — the position of the element you want to know.

Output

In each of the t lines, output the answer to the corresponding test case.

Example

Input


9
1
2
3
4
5
6
7
8
9


Output


1
2
3
4
8
12
5
10
15

Note

The first elements of s are 1, 2, 3, 4, 8, 12, 5, 10, 15, ... 
import os
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(int(3e5)) 
from collections import deque
from queue import PriorityQueue
import math
#  list(map(int, input().split()))
#####################################################################################

class CF(object):    

    def __init__(self):
        self.g = []
        for i in range(100):
            self.g.append( (4**i) * 3)

    def gao(self, x, n):    
        #print(str(x) + ' '+ str(n))
        re = deque()
        rest = x%3
        cnt = int(x//3)
        for i in range(n):
            re.appendleft(cnt%4)
            cnt = int(cnt//4)
        pass
        ans = (rest+1)
        for i in range(n):
            ans<<=2            
            if(re[i]== 1):                
                ans+=rest+1
            elif(re[i]==2):
                if(rest == 0): 
                    ans+=2
                elif(rest == 1):
                    ans+=3
                elif(rest == 2):
                    ans+=1
            elif(re[i]==3):
                if(rest == 0):
                    ans+=3
                elif(rest==1):
                    ans+=1
                elif(rest == 2):
                    ans+=2
        pass
        print(ans)

    def main(self):
        self.t = int(input())
        for _ in range(self.t):
            pos = int(input())
            now = 0
            while(True):
                if(pos>self.g[now]):                    
                    pos-=self.g[now]
                    now+=1
                else:
                    break
            pass
            x = pos-1
            self.gao(x, now)
        pass
if __name__ == "__main__":
    cf = CF()
    cf.main()
    pass
    


