#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

const int N = 2e5 + 10;

int n;
int a[N];
vector<int>pos[N];
set<int> num;
set<int> s;
set<int> s2;
vector<int> get(vector<int>& vec)
{
    vector<int> vi = vec;
    sort(vi.begin(), vi.end());
    vi.erase(unique(vi.begin(), vi.end()), vi.end());
    unordered_map<int, int> mp;
    for (int i = 0; i < vi.size(); i++)
    {
        mp[vi[i]] = i;
    }
    vector<int> res(vec.size());
    for (int i = 0; i < vec.size(); i++)
    {
        res[i] = mp[vec[i]];
    }
    return res;
}
void solve()
{
    cin >> n;
    num.clear();
    s.clear();
    s2.clear();
    vector<int>tmp;
    for (int i = 1;i <= n;i++)
    {
        int x;cin >> x;
        tmp.push_back(x);
    }
    tmp = get(tmp);
    int mx = 0;
    for (int i = 1;i <= n;i++)
    {
        a[i] = tmp[i - 1];
        mx = max(mx, a[i]);
        num.insert(-a[i]);
    }
    for (int i = 0;i <= mx;i++)pos[i].clear();
    for (int i = 1; i <= n; i++)
    {
        pos[a[i]].push_back(i);
    }
    int ans = 0;
    int cnt = 0;
    for (auto& it : num)
    {
        int t = -it;
        for (int i = 0;i < pos[t].size();i++)
        {
            s.insert(pos[t][i]);
            s2.insert(-pos[t][i]);
        }
        int lst = -1;
        for (int i = 0;i < pos[t].size();i++)
        {
            int p = pos[t][i];
            auto it_1 = upper_bound(s.begin(), s.end(), p);
            auto it_2 = upper_bound(s2.begin(), s2.end(), -p);
            if (it_1 != s.end())
            {
                if (it_2 != s2.end())
                {
                    if (-*(it_2) != lst)
                    {
                        ans += p + *(it_2)-1;
                        ans += *(it_1)-p - 1;
                    }
                    else ans += *(it_1)-p - 1;
                }
                else
                {
                    ans += p - 1;
                    ans += *(it_1)-p - 1;
                }
            }
            else
            {
                if (it_2 != s2.end())
                {
                    if (-*(it_2) != lst)
                    {
                        ans += p + *(it_2)-1;
                    }
                    ans += n - p;
                }
                else
                {
                    ans += n - p;
                    ans += p - 1;
                }
            }
            lst = p;
        }
    }
    cout << ans << endl;
}
void solve2()
{
    cin >> n;
    num.clear();
    s.clear();
    s2.clear();
    vector<int>tmp;
    for (int i = 1;i <= n;i++)
    {
        int x;cin >> x;
        tmp.push_back(x);
    }
    tmp = get(tmp);
    int mx = 0;
    for (int i = 1;i <= n;i++)
    {
        a[i] = tmp[i - 1];
        mx = max(mx, a[i]);
        num.insert(-a[i]);
    }
    for (int i = 0;i <= mx;i++)pos[i].clear();
    for (int i = 1; i <= n; i++)
    {
        pos[a[i]].push_back(i);
    }
    int ans = 0;
    int cnt = 0;
    int tot = 0;
    for (auto it : num)
    {
        int t = -it;
        for (int i = 0;i < pos[t].size();i++)
        {
            s.insert(pos[t][i]);
            s2.insert(-pos[t][i]);
            tot++;
            tot++;
        }
        int lst = -1;
        for (int i = 0;i < pos[t].size();i++)
        {
            int p = pos[t][i];
            auto it_1 = s.upper_bound(p);
            auto it_2 = s2.upper_bound(-p);
            tot++;
            tot++;
            if (it_1 != s.end())
            {
                if (it_2 != s2.end())
                {
                    if (-*(it_2) != lst)
                    {
                        ans += p + *(it_2)-1;
                        ans += *(it_1)-p - 1;
                    }
                    else ans += *(it_1)-p - 1;
                }
                else
                {
                    ans += p - 1;
                    ans += *(it_1)-p - 1;
                }
            }
            else
            {
                if (it_2 != s2.end())
                {
                    if (-*(it_2) != lst)
                    {
                        ans += p + *(it_2)-1;
                    }
                    ans += n - p;
                }
                else
                {
                    ans += n - p;
                    ans += p - 1;
                }
            }
            lst = p;
        }
    }
    cout << ans << endl;
}
signed main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
    cin >> T;
    while (T--)
    {
        solve2();
    }
    return 0;
}