#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int n;
string s1;
int p;
string now = "0";
string s;

void solve(int i ){
    int la=s1.length();
    int lb = now.length();
    if(la!=lb) {now  = la>lb?s1:now;
        if(la> lb){
            p = i;
        }
        return;}
    for(int i = 0;i < la;i++) {
        if (s1[i] > now[i]) {
            now = s1;
            p  =i;
            return;
        }
        if (s1[i] < now[i]) {
            return;
        }
    }
}


int main(){
    cin >> n;
    cin.ignore();
    for(int i = 0; i < n+1;i++){
        getline(cin ,s1);
        solve(i);
    }
    cout << p<<endl;
    cout << now;

    return 0;
}