#include<algorithm>
#include<iostream>
#include<cstring>
#include<cstdio>
#include<cmath>
#include<queue>
#define ll long long
using namespace std;
int n,maxlen=0,bj;
string s,maxp;
int main()
{
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d",&s);
		if(s.length()>maxlen)
		{
			maxlen=s.length();
			maxp=s;
			bj=i;
		}
		if(s.length()==maxlen)
		{
			if(s>maxp) 
			{
				maxp=s;
				bj=i;
			}
		}
	}
	cout<<bj<<endl<<maxp;
	return 0;
}