#include<bits/stdc++.h>
using namespace std;
int n;
struct node {
	string name,s;
	int len,fin;
} a[105];
int ans;
string ss[105];
int main() {
	int j=0;
	cin>>n;
	for(int i=1; i<=n; i++) {
		cin>>a[i].name>>a[i].s;
		a[i].len=a[i].s.size();
		int cnt=0;
		string l=a[i].s;
		for(int j=0; j<a[j].len-3; j++) {
			if(l[j]=='s'&&l[j+1]=='o'&&l[j+2]=='s') {
				cnt++;
			}
		}
		a[i].fin=cnt;
		ans=max(ans,cnt);
	}
	for(int i=1; i<=n; i++) {
		if(a[i].fin==ans) {
			cout<<a[i].name<<" ";
		}
	}
	cout<<endl;
	cout<<ans;
	return 0;
}

https://www.luogu.com.cn/record/178864428