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

mapper = {"00": "00", "01": "10", "10": "11", "11": "01"}


def f(n):
    n1 = (n - 1) // 3
    if n1 >= 1466015503701:
        x = 1466015503701
        i = 21
    else:
        x = 0
        i = 0
    while n1 >= x + 4 ** i:
        x += 4 ** i
        i += 1

    t1 = 4 ** i + n1 - x
    t2 = int(
        "10" + "".join(mapper[bin(t1)[3:][2 * j : 2 * (j + 1)]] for j in range(i)), 2
    )

    idx = n - n1 * 3 - 1
    if idx == 0:
        return t1
    elif idx == 1:
        return t2
    elif idx == 2:
        return t1 ^ t2
    else:
        raise Exception("bug")


def pp(input):
    T = int(input())
    print("\n".join(map(str, (f(int(input())) for _ in range(T)))))


if "paalto" in os.getcwd() and "pydevconsole" in sys.argv[0]:
    from string_source import string_source

    pp(
        string_source(
            """9
1
2
3
4
5
6
7
8
9"""
        )
    )
else:
    input = sys.stdin.buffer.readline
    pp(input)



assert f(999999999990000) == 1046445486432677


def x():
    for i in range(100000):
        f(999999999990000 + i)

# %timeit -n 1 x()