过于简单，不做评价

#include <bits/stdc++.h>
using namespace std;
const int maxn1 = 110;
const int maxn2 = 3e5 + 10;
int n; string s[maxn1], ans;
int maps[maxn2], Max = -1;
int main(void) {
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    cin >> n;
    for (int i = 1;i <= n;i++) {
        cin >> s[i];
        int sum = 0;
        for (int j = 0;j < (int)s[i].size();j++) {
            if (isupper(s[i][j])) s[i][j] += 'a' - 'A';
            sum += s[i][j];
        }
        maps[sum]++; 
        if (Max < maps[sum]) {
            Max = maps[sum];
            ans = s[i];
        }
    }
    cout << ans;
    return 0;
}