import java.util.*;
import java.io.*; 
import java.text.*;
//Solution Credits: Taranpreet Singh
public class Main{
    //SOLUTION BEGIN
    void solve(int TC) throws Exception{
        int n = ni();
        TreeMap<Integer, Integer> waste = new TreeMap<>();
        for(int i = 0; i< n; i++){
            int x = ni();
            waste.put(x, waste.getOrDefault(x, 0)+1);
        }
        int[][] f = new int[waste.size()][];n = 0;
        for(Map.Entry<Integer, Integer> e:waste.entrySet())
            f[n++] = new int[]{e.getKey(), e.getValue()};
        Arrays.sort(f, (int[] i1, int[] i2) -> Integer.compare(i1[1], i2[1]));
        TreeMap<Integer, Integer> map = new TreeMap<>();
        for(int i = 0; i< n; i++)if(i==0 || f[i][1]!=f[i-1][1])map.put(f[i][1], i);
        int[][] qu = new int[n][];int c = 0;
        TreeSet<Integer> set = new TreeSet<>();
        for(int i = 0; i< n; i++){
            Map.Entry<Integer, Integer> ceil = map.ceilingEntry(f[i][0]);
            set.add(f[i][0]);
            if(ceil!=null){
                set.add(f[i][1]);
                qu[c++] = new int[]{ceil.getValue(), f[i][1]};
            }
        }
        Arrays.sort(qu,0,c, (int[] i1, int[] i2) -> Integer.compare(i2[0], i1[0]));
        HashMap<Integer, Integer> comp = new HashMap<>();int cnt = 0;
        for(int x:set)comp.put(x, cnt++);
        RankTree t = new RankTree(cnt);long ans = 0;
        for(int i = 0, j = n-1; i< c; i++){
            while(j>= qu[i][0])t.update(comp.get(f[j--][0]), true);
            ans+=t.query(comp.get(qu[i][1]));
        }
        pn(ans);
    }
    class RankTree{
        int m = 1;
        int[] sum;
        public RankTree(int n){
            while(m<n)m<<=1;
            sum = new int[m<<1];
        }
        void update(int p, boolean add){
            p+=m;
            sum[p]+=(add)?1:-1;
            for(p>>=1; p>0; p>>=1)sum[p] = sum[p<<1]+sum[p<<1|1];
        }
        int query(int k){
            return query(0, k, 0, m-1, 1);
        }
        int query(int l, int r, int ll, int rr, int i){
            if(l==ll && r==rr)return sum[i];
            int mid = (ll+rr)/2;
            if(r<=mid)return query(l,r,ll,mid,i<<1);
            else if(l>mid)return query(l,r,mid+1,rr,i<<1|1);
            else return query(l,mid,ll,mid,i<<1)+query(mid+1,r,mid+1,rr,i<<1|1);
        }
    }
    //SOLUTION ENDS
    long mod = (long)1e9+7, IINF = (long)1e17;
    final int MAX = (int)1e6+1, INF = (int)2e9, root = 3;
    DecimalFormat df = new DecimalFormat("0.000000000000");
    double PI = 3.1415926535897932384626433832792884197169399375105820974944, eps = 1e-8;
    static boolean multipleTC = true, memory = false;
    FastReader in;PrintWriter out;
    void run() throws Exception{
        in = new FastReader();
        out = new PrintWriter(System.out);
        int T = (multipleTC)?ni():1;
        //Solution Credits: Taranpreet Singh
        for(int i = 1; i<= T; i++)solve(i);
        out.flush();
        out.close();
    }
    public static void main(String[] args) throws Exception{
        if(memory)new Thread(null, new Runnable() {public void run(){try{new Main().run();}catch(Exception e){e.printStackTrace();}}}, "1", 1 << 28).start();
        else new Main().run();
    }
    long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
    int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
    int bit(long n){return (n==0)?0:(1+bit(n&(n-1)));}
    void p(Object o){out.print(o);}
    void pn(Object o){out.println(o);}
    void pni(Object o){out.println(o);out.flush();}
    String n(){return in.next();}
    String nln(){return in.nextLine();}
    int ni(){return Integer.parseInt(in.next());}
    long nl(){return Long.parseLong(in.next());}
    double nd(){return Double.parseDouble(in.next());}

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

        public FastReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }

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

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