#include<bits/stdc++.h>
#define task "strdel"
#define ii pair<int,int>
#define iii pair<int,ii>
#define iv pair<ii,ii>
#define se second
#define fi first
#define ffi fi.fi
#define sfi se.fi
#define sse se.se
#define fse fi.se
#define lt(i, c, d) for(int i = c; i <= d; ++i)
#define fl(i, c, d) for(int i = d; i >= c; --i)
#define pb push_back
#define emb emplace_back
#define emf emplace_front
#define em emplace
using namespace std;
const int N=2e5+5,lg=20,mod=1e9+7;
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
int Rand(int u,int v){
return u+rd()%(v-u+1);
}
int n,m;
struct Trie
{
Trie *child[26]={};
bool x=false,y=false;
}tr;
void add(Trie *tr,string s,int z){
Trie *cur=tr;
for(int i=0;i<s.size();++i){
int c=s[i]-'a';
if(cur->child[c]==NULL)cur->child[c]=new Trie;
cur=cur->child[c];
// if(z==1)cout <<c<<" ";
}
if(z==1)cur->x=true;
else cur->y=true;
}
void query(Trie *tr,int c,int de=0){
bool x=false,y=false;
for(int i=0;i<26;++i){
if(tr->child[i]==NULL)continue;
query(tr->child[i],c^1,de+1);
x|=tr->child[i]->x;
y|=tr->child[i]->y;
}
// cout <<c<<" "<<de<<" "<<x<<" "<<y<<" "<<'\n';
if(!c){
if(x)tr->x=true,tr->y=false;
else if(y)tr->x=false,tr->y=true;
}
else{
if(y)tr->y=true,tr->x=false;
else if(x)tr->y=false,tr->x=true;
}
}
string win(Trie *tr){
query(tr,0);
if(tr->x)return "Nina";
return "Emilija";
}
void solve(){
cin >> n;
for(int i=1;i<=n;++i){
string s;
cin >> s;
add(&tr,s,1);
}
cin >> m;
for(int j=1;j<=m;++j){
string s;
cin >> s;
add(&tr,s,0);
}
cout <<win(&tr);
}
main()
{
srand(time(0));
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout.tie(NULL);
if(fopen(task".inp","r")){
freopen(task".inp","r",stdin);
freopen(task".out","w",stdout);
}
int t=1;
// cin >> t;
while(t--){
solve();
cout<<'\n';
}
}
