character mapping

// Those who cannot remember the past are
// condemned to repeat it (use DP -_-)
// - George Santayana

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define ll long long
#define ull unsigned long long
#define MOD 1000000007
#define PI acos(-1)
#define ceil(a, b) (((a) / (b)) + ((a) % (b) ? 1 : 0))
#define imin INT_MIN
#define imax INT_MAX
#define llmax LLONG_MAX
#define llmin LLONG_MIN
#define inf 2000000000
#define nl '\n'
#define ppcnt __builtin_popcount
#define ppcntll __builtin_popcountll
#define clz __builtin_clz
#define clzll __builtin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define modulo(a, b, mod) ((((a) % (mod)) * ((b) % (mod))) % (mod))
#define cnte(v, x) count(all(v), (x))
#define mine(v) min_element(all(v))
#define maxe(v) max_element(all(v))
#define updmin(a, b) a = min(a, b)
#define updmax(a, b) a = max(a, b)
#define findmod(x, m) x = ((x) % (m) + (m)) % m
#define getmod(x, m) ((x) % (m) + (m)) % (m)
#define debug(x) cout << "x: " << (x) << nl;
#define debug2(x, y) cout << "x: " << (x) << " y: " << y << nl;
#define ordered_set tree<pair<int, int>, null_type, less<>, rb_tree_tag, tree_order_statistics_int_update>
#define ordered_map tree<int, int, less<>, rb_tree_tag, tree_order_statistics_int_update>

//vector<int> dx = {0, 0, 1, -1, 1, 1, -1, -1}, dy = {1, -1, 0, 0, 1, -1, 1, -1};
//vector<int> dx = {0, 0, 1, -1}, dy = {1, -1, 0, 0};

template<typename T = int>
istream &operator>>(istream &in, vector<pair<int, int>> &v) {
    for (auto &[x, y]: v) in >> x >> y;
    return in;
}

template<typename T = int>
istream &operator>>(istream &in, vector<T> &v) {
    for (T &i: v) in >> i;
    return in;
}

template<typename T = int>
ostream &operator<<(ostream &out, const vector<T> &v) {
    for (const T &x: v)
        out << x << ' ';
    return out;
}

template<typename T = pair<int, int>>
ostream &operator<<(ostream &out, const vector<pair<int, int>> &v) {
    for (auto &[x, y]: v) {
        out << x << ' ' << y << nl;
    }
    return out;
}

void Start_Crushing() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#endif
}

void solve(){
    int n; cin >> n;
    vector<string> v(n); cin >> v;

    vector<int> max_idx(26, -inf);
    bitset<26> leading;

    for(auto& i : v){
        for(int idx = 0; idx < i.size(); idx++){
            if(isalpha(i[idx])) {
                updmax(max_idx[i[idx] - 'A'], (int) i.size() - idx);
                if(idx)
                    continue;
                leading[i[idx] - 'A'] = true;
            }
        }
    }
    vector<int> freq(26);

    for(auto& i : v){
        for(int idx = 0; idx < i.size(); idx++){
            if(idx == max_idx[i[idx] - 'A']){
                freq[i[idx] - 'A']++;
            }
        }
    }

    map<char, char> mapping;

    char zero = '-';
    int pos = -inf;

    for(int i = 0; i < 26; i++){
        if(max_idx[i] != -inf and not leading[i]){
            if(max_idx[i] > pos){
                pos = max_idx[i];
                zero = char(i + 'A');
            }else if(max_idx[i] == pos){
                zero = freq[zero - 'A'] > freq[i] ? zero : char(i + 'A');
            }
        }
    }

    if(zero != '-')
        mapping[zero] = '0';

    vector<char> alpha(26);
    iota(all(alpha), 'A');

    sort(all(alpha), [&](char a, char b){
        if(max_idx[a - 'A'] == max_idx[b - 'A'])
            return freq[a - 'A'] > freq[b - 'A'];
        return max_idx[a - 'A'] > max_idx[b - 'A'];
    });

    int curr = 1;
    for(auto& i : alpha){
        if(max_idx[i - 'A'] != inf and i != zero){
            mapping[i] = char(curr++ + '0');
        }
    }

    for(auto& i : v){
        for(auto& c : i){
            if(isalpha(c))
                c = mapping[c];
        }
    }

    ll sum = 0;
    for(auto& i : v){
        sum += stoll(i);
    }
    cout << sum;
}

void set_file(string &file_name) {
    freopen((file_name + ".in").c_str(), "r", stdin);
    freopen((file_name + ".out").c_str(), "w", stdout);
}

int main() {
    Start_Crushing();

//    string file_name = "inverse2";
//    set_file(file_name);
    int t = 1;
    /*Multiple test cases?*/ cin >> t;
    while (t--) {
        solve();
        if (!t)
            break;
        cout << nl;
    }

//    for(int tc = 1; tc <= t; tc++){
////        cout << "Case " << tc << ": ";
//        solve();
//        if(tc != t)
//            cout << nl;
//    }

    return 0;
}