//ᴇᴀᴄʜ ᴘᴇʀꜱᴏɴ ᴡɪʟʟ ᴏɴʟʏ ʜᴀᴠᴇ ᴡʜᴀᴛ ᴛʜᴇʏ ᴇɴᴅᴇᴀᴠᴏᴜʀᴇᴅ ᴛᴏᴡᴀʀᴅꜱ [53:39]
//Author: Sazid Hasan (@iamsazidh)
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef double dl;
typedef vector<int> vi;
typedef vector<vector<int>> vii;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef pair<int,int> pii;
typedef pair<ll, ll> pll;
#define ff first
#define ss second
#define all(a) a.begin(),a.end()
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (a*(b/gcd(a,b)))
#define file(); freopen("input.txt", "r", stdin);freopen("output.txt", "w", stdout);
#define spc " "
#ifdef ONLINE_JUDGE
#define debarr(array)
#define deb(x)
#define del
#define debug(...)
#else
#define debarr(array) for(int w = 0; w < array.size(); w++) cerr << #array << "-" << w << " = " << array[w] << endl;
#define deb(x) cerr << #x << " = " << x << endl;
#define del cerr << '\n';
#define debug(...) _debug(#__VA_ARGS__, __VA_ARGS__);
template <class X, class Y>
ostream& operator<<(ostream& os, const pair<X, Y>& p) {
return os << "(" << p.first << ", " << p.second << ")";
}
template <class Ch, class Tr, class Container>
basic_ostream<Ch, Tr>& operator<<(basic_ostream<Ch, Tr>& os, const Container& x) {
int i = 0, n = distance(x.begin(), x.end());
os << "{ ";
for (const auto& y : x)
os << y << (++i < n ? ", " : "");
return os << " }";
}
template <typename... Args>
void _debug(const char* names, Args&&... args) {
string_view s(names);
cerr << "{ ";
size_t i = 0, cnt = 0, n = sizeof...(args);
auto next = [&]() {
while (i < s.size() && (s[i] == ' ' || s[i] == ',')) ++i;
size_t st = i;
while (i < s.size() && s[i] != ',') ++i;
return s.substr(st, i - st);
};
((cerr << next() << ": " << args << (++cnt < n ? ", " : "")), ...);
cerr << " }" << '\n';
}
#endif
const double PI = acos(-1);
const int MOD = 1000000007;
const int inf = (2147483647);
const double EPS = 1e-6;
const int MAXN = 1e5+10;
class Trie{
public:
int T = 1;
struct node{
int v = 0;
vi child = vi(26, -1);
};
vector<node> tr;
Trie(){
tr.emplace_back();
tr[0].v = 3;
}
void insert(string s, int p){
int now = 0;
for(auto x: s){
if(tr[now].child[x-'a']==-1){
tr.emplace_back();
tr[now].child[x-'a'] = T++;
}
now = tr[now].child[x-'a'];
tr[now].v += p;
}
return;
}
int getAns(int i = 0, int lvl = 0){
bool stat;
if(lvl%2==0){
stat = 0;
for(auto x: tr[i].child){
if(tr[x].v==3) getAns(x, lvl+1);
stat |= tr[x].v==1;
}
}else{
stat = 1;
for(auto x: tr[i].child){
if(tr[x].v==3) getAns(x, lvl+1);
stat &= !(tr[x].v==2);
}
}
if(stat==1) tr[i].v = 1;
else tr[i].v = 2;
return tr[i].v;
}
};
bool solve(){
int n; cin >> n;
Trie tr;
while(n--){
string s; cin >> s;
tr.insert(s, 1);
}
cin >> n;
while(n--){
string s; cin >> s;
tr.insert(s, 2);
}
return tr.getAns()==1;
}
int main(){
ios::sync_with_stdio(false); cin.tie(nullptr);
int testcase = 1;
//cin >> testcase;
for(int tc = 1; tc <= testcase; tc++){
//cerr << "TESTCASE - " << tc << endl;
// solve();
cout << (solve() ? "Nina" : "Emilija") << '\n';
cerr << endl;
}
return 0;
}
