#include<bits/stdc++.h>
#define ll long long
#define ull unsigned long long
#define fr first
#define se second
#define FAST ios::sync_with_stdio(false), cin.tie(0), cout.tie(0)
using namespace std;
int n;
struct node{
	string name;
	int s,id;
}a[105];
bool cmp(node x,node y){
	if(x.s==y.s) return x.id<y.id;
	else return x.s>y.s;
}
int main(){
	FAST;
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i].name;
		string k;
		cin>>k;
		int ks=k.length();
		for(int j=0;j<ks;j++){
			if(k[j]=='s'&&k[j+1]=='o'&&k[j+2]=='s') a[i].s++;
		}
		a[i].id=i;
	}
	sort(a+1,a+1+n,cmp);
	cout<<a[1].name<<endl<<a[1].s;
	return 0;
}