//#include<bits/stdc++.h>

#include<iostream>

#include<cstdio>

#include<iomanip>

#include<cstring>

#include<string>

#include<cstdlib>

#include<cmath>

#include<algorithm>

#include<cctype>

#include<utility>

#include<set>

#include<bitset>

#include<queue>

#include<stack>

#include<deque>

#include<map>

#include<vector>

#include<ctime>

#define INF 168430090

#define mod 19260817

#define ull unsigned long long

using namespace std;

char buf[<<],*fs,*ft;

inline char getc()

{

    return (fs==ft&&(ft=(fs=buf)+fread(buf,,<<,stdin),fs==ft))?:*fs++;

}

inline int read()

{

    int x=,f=;char ch=getchar();

    while(ch<''||ch>''){if(ch=='-')f=-;ch=getchar();}

    while(ch>=''&&ch<=''){x=x*+ch-'';ch=getchar();}

    return x*f;

}

inline void put(int x)

{

    x<?putchar('-'),x=-x:;

    int num=;char ch[];

    while(x)ch[++num]=x%+'',x/=;

    num==?putchar(''):;

    while(num)putchar(ch[num--]);

    putchar('\n');return;

}

const int MAXN=,maxn=;

int n,ans,c[maxn];

char a[MAXN];

struct wy

{

    ull b;

    int id;

    friend int operator <(const wy &x,const  wy &y)

    {

        if(x.b==y.b)return x.id<y.id;

        return x.b<y.b;

    }

}t[maxn];

int main()

{

    //freopen("1.in","r",stdin);

    n=read();

    for(int i=;i<=n;i++)

    {

        scanf("%s",a+);

        int len=strlen(a+);

        t[i].id=i;

        for(int j=;j<=len;j++)t[i].b=t[i].b*mod+a[j];

    }

    sort(t+,t++n);

    for(int i=;i<=n;i++)if(t[i].b==t[i-].b)c[t[i].id]=;

    for(int i=;i<=n;i++)if(c[i]==)put(i);

    return ;

}