#include<iostream>
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
using namespace std;
struct zt
{
	string n;
	int xh,l,s[1001];
}a[201];
int cmp(zt a,zt b)
{
	return a.l>b.l;
}
int main()
{
	string maxn;
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		cin>>a[i].n;
		a[i].xh=i;
		a[i].l=a[i].n.size();
		for(int j=a[i].l-1;j>=0;j--)
		{
			a[i].s[j]=a[i].n[j]-'0';
		}
	} 
	sort(a+1,a+n+1,cmp);
	int h=1;
	for(int i=2;i<=n;i++)
	{
		if(a[i].l==a[h].l)
		{
			for(int j=0;j<=a[h].l-1;j++)
			{
				if(a[i].s[j]>a[h].s[j])
				{
					h=i;
					break;
				}
			}
		}
	} 	
	cout<<a[h].xh<<endl<<a[h].n;
	return 0;
}