#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

void solve()
{
    int n;
    cin >> n;
    vector <char> v(n);
    for (int i = 0; i < n; i++)
        cin >> v[i];

    sort (v.begin(), v.end());

    char p = v[0];
    int count = 0;
    long long sum = 0;
    for (int i = 1; i < n; i++)
    {
        if (p == v[i]) count++;
        else
        {
            p = v[i];
            sum += count * (count + 1);
            count = 0;
        }
    }
    sum += count * (count + 1);
    cout << sum << endl;
}

int main()
{
    int t;
    cin >> t;
    while (t--)
        solve();
    return 0;
}