"You must lift the dam. With a lever. I will give it to you.

You must block the canal. With a rock. I will not give the rock to you." 

Danik urgently needs rock and lever! Obviously, the easiest way to get these things is to ask Hermit Lizard for them.

Hermit Lizard agreed to give Danik the lever. But to get a stone, Danik needs to solve the following task.

You are given a positive integer n, and an array a of positive integers. The task is to calculate the number of such pairs (i,j) that i<j and a_i \& a_j ≥ a_i ⊕ a_j, where \& denotes the [bitwise AND operation](https://en.wikipedia.org/wiki/Bitwise_operation#AND), and ⊕ denotes the [bitwise XOR operation](https://en.wikipedia.org/wiki/Bitwise_operation#XOR).

Danik has solved this task. But can you solve it?

Input

Each test contains multiple test cases.

The first line contains one positive integer t (1 ≤ t ≤ 10) denoting the number of test cases. Description of the test cases follows.

The first line of each test case contains one positive integer n (1 ≤ n ≤ 10^5) — length of the array.

The second line contains n positive integers a_i (1 ≤ a_i ≤ 10^9) — elements of the array.

It is guaranteed that the sum of n over all test cases does not exceed 10^5.

Output

For every test case print one non-negative integer — the answer to the problem.

Example

Input


5
5
1 4 3 7 10
3
1 1 1
4
6 2 5 3
2
2 4
1
1


Output


1
3
2
0
0

Note

In the first test case there is only one pair: (4,7): for it 4 \& 7 = 4, and 4 ⊕ 7 = 3.

In the second test case all pairs are good.

In the third test case there are two pairs: (6,5) and (2,3).

In the fourth test case there are no good pairs.
import java.io.*;
import java.util.*;
import java.util.function.Function;

public class Main {

    static long mod = (long) Math.pow(10, 8);

    static class Node {
        int x, y;
        Node rightChild;
        Node belowChild;
        List<Long> values;
    }

    static Node build(int x, int y, int n, long parentValue) {
        Node node = new Node();
        node.x = x;
        node.y = y;
        node.values = new ArrayList<>();
        long value = (long) (parentValue + Math.pow(2, x - 1) * mod + Math.pow(2, y - 1));
        if (y == n && x == n) {
            node.rightChild = null;
            node.belowChild = null;
            node.values.add(value);
        } else {
            if (y < n) {
                node.rightChild = build(x, y + 1, n, value);
                node.values.addAll(node.rightChild.values);
            }
            if (x < n) {
                node.belowChild = build(x + 1, y, n, value);
                node.values.addAll(node.belowChild.values);
            }
        }
        return node;
    }

    public static void main(String[] args) throws Exception {
        MyScanner sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));

        // Start writing your solution here. -------------------------------------
        int t = sc.nextInt();
        while(t-- > 0) {
            int n = sc.nextInt();
            int[] a = new int[n];
            long ans = 0;
            long c = 0;
            for (int i = 0; i < n; i++) {
                a[i] = sc.nextInt();
                if (a[i] == 1) {
                    c++;
                }
            }
            ans += c * (c - 1) / 2;
            for (int i = 0; i < 30; i++) {
                c = 0;
                for (int j = 0; j < n; j++) {
                    a[j] = a[j] >> 1;
                    if (a[j] == 1) {
                        c++;
                    }
                }
                ans += c * (c - 1) / 2;
            }
            out.println(ans);
        }
        // Stop writing your solution here. -------------------------------------
        out.close();
    }

    static int countMatches(String s, char c) {
        return s.length() - s.replaceAll(String.valueOf(c), "").length();
    }

    public static class Pair<L,R> {
        private L l;
        private R r;
        public Pair(L l, R r){
            this.l = l;
            this.r = r;
        }
        public L getL(){ return l; }
        public R getR(){ return r; }
        public void setL(L l){ this.l = l; }
        public void setR(R r){ this.r = r; }
    }

    public static class SegmentTree {

        private final Function<Long, SegmentTreeNode> buildFunction;
        private final Function3<SegmentTreeNode, SegmentTreeNode, SegmentTreeNode> mergeFunction;

        public static class SegmentTreeNode {
            long value;
            long l, r;

            SegmentTreeNode(long value, long l, long r) {
                this.value = value;
                this.l = l;
                this.r = r;
            }
        }

        SegmentTreeNode[] segmentTreeNodes;
        long size;

        SegmentTree(long n, Function<Long, SegmentTreeNode> buildFunction,
                    Function3<SegmentTreeNode, SegmentTreeNode, SegmentTreeNode> mergeFunction) {
            size = 4 * n + 1;
            segmentTreeNodes = new SegmentTreeNode[(int) size];
            this.buildFunction = buildFunction;
            this.mergeFunction = mergeFunction;
        }

        void build(int id, long l, long r) throws Exception {
            if (l == r) {
                segmentTreeNodes[id] = buildFunction.apply(l);
            } else {
                long mid = (l + r) / 2;
                build(2 * id, l, mid);
                build(2 * id + 1, mid + 1, r);
                segmentTreeNodes[id] = mergeFunction.apply(segmentTreeNodes[2 * id], segmentTreeNodes[2 * id + 1]);
            }
        }

        SegmentTreeNode query(int id, long l, long r, long u, long v) {
            if (v < l || u > r) {
                return new SegmentTreeNode(0, 0, 0);
            }

            if (u <= l && v >= r) {
                return segmentTreeNodes[id];
            }

            long mid = (l + r) / 2;
            return mergeFunction.apply(query(2 * id, l, mid, u, v), query(2 * id + 1, mid + 1, r, u, v));
        }
    }

    interface Function1<One> {
        One apply();
    }

    interface Function3<One, Two, Three> {
        Three apply(One one, Two two);
    }

    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;

    //-----------MyScanner class for faster input----------
    public static class MyScanner {

        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            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;
        }

    }
    //--------------------------------------------------------
}