#include<iostream>
#include<algorithm>
using namespace std;
struct node{
	string s;
	int id;
}pe[22];
int cmp(node &x,node &y)
{
	if(x.s!=y.s) return x.s.length()<y.s.length();
	return x.s<y.s;
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>pe[i].s;
		pe[i].id=i;
	}
	sort(pe+1,pe+1+n,cmp);
	cout<<pe[n].id<<'\n'<<pe[n].s;
	return 0;
}