Gym - 101502B. Linear Algebra Test

Dr. Wail is preparing for today's test in linear algebra course. The test's subject is Matrices Multiplication.

Dr. Wail has n matrices, such that the size of the i^th matrix is (a_i × b_i), where a_i is the number of rows in the i^th matrix, and b_i is the number of columns in the i^th matrix.

Dr. Wail wants to count how many pairs of indices i and j exist, such that he can multiply the i^th matrix with the j^th matrix.

Dr. Wail can multiply the i^th matrix with the j^th matrix, if the number of columns in the i^th matrix is equal to the number of rows in the j^th matrix.

Input

The first line contains an integer T (1 ≤ T ≤ 100), where T is the number of test cases.

The first line of each test case contains an integer n (1 ≤ n ≤ 10⁵), where n is the number of matrices Dr. Wail has.

Then n lines follow, each line contains two integers a_i and b_i (1 ≤ a_i, b_i ≤ 10⁹) (a_i ≠ b_i), where a_i is the number of rows in the i^th matrix, and b_i is the number of columns in the i^th matrix.

Output

For each test case, print a single line containing how many pairs of indices i and j exist, such that Dr. Wail can multiply the i^th matrix with the j^th matrix.

Example

Input

1
5
2 3
2 3
4 2
3 5
9 4

Output

5

Note

As input/output can reach huge size it is recommended to use fast input/output methods: for example, prefer to use scanf/printf instead of cin/cout in C++, prefer to use BufferedReader/PrintWriter instead of Scanner/System.out in Java.

In the first test case, Dr. Wail can multiply the 1^st matrix (2 × 3) with the 4^th matrix (3 × 5), the 2^nd matrix (2 × 3) with the 4^th matrix (3 × 5), the 3^rd matrix (4 × 2) with the 1^st and second matrices (2 × 3), and the 5^th matrix (9 × 4) with the 3^rd matrix (4 × 2). So, the answer is 5.

思路

因为10^9，所以用map映射一下。细节见代码，map<typ1, typ2> typ1 = first, typ2 = second, typ2 = map[typ1];

#include <iostream>
#include <stdio.h>
#include <string.h>
#include <algorithm>
#include <queue>
#include <math.h>
#include <bits/stdc++.h>
using namespace std;

typedef long long LL;

int main()
{
    int T;
    scanf("%d", &T);
    while(T--)
    {
        map<int, LL> m1; // second 是Longlong，因为ans为Longlong
        map<int, LL> m2;
        int n;
        scanf("%d", &n);
        for(int i = 0; i < n; i++)
        {
            int x, y;
            scanf("%d%d", &x,&y);
            m1[x]++;
            m2[y]++;
        }
        map<int, LL>::iterator it;
        LL ans = 0;
        for(it = m1.begin(); it!= m1.end(); it++)
        {
            int cnt1 = it->first;
            int cnt2 = it->second;
            ans+=m2[cnt1]*cnt2;
        }
        printf("%lld\n", ans);
    }

}