#include<bits/stdc++.h>
#define pb push_back
#define mp make_pair
#define int long long
#define vi vector<int>
#define vvi vector<vector<int>>
#define pii pair<int, int>
#define vpii vector<pair<int, int>>
#define vc vector<char>
#define vb vector<bool>
#define mii map<int,int>
#define f0r(i,n) for(int i=0;i<n;i++)
#define FOR(i,k,n) for(int i=k;i<n;i++)
#define all(v) (v).begin(),(v).end()
#define rall(v) (v).rbegin(),(v).rend()
#define in(a) int a; cin>>a
#define in2(a,b) int a,b; cin>>a>>b
#define in3(a,b,c) int a,b,c; cin>>a>>b>>c
#define in4(a,b,c,d) int a,b,c,d; cin>>a>>b>>c>>d
#define vin(v,n); vi v(n); f0r(i,n){cin>>v[i];}
#define out(a) cout<<a<<'\n'
#define out2(a,b) cout<<a<<' '<<b<<'\n'
#define out3(a,b,c) cout<<a<<' '<<b<<' '<<c<<'\n'
#define out4(a,b,c,d) cout<<a<<' '<<b<<' '<<c<<' '<<d<<'\n'
#define vout(v) for(auto u : v){cout<<u<<' ';} cout<<'\n'
#define dout(a) cout<<a<<' '<<#a<<'\n'
#define dout2(a,b) cout<<a<<' '<<#a<<' '<<b<<' '<<#b<<'\n'
#define yn(x); if(x){cout<<"YES"<<'\n';}else{cout<<"NO"<<'\n';}
const int leg = 1e9 + 7;
const int mod = 998244353;
using namespace std;
signed main(){
ios::sync_with_stdio(false);
cin.tie(NULL);
//ifstream cin(".in");
//ofstream cout(".out");
int n;
cin>>n;
int mxl = 0;
vector<string>v(n);
f0r(i,n){
string s;
cin>>s;
v[i] = s;
mxl = max(mxl, (int)s.size());
}
int m;
cin>>m;
vector<string>w(m);
f0r(i,m){
string s;
cin>>s;
w[i] = s;
mxl = max(mxl, (int)s.size());
}
vi a;
vi b;
f0r(i,n){
f0r(j, m){
if(v[i].size() < w[j].size()){
if(w[j].substr(0,v[i].size()) == v[i]){
a.pb(i);
}
}
else{
if(v[i].size() > w[j].size()){
if(v[i].substr(0,w[j].size()) == w[j]){
b.pb(i);
}
}
}
}
}
reverse(all(a));
reverse(all(b));
f0r(i,a.size()){
v.erase(v.begin() + a[i]);
}
f0r(i, b.size()){
w.erase(w.begin() + b[i]);
}
n = v.size();
m = w.size();
//dout(mxl);
sort(all(v));
sort(all(w));
mxl = 0;
f0r(i,n){
mxl = max(mxl, (int)v[i].size());
}
f0r(j,m){
mxl = max(mxl, (int)w[j].size());
}
vector<set<string>>idk(mxl+1);
idk[0].insert("");
vector<set<string>>idk2(mxl+1);
idk2[0].insert("");
FOR(l, 1, mxl+1){
//dout(l);
f0r(i,n){
if(v[i].size() >= l){
//dout(v[i]);
idk[l].insert(v[i].substr(0, l));
}
}
f0r(i,m){
if(w[i].size() >= l){
idk2[l].insert(w[i].substr(0,l));
}
}
}
for(auto u : idk2[1]){
//dout(u);
}
int ans = -1;
FOR(l, 1, mxl+1){
if(l % 2 == 1){
map<string,bool>ma;
f0r(i,n)if(v[i].size() >= l-1)ma[v[i].substr(0, l-1)] = 1;
f0r(i,n){
if(idk2[l-1].count(v[i].substr(0, l-1)) && !idk2[l].count(v[i].substr(0,l))){
// out(v[i].substr(0,l));
// ans = l;
// break;
ma[v[i].substr(0, l-1)] = 0;
}
}
bool ok = 0;
for(auto u : ma){
if(u.second == 1){
ok = 1;
}
}
if(!ok){
ans = l;
}
}
else{
map<string,bool>ma;
f0r(i,m)if(w[i].size() >= l-1)ma[w[i].substr(0, l-1)] = 1;
f0r(i,m){
if(idk[l-1].count(w[i].substr(0,l-1)) && !idk[l].count(w[i].substr(0,l))){
// out(w[i].substr(0,l));
// ans = l;
// break;
ma[w[i].substr(0, l-1)] = 0;
}
}
bool ok = 0;
for(auto u : ma){
if(u.second == 1){
ok = 1;
}
}
if(!ok){
ans = l;
}
}
if(ans != -1)break;
}
if(ans == -1)ans = mxl;
// out(ans);
if(ans % 2 == 1)out("Nina");
else out("Emilija");
}
