#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n;
string a;
string maxn;
int id;
int main(){
	cin>>n;
	int idx=1;
	int lenn=0; 
	while(n--){
		cin>>a;
		if(a.length()>lenn){
			lenn=a.length();
			id=idx;
 			for(int i=0;i<a.length();i++){
 			    maxn[i]=a[i];
 			}
		}
		if(a.length()==lenn){
			int i=0;
			while(i<=lenn){
				if(int(a[i])>int(maxn[i])){
					id=idx;
					for(int j=0;j<a.length();j++)maxn[j]=a[j];
					lenn=a.length();
					break;
				}
				if(int(a[i])<int(maxn[i]))break;
				else i++;
			}
		}
		idx++;
	}
	cout<<id<<endl;
	for(int i=0;i<lenn;i++)cout<<maxn[i];
	return 0;
}