Lately, Mr. Chanek frequently plays the game Arena of Greed. As the name implies, the game's goal is to find the greediest of them all, who will then be crowned king of Compfestnesia.

The game is played by two people taking turns, where Mr. Chanek takes the first turn. Initially, there is a treasure chest containing N gold coins. The game ends if there are no more gold coins in the chest. In each turn, the players can make one of the following moves:

  * Take one gold coin from the chest. 
  * Take half of the gold coins on the chest. This move is only available if the number of coins in the chest is even. 



Both players will try to maximize the number of coins they have. Mr. Chanek asks your help to find the maximum number of coins he can get at the end of the game if both he and the opponent plays optimally.

Input

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

The next T lines each contain a single integer N (1 ≤ N ≤ 10^{18}).

Output

T lines, each line is the answer requested by Mr. Chanek.

Example

Input


2
5
6


Output


2
4

Note

For the first case, the game is as follows: 

  1. Mr. Chanek takes one coin. 
  2. The opponent takes two coins. 
  3. Mr. Chanek takes one coin. 
  4. The opponent takes one coin. 



For the second case, the game is as follows: 

  1. Mr. Chanek takes three coins. 
  2. The opponent takes one coin. 
  3. Mr. Chanek takes one coin. 
  4. The opponent takes one coin. 
import java.util.*;
import java.io.*;
import java.math.*;

import static java.lang.Math.*;

public class Solution2 {

    //------------------------------------------CONSTANTS---------------------------------------------------------------
    public static final int MOD = (int) (1e9 + 7);

    //---------------------------------------------I/0------------------------------------------------------------------

    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader()
        {
            br = new BufferedReader(
                    new InputStreamReader(System.in));
        }

        String next()
        {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() { return Integer.parseInt(next()); }

        long nextLong() { return Long.parseLong(next()); }

        double nextDouble()
        {
            return Double.parseDouble(next());
        }

        String nextLine()
        {
            String str = "";
            try {
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    public static void print(String s) {
        System.out.println(s);
    }

    public static void main(String[] args) {
        FastReader sc = new FastReader();

        int t = 1;
        t = sc.nextInt();

        for(int i = 0; i<t; i++) {
            System.out.println(solve(sc));
        }
    }

    //------------------------------------------------SOLVE-------------------------------------------------------------

    public static long solve(FastReader sc) {
        long n = sc.nextLong();

        long sum = 0;
        boolean me = true;
        while (n>0) {
            if (n%2==1) {
                n-=1;
                if (me) {
                    sum += 1;
                }
            } else {
                long half = n/2;
                if (half%2==0 && n!=4) {
                    n -=1;
                    if (me) {
                        sum += 1;
                    }
                } else {
                    n -= half;
                    if (me) {
                        sum += half;
                    }
                }
            }
            me = !me;
        }

        return sum;
    }

    //-----------------------------------------------FUNCTIONS----------------------------------------------------------

    public static void printArray(int[] a) {
        for(int i = 0; i<a.length; i++) {
            System.out.print(a[i] + " ");
        }
    }

    // first element that is not less than target
    public static int lowerBound(int[] arr, int begin, int end, int target) {
        while(begin < end) {
            int mid = begin + (end - begin) / 2;
            // When the element is less than the mid target
            if(arr[mid] < target)
                // begin to mid + 1, arr [begin] value is less than or equal target
                begin = mid + 1;
                // When the mid target element when greater than or equal
            else if(arr[mid] >= target)
                end = mid;
        }
        return begin;
    }

    // first element that is greater than target
    public static int upperBound(int[] arr, int begin, int end, int target) {
        while(begin < end) {
            int mid = begin + (end - begin) / 2;
            if(arr[mid] <= target)
                begin = mid + 1;
            else if(arr[mid] < target)
                end = mid;
        }
        return begin;
    }

    // generate permutations (call search and access through permutations)
    public static class Permutations {
        List<List<Integer>> permutations = new ArrayList<>();
        List<Integer> permutation = new ArrayList<>();
        boolean[] taken;
        int[] a;

        public Permutations(int[] a) {
            this.a = a;
            taken = new boolean[a.length];
        }

        void search() {
            if (permutation.size()==a.length) {
                permutations.add(new ArrayList<>(permutation));
            } else {
                for (int i = 0; i<a.length; i++) {
                    if (taken[i]) {
                        continue;
                    }
                    taken[i] = true;
                    permutation.add(a[i]);
                    search();
                    taken[i] = false;
                    permutation.remove(permutation.size()-1);
                }
            }
        }
    }

    // generate subsets (call search and access subsets)
    public static class Subsets {
        List<List<Integer>> subsets = new ArrayList<>();
        List<Integer> subset = new ArrayList<>();

        void search(int[] a, int x) {
            if (x == a.length) {
                subsets.add(new ArrayList<>(subset));
            } else {
                subset.add(a[x]);
                search(a, x+1);
                subset.remove(subset.size() - 1);
                search(a, x+1);
            }
        }
    }

    public static int[] prefixSum(int[] a) {
        int n = a.length;
        int[] ps = new int[n];
        ps[0] = a[0];

        for (int i = 1; i<n; i++) {
            ps[i] = ps[i-1] + a[i];
        }

        return ps;
    }

    public static int[][] prefixSum2D(int[][] a) {
        int n = a.length;
        int m = a[0].length;
        int[][] ps = new int[n][m];
        ps[0][0] = a[0][0];

        for (int j = 1; j<m; j++) {
            ps[0][j] = ps[0][j-1] + a[0][j];
        }
        for (int i = 1; i<n; i++) {
            ps[i][0] = ps[i-1][0] + a[i][0];
        }

        for (int i = 1; i<n; i++) {
            for (int j = 1; j<m; j++) {
                ps[i][j] = ps[i-1][j] + ps[i][j-1] - ps[i-1][j-1] + a[i][j];
            }
        }

        return ps;
    }

    public static double log2(double a) {
        return log(a)/log(2);
    }

    //----------------------------------------DATA-STRUCTURES-----------------------------------------------------------

    // Range queries (i.e. RMQ) in O(1), others with functions in O(log n)
    public static class SparseTable {
        int[][] st;
        int n;
        int k;

        public SparseTable(int[] a) {
            n = a.length;
            k = (int) log2(n);
            st = new int[n][k+1];

            for (int i = 0; i<n; i++) {
                st[i][0] = a[i];
            }

            // 1<<j == 2^j
            for (int j = 1; j<=k; j++) {
                for (int i = 0; i + (1 << j) <= n; i++) {
                    st[i][j] = min(st[i][j-1], st[i + (1 << (j - 1))][j - 1]);
                }
            }
        }

        //not always available O(log n) -- change the constructor to use it
        public long sumQuery(int l, int r) {
            long sum = 0;
            for (int j = k; j>=0; j--) {
                if ((1 << j) <= r - l + 1) {
                    sum += st[l][j];
                    l += 1 << j;
                }
            }

            return sum;
        }

        //always available O(1) -- change this and the constructor for rangeMaxQuery
        public int rangeMinQuery(int l, int r) {
            int j = (int) log2(r - l + 1);
            int min = min(st[l][j], st[r - (1 << j) + 1][j]);
            return min;
        }

    }

    public static class BinaryIndexedTree {

        int[] bit;

        public BinaryIndexedTree(int[] a) {
            int n = a.length;
            bit = new int[n+1];
            // Store the actual values in BITree[]
            // using update()
            for(int i = 0; i < n; i++)
                updateBit(i, a[i]);
        }

        // O(log n) update delta at index in the array (do it on the array and then call this function)
        public void updateBit(int index, int delta) {
            index += 1;

            while (index <= bit.length) {
                bit[index] += delta;

                index += index & (-index);
            }
        }

        // Computes sum a[0...index] in O(log n)
        public int getSum(int index) {
            int sum = 0;

            index += 1;

            while (index > 0) {
                sum += bit[index];

                index -= index & (-index);
            }

            return sum;
        }
    }
}