#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct nuk
{
	string t;
	int rank;
}a[21];
bool comp(nuk x,nuk y)
{
	return x.t>y.t;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].t;
		a[i].rank=i;
	}
	sort(a+1,a+1+n,comp);
	cout<<a[1].rank<<endl<<a[1].t;
	return 0;
}