#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAXN = 100 + 5;
struct Node
{
    string name;
    string help;
    int score;
    int rnk;
}a[MAXN];
int n, maxn, maxn_num;
string ch;
bool cmp (Node a, Node b);
int search (int x, Node a[]);
int main()
{
    freopen("noi_online2020_save.in","r",stdin);
    freopen("noi_online2020_save.out","w",stdout);
    scanf("%d", &n);
    for (int i = 1; i <= n; ++i)
    {
        cin >> ch;
        a[i].name = ch;
        string h; cin >> h;
        a[i].help = h;
        a[i].rnk = i;
    }
    for (int i = 1; i <= n; ++i)
    {
        a[i].score = search(i, a);
    }
    sort (a + 1, a + n + 1, cmp);
    for (int i = 1; i <= n; ++i)
    {
        maxn = max(maxn, a[i].score);
        //cout << a[i].score << " " << a[i].name << endl;
        if (a[i].score == maxn)
        {
            cout << a[i].name << " ";
        }
        else 
        {
            cout << endl;
            break;
        }
    }
    printf("%d\n", maxn);
    return 0;
}
int search (int x, Node a[])
{
    int sum = 0;
    for (int i = 0; i < a[x].help.size(); ++i)
    {
        //cout << a[x].help[i] << ' ' << a[x].help[i + 1] << " " << a[x].help[i + 2] << endl;
        if (a[x].help[i] == 's' && a[x].help[i + 1] == 'o' && a[x].help[i + 2] == 's')
        {
            sum++;
        }
    }
    return sum;
}
bool cmp (Node a, Node b)
{
    if (a.score != b.score)
    {
        return a.score > b.score;
    }
    else
    {
        return a.rnk < b.rnk;
    }
}