UVa 154

#include<bits/stdc++.h>
using namespace std;

typedef long long int           ll;
typedef unsigned long long int  ull;
typedef vector<int>             vi;
typedef vector<vi>              vvi;
typedef pair<int,int>           pii;
typedef vector< pii >           vpii;
typedef set<int>                sti;

#define pb                      push_back
#define pob                     pop_back
#define mp                      make_pair
#define ff                      first
#define ss                      second
#define loop1(i,n)              for(int i=1; i<=int(n); i++)
#define loop(i,y)               for(int i=0; i<int(y); i++)
#define rloop(i,y)              for(int i=int(y)-1; i>=0; i--)
#define read()                  freopen("input.txt", "r", stdin)
#define write()                 freopen("output.txt", "w", stdout)
#define cspf(i)                 printf("Case %d: ", i)
/// Constants
#define eps                     1e-9
#define PI                      acos(-1.0)  // 3.1415926535897932

int main()
{
    read();
    while(1){
        char ch[110][110];
        int i=0;

        while(1){
            i++;
            scanf("%[^\n]",ch[i]);
            getchar();
            if(ch[i][0]=='#')
                return 0;
            if(ch[i][0]=='e'){
                i--;
                break;
            }
        }
        int ln=strlen(ch[1]);
        int mn=0,x,j,k;
        for(j=1;j<=i;j++){
            int cnt=0;
            for(k=1;k<=i;k++){
                int w=0;
                while(w<ln){
                    int n=0;
                    while(n<ln){
                        if(ch[j][w]==ch[k][n])
                            break;
                        n++;
                    }
                    w+=2;
                    n+=2;
                    if(ch[j][w]==ch[k][n])
                        cnt++;
                    w+=2;
                }
            }
            if(cnt>mn){
                mn=cnt;
                x=j;
            }
        }
        printf("%d\n",x);
    }
    return 0;
}