#include<bits/stdc++.h>
using namespace std;
struct node
{
	string s;
	int ii;
}a[21];
bool cmp(node x, node y)
{
	return x.s.size() > y.s.size();
	for(int i = x.s.size() - 1; i = 0; 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 >> a[i].s;
		a[i].ii = i;
	}
	sort(a + 1, a + n + 1, cmp);
	cout << a[1].ii << "\n" << a[1].s;
	return 0;
}