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, ... 

def find_answer(n):
    trio_num, trio_place = n // 3, n % 3

    digit = 1
    while trio_num >= 0:
        trio_num -= digit
        digit *= 4
    digit //= 4
    trio_num += digit

    t1 = digit + trio_num
    if trio_place == 0:
        return t1
    t2, t3 = digit*2, digit*3

    new_digit = 1
    while new_digit < digit:
        x = t1 % 4
        if x == 1:
            t2 += new_digit * 2
            t3 += new_digit * 3
        elif x == 2:
            t2 += new_digit * 3
            t3 += new_digit * 1
        elif x == 3:
            t2 += new_digit * 1
            t3 += new_digit * 2
        t1 //= 4
        new_digit *= 4

    return t2 if trio_place == 1 else t3


if __name__ == '__main__':
    n = int(input())

    ans = []
    for i in range(n):
        x = int(input())
        ans += [find_answer(x-1)]

    for x in ans:
        print(x)