#include <iostream>
#include <sstream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cctype>
#include <cmath>
#include <cassert>
#include <climits>
#include <numeric>
#include <functional>
#include <time.h>
#include <bitset>

using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> Pii;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define FOR(i, a, b) for (int i = (int)a; i <= (int)b; i++)
template<class T> void checkmin(T &a, T b) { if (b < a) a = b; }
template<class T> void checkmax(T &a, T b) { if (b > a) a = b; }


const int MaxN = (int)1e5;
const int MaxVal = (int)1e5;
const int MaxLen = MaxN * 2;
int N;
int A[MaxN], B[MaxN];
vector<vector<int>> positions(MaxVal + 1);

void solve() {
    bitset<MaxLen> all;
    bitset<MaxLen> mask;
    rep(i, N) positions[A[i]].push_back(i);
    rep(i, N) if (B[i]) mask.set(i);
    rep(color, MaxVal + 1) if (positions[color].size() > 0) {
        bitset<MaxLen> curr;
        for (int at : positions[color]) curr |= mask << at;
        all ^= curr;
    }
    rep(i, N * 2 - 1) printf(all[i] ? "ODD\n" : "EVEN\n");
}

int main() {
    scanf("%d", &N);
    rep(i, N) scanf("%d", &A[i]);
    rep(i, N) scanf("%d", &B[i]);
    solve();
    return 0;
}