#include<iostream>
#include<algorithm>
#include<string>
using namespace std;
struct s{
	int c,len;
	string b;
}a[25];
bool cmp(s d,s e){
	if(d.len>e.len){
		return 1;
	}
	else if(d.len==e.len){
		int i=0;
		while(d.b[i]!=e.b[i]){
			if(d.b[i]>e.b[i]){
				return 1;
			}
			else{
				return 0;
			}
			i++;
		}
	}
	else{
		return 0;
	}
}
int main(){
	int n;
	cin>>n;
	for(int i=0;i<n;i++){
		cin>>a[i].b;
		a[i].c=i+1;
		a[i].len=a[i].b.size();
	}
	sort(a,a+n,cmp);
	cout<<a[0].c<<endl;
	cout<<a[0].b;
	return 0;
}