// author : anhtun_hi , nqg
#include <bits/stdc++.h>
#define ll long long
#define ii pair<ll, ll>
#define fi first
#define se second
#define all(x) x.begin(), x.end()
#define reset(h, v) memset(h, v, sizeof h)
#define Forv(i, a) for(auto& i : a)
#define For(i, a, b) for(int i = a; i <= b; ++i)
#define Ford(i, a, b) for(int i = a; i >= b; --i)
#define c_bit(i) __builtin_popcountll(i)
#define Bit(mask, i) ((mask >> i) & 1LL)
#define onbit(mask, i) ((mask) bitor (1LL << i))
#define offbit(mask, i) ((mask) &~ (1LL << i))
#define Log2(x) (63 - __builtin_clzll(x))
#define TIME (1.0 * clock() / CLOCKS_PER_SEC)
using namespace std;
namespace std {
template <typename T, int D>
struct _vector : public vector <_vector <T, D - 1>> {
static_assert(D >= 1, "Dimension must be positive!");
template <typename... Args>
_vector(int n = 0, Args... args) : vector <_vector <T, D - 1>> (n, _vector <T, D - 1> (args...)) {}
};
template <typename T> struct _vector <T, 1> : public vector <T> {
_vector(int n = 0, const T& val = T()) : vector <T> (n, val) {}
};
template <class A, class B> bool minimize(A &a, B b){return a > b ? a = b, true : false;}
template <class A, class B> bool maximize(A &a, B b){return a < b ? a = b, true : false;}
}
const int dx[] = {0, 0, +1, -1}, dy[] = {-1, +1, 0, 0}, LOG = 20, base = 311, inf = 1e9 + 5;
const int MAXN = 1e6 + 5;
const ll mod = 1e9 + 7;
const ll oo = 1e18;
//#define int long long
int n, m;
struct Trie{
struct Node{
Node *child[30];
Node(){
For(i, 0, 25) child[i] = nullptr;
}
};
Node *root = new Node();
void add(const string &s){
Node *r = root;
Forv(c, s){
if (r -> child[c - 'a'] == nullptr){
r -> child[c - 'a'] = new Node();
}
r = r -> child[c - 'a'];
}
}
} trie[2];
bool solve(Trie::Node *r1, Trie::Node *r2){
bool ans = 0;
For(i, 0, 25){
if(r1 -> child[i] == nullptr) continue;
if(r2 -> child[i] == nullptr) {ans = 1; continue;}
ans |= (!solve(r2 -> child[i], r1 -> child[i]));
}
return ans;
}
void Solve() {
cin >> n;
For(i, 1, n){
string s; cin >> s;
trie[0].add(s);
}
cin >> m;
For(i, 1, m){
string s; cin >> s;
trie[1].add(s);
}
cout << (solve(trie[0].root, trie[1].root) ? "Nina" : "Emilija");
}
signed main() {
cin.tie(0) -> sync_with_stdio(0);
if(fopen("vlak.inp", "r")) {
freopen("vlak.inp", "r", stdin);
freopen("vlak.out", "w", stdout);
}
int t = 1;
// cin >> t;
while(t --) Solve();
return 0;
}
