#include <bits/stdc++.h>
using namespace std;
int binarySearch(long long nums[], long long n, long long target, long long searchFirst){
    int low = 0, high = n - 1;
    int result = -1;
    while (low <= high){
        int mid = (low + high)/2;
        if (target == nums[mid])
        {
            result = mid;
            if (searchFirst) 
                high = mid - 1;
            else
                low = mid + 1;
        }
        else if (target < nums[mid])
            high = mid - 1;
        else
            low = mid + 1;
    }
    return result;
}
int main(){
	freopen("stairway.in", "r", stdin);
	freopen("stairway.out", "w", stdout);
	long long t;
	cin >> t;
	while(t--){
		long long n;
		cin >> n;
		long long niz[n];
		for(int i = 0; i < n; i++)
			cin >> niz[i];
		sort(niz, niz + n);
		long long ans = 0;
		for(int i = 0; i < n; i++){
			long long first = binarySearch(niz, n, niz[i], 1);
			long long last = binarySearch(niz, n, niz[i], 0);
			long long count = last - first + 1;
			if(first != -1){
				if(count >= 2)
					ans += 2;
				i = last;
			}
		}
		cout << ans << endl;
	}
	return 0;
}