#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int ans,n;
struct node{
	int id;
	char s[105];
}a[25];
inline int read(){
	int x=0,k=1;
	char c=getchar();
	while(c<'0'||c>'9'){
		if(c=='-')k=-1;c=getchar();
	}
	while(c>='0'&&c<='9')x=(x<<1)+(x<<3)+(c-'0'),c=getchar();
	return x*k;
}
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++) scanf("%s",a[i].s),a[i].id=i;
	ans=1;
	for(int i=2;i<=n;i++){
		if((strlen(a[i].s))<(strlen(a[ans].s))) continue;
		if((strlen(a[i].s))>(strlen(a[ans].s))){
			ans=i;
			continue;
		}
		for(int j=0;j<strlen(a[ans].s);j++){
			if(a[ans].s[j]>=a[i].s[j]) continue;
			if(a[ans].s[j]<a[i].s[j]){
				ans=i;
				break;
			}
		}
	}
	printf("%d\n%s",ans,a[ans].s);
	return 0;
}