#include<iostream>
#include<algorithm>
using namespace std;
struct tt{
	int xh;
	string num;
}t[100];
bool cmp(tt x,tt y){
	if(x.num.size()<y.num.size()) return x.num<y.num;
	for(int i=0;i<x.num.size();i++)
		if(x.num[i]-'0'<y.num[i]-'0') return x.num<y.num;
}
int main(){
	int n; cin>>n;
	for(int i=1;i<=n;i++){
		t[i].xh=i; cin>>t[i].num;
	}
	sort(t+1,t+1+n,cmp);
	cout<<t[1].xh<<endl<<t[1].num;
	
	
	return 0;
}