#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
struct Node
{
	int id;
	string s;
}p[25];
bool cmp(Node x,Node y)
{
	if(x.s.size()!=y.s.size())
	{
		return x.s.size()>y.s.size();
	}
	else
	{
		for(int i=0;i<x.s.size();i++)
		{
			if(x.s[i]>y.s[i])
				return x.s[i]>y.s[i];
		}
	}
}
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>p[i].s;
		p[i].id=i;
	}
	sort(p+1,p+n+1,cmp);
	cout<<p[1].id<<endl;
	cout<<p[1].s<<endl;
}