In fact, the problems E1 and E2 do not have much in common. You should probably think of them as two separate problems.

You are given an integer array a[1 … n] = [a_1, a_2, …, a_n].

Let us consider an empty [deque](https://tinyurl.com/pfeucbux) (double-ended queue). A deque is a data structure that supports adding elements to both the beginning and the end. So, if there are elements [3, 4, 4] currently in the deque, adding an element 1 to the beginning will produce the sequence [\color{red}{1}, 3, 4, 4], and adding the same element to the end will produce [3, 4, 4, \color{red}{1}].

The elements of the array are sequentially added to the initially empty deque, starting with a_1 and finishing with a_n. Before adding each element to the deque, you may choose whether to add it to the beginning or to the end.

For example, if we consider an array a = [3, 7, 5, 5], one of the possible sequences of actions looks like this:    1. |  add 3 to the beginning of the deque: |  deque has a sequence [\color{red}{3}] in it;   
---|---|---  
  2. |  add 7 to the end of the deque: |  deque has a sequence [3, \color{red}{7}] in it;   
  3. |  add 5 to the end of the deque: |  deque has a sequence [3, 7, \color{red}{5}] in it;   
  4. |  add 5 to the beginning of the deque: |  deque has a sequence [\color{red}{5}, 3, 7, 5] in it;   
  
Find the minimal possible number of inversions in the deque after the whole array is processed. 

An inversion in sequence d is a pair of indices (i, j) such that i < j and d_i > d_j. For example, the array d = [5, 3, 7, 5] has exactly two inversions — (1, 2) and (3, 4), since d_1 = 5 > 3 = d_2 and d_3 = 7 > 5 = d_4.

Input

The first line contains an integer t (1 ≤ t ≤ 1000) — the number of test cases.

The next 2t lines contain descriptions of the test cases. 

The first line of each test case description contains an integer n (1 ≤ n ≤ 2 ⋅ 10^5) — array size. The second line of the description contains n space-separated integers a_i (-10^9 ≤ a_i ≤ 10^9) — elements of the array.

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

Output

Print t lines, each line containing the answer to the corresponding test case. The answer to a test case should be a single integer — the minimal possible number of inversions in the deque after executing the described algorithm.

Example

Input


6
4
3 7 5 5
3
3 2 1
3
3 1 2
4
-1 2 2 -1
4
4 5 1 3
5
1 3 1 3 2


Output


2
0
1
0
1
2

Note

One of the ways to get the sequence [5, 3, 7, 5] in the deque, containing only two inversions, from the initial array [3, 7, 5, 5] (the first sample test case) is described in the problem statement. 

Also, in this example, you could get the answer of two inversions by simply putting each element of the original array at the end of the deque. In this case, the original sequence [3, 7, 5, 5], also containing exactly two inversions, will be in the deque as-is.
import java.io.*;
import java.math.BigInteger;
import java.util.HashMap;
import java.util.LinkedList;
import java.util.Map;
import java.util.StringTokenizer;

public class Solution {

    private static final String checkerSolutionOutput = "/home/quanvda/Main/Projects/MyProject/java-competitive-programming/src/_checker.solution.out";
    private static final String checkerInput = "/home/quanvda/Main/Projects/MyProject/java-competitive-programming/src/_checker.in";
    private static final String checkerBruteforcesOutput = "/home/quanvda/Main/Projects/MyProject/java-competitive-programming/src/_checker.bruteforces.out";
    private static final String fileInput = "/home/quanvda/Main/Projects/MyProject/java-competitive-programming/src/_in";
    private static final String fileOutput = "/home/quanvda/Main/Projects/MyProject/java-competitive-programming/src/_out";


    private static class Config {
        private static final boolean useInputFile = false;
        private static final boolean useOutputFile = false;
        private static final String inputFile = fileInput;
        private static final String outputFile = checkerSolutionOutput;
    }

    public static void main(String[] args) throws Exception {
        run();
    }

    public static void run() throws Exception {
        FastScanner sc = new FastScanner();
        int t = 1;
        t = sc.nextInt();
        BufferedWriter writer = getWriter();
        for (int i = 0; i < t; i++)
            solve(sc, writer);
        writer.flush();
    }

    private static void solve(FastScanner sc, BufferedWriter writer) throws Exception {
        int n = sc.nextInt();
        int a[] = sc.readArray(n);
        AVLTree tree = new AVLTree();
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int lt = tree.countOccurenceOfKeysLessThan(a[i]);
            int gt = i - lt - tree.getKeyOccurence(a[i]);
//            System.out.println("a[i]: " + a[i]);
//            System.out.println("lt: " + lt + ", gt: " + gt);
            if (lt < gt) ans += lt;
            else ans += gt;
            tree.insert(a[i]);
        }
        writer.write(ans + "\n");
    }


    public static class AVLTree {
    /* <<<<< INSERTION >>>>>

    ### LEFT LEFT CASE

        T1, T2, T3 and T4 are subtrees.
             z                                      y
            / \                                   /   \
           y   T4      Right Rotate (z)          x      z
          / \          - - - - - - - - ->      /  \    /  \
         x   T3                               T1  T2  T3  T4
        / \
      T1   T2


   ### LEFT RIGHT CASE

             z                               z                           x
            / \                            /   \                        /  \
           y   T4  Left Rotate (y)        x    T4  Right Rotate(z)    y      z
          / \      - - - - - - - - ->    /  \      - - - - - - - ->  / \    / \
        T1   x                          y    T3                    T1  T2 T3  T4
            / \                        / \
          T2   T3                    T1   T2

   ### RIGHT RIGHT CASE

           z                                y
         /  \                            /   \
        T1   y     Left Rotate(z)       z      x
            /  \   - - - - - - - ->    / \    / \
           T2   x                     T1  T2 T3  T4
               / \
             T3  T4

   ### RIGHT LEFT CASE

        z                            z                            x
      / \                          / \                          /  \
    T1   y   Right Rotate (y)    T1   x      Left Rotate(z)   z      y
        / \  - - - - - - - - ->     /  \   - - - - - - - ->  / \    / \
       x   T4                      T2   y                  T1  T2  T3  T4
      / \                              /  \
    T2   T3                           T3   T4

     */

        private Tree tree;

        public AVLTree() {
            tree = new Tree();
        }

        public void insert(int key) {
            int lastOcc = tree.keyOccurence.getOrDefault(key, 0);
            tree.keyOccurence.put(key, lastOcc + 1);
            tree.root = tree.insert(tree.root, key);
        }

        public int countKeysLessThan(int key) {
            return tree.countKeysLessThan(key);
        }

        public int countOccurenceOfKeysLessThan(int key) {
            return tree.countOccurenceOfKeysLessThan(key);
        }

        public int getKeyOccurence(int key) {
            return tree.keyOccurence.getOrDefault(key, 0);
        }

        public void preOrder() {
            preOrderUtil(tree.root);
            System.out.println("");
        }

        private void preOrderUtil(Node node) {
            if (node != null) {
                System.out.print(node.key + " ");
                preOrderUtil(node.left);
                preOrderUtil(node.right);
            }
        }

        public void printNodes() {
            printNodesUtil(tree.root);
        }

        private void printNodesUtil(Node node) {
            if (node != null) {
                System.out.println("<<<<NODE>>>>");
                System.out.println("KEY: " + node.key + " ");
                System.out.println("_childcount: " + node.childCount);
                if (node.left != null) System.out.println("_left: " + node.left.key);
                if (node.right != null) System.out.println("_right: " + node.right.key);
                System.out.println("");
                printNodesUtil(node.left);
                printNodesUtil(node.right);
            }
        }

        private static class Node {
            int key, height, childCount, childOccurence;
            Node left, right;

            Node(int key) {
                this.key = key;
                this.height = 1;
                this.childCount = 0;
                this.childOccurence = 0;
            }
        }

        private static class Tree {
            private Node root;
            private Map<Integer, Integer> keyOccurence = new HashMap<>();

            // > cacculate-child-occurence

            private int countChildOccurence(Node n) {
                if (n == null) return 0;
                int result = 0;
                if (n.left != null) result += n.left.childOccurence + keyOccurence.get(n.left.key);
                if (n.right != null) result += n.right.childOccurence + keyOccurence.get(n.right.key);
                return result;
            }

            // < caculate-child-occcurence

            // > caculate-child-count

            private int countChild(Node n) {
                if (n == null) return 0;
                int result = 0;
                if (n.left != null) result += n.left.childCount + 1;
                if (n.right != null) result += n.right.childCount + 1;
                return result;
            }

            // < cacuate-child-count

            // > caculate-height

            private int caculateHeight(Node n) {
                if (n == null) return 0;
                int result = 0;
                if (n.left != null) result = Math.max(result, n.left.height);
                if (n.right != null) result = Math.max(result, n.right.height);
                return result + 1;
            }

            // < caculate-height

            // > rotate

            private Node rightRotate(Node z) {
            /*
                         z                                       y
                        / \                                    /   \
                       y   m       Right Rotate (z)          x      z
                      / \          - - - - - - - - ->       / \    / \
                     x   n                                 k  p   n   m
                   / \
                  k   p
            */
                Node y = z.left;
                Node n = y.right;
                y.right = z;
                z.left = n;
                // height
                z.height = caculateHeight(z);
                y.height = caculateHeight(y);
                // child count
                z.childCount = countChild(z);
                y.childCount = countChild(y);
                // child occurence
                z.childOccurence = countChildOccurence(z);
                y.childOccurence = countChildOccurence(y);

                return y;
            }

            private Node leftRotate(Node y) {
            /*
                     z                                 z
                    / \                              /  \
                   y   m     Left Rotate (y)        x    m
                  / \        - - - - - - - - ->    / \
                n    x                            y   k
                    / \                          / \
                  p    k                        n   p
            */
                Node x = y.right;
                Node p = x.left;
                x.left = y;
                y.right = p;
                // height
                y.height = caculateHeight(y);
                x.height = caculateHeight(x);
                // child count
                y.childCount = countChild(y);
                x.childCount = countChild(x);
                // child occurence
                y.childOccurence = countChildOccurence(y);
                x.childOccurence = countChildOccurence(x);
                return x;
            }

            // < rotate

            private int getBalance(Node n) {
                return n == null ? 0 : caculateHeight(n.left) - caculateHeight(n.right);
            }

            private Node insert(Node n, int key) {
                if (n == null) return new Node(key);
                if (key < n.key) n.left = insert(n.left, key);
                if (key > n.key) n.right = insert(n.right, key);
                if (key == n.key) return n;
                n.height = caculateHeight(n);
                n.childCount = countChild(n);
                n.childOccurence = countChildOccurence(n);
                int balance = getBalance(n);
                if (balance > 1) {
                    if (key < n.left.key) return rightRotate(n);
                    if (key > n.left.key) {
                        n.left = leftRotate(n.left);
                        return rightRotate(n);
                    }
                }
                if (balance < -1) {
                    if (key > n.right.key) return leftRotate(n);
                    if (key < n.right.key) {
                        n.right = rightRotate(n.right);
                        return leftRotate(n);
                    }
                }
                return n;
            }

            // > count-node-less-than

            private int countKeysLessThanAnswer;

            private int countKeysLessThan(int key) {
                countKeysLessThanAnswer = 0;
                countKeysLessThanUtil(root, key);
                return countKeysLessThanAnswer;
            }

            private void countKeysLessThanUtil(Node n, int key) {
                if (n == null) return;
                if (key > n.key) {
                    countKeysLessThanAnswer += 1;
                    if (n.left != null) countKeysLessThanAnswer += n.left.childCount + 1;
                    countKeysLessThanUtil(n.right, key);
                } else if (key < n.key) {
                    countKeysLessThanUtil(n.left, key);
                } else {
                    if (n.left != null) countKeysLessThanAnswer += n.left.childCount + 1;
                    return;
                }
            }

            // < count-node-less-than

            // > count-occurence-of-keys-less-than

            private int countOccurenceOfKeysLessThanResult;

            private int countOccurenceOfKeysLessThan(int key) {
                countOccurenceOfKeysLessThanResult = 0;
                countOccurenceOfKeysLessThanUtil(root, key);
                return countOccurenceOfKeysLessThanResult;
            }

            private void countOccurenceOfKeysLessThanUtil(Node n, int key) {
                if (n == null) return;
                if (key > n.key) {
                    countOccurenceOfKeysLessThanResult += keyOccurence.get(n.key);
                    if (n.left != null)
                        countOccurenceOfKeysLessThanResult += n.left.childOccurence + keyOccurence.get(n.left.key);
                    countOccurenceOfKeysLessThanUtil(n.right, key);
                } else if (key < n.key) {
                    countOccurenceOfKeysLessThanUtil(n.left, key);
                } else {
                    if (n.left != null)
                        countOccurenceOfKeysLessThanResult += n.left.childOccurence + keyOccurence.get(n.left.key);
                    return;
                }
            }

            // < count-occurence-of-keys-less-than

        }
    }


    private static class Pair<A, B> {
        A first;
        B second;

        public Pair(A first, B second) {
            this.first = first;
            this.second = second;
        }

        public Pair() {
        }
    }

    private static class FastScanner {

        BufferedReader br;
        StringTokenizer st;

        private FastScanner() throws FileNotFoundException {
            if (Config.useInputFile)
                this.br = new BufferedReader(new InputStreamReader(new FileInputStream(Config.inputFile)));
            else
                this.br = new BufferedReader(new InputStreamReader(System.in));
            this.st = new StringTokenizer("");
        }

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

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

        int[] readArray(int n) {
            int[] a = new int[n];
            for (int i = 0; i < n; i++) a[i] = nextInt();
            return a;
        }

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

    private static BufferedWriter getWriter() throws Exception {
        if (Config.useOutputFile)
            return getFileWriter();
        return getConsoleWriter();
    }

    private static BufferedWriter getFileWriter() throws Exception {
        PrintWriter writer = new PrintWriter(Config.outputFile);
        writer.print("");
        writer.close();
        return new BufferedWriter(new OutputStreamWriter(new FileOutputStream(Config.outputFile)));
    }

    private static BufferedWriter getConsoleWriter() {
        return new BufferedWriter(new OutputStreamWriter(System.out));
    }
}
