#include <iostream>
#include <cstdio>
#include <set>
#include <map>
#include <algorithm>
#include <vector>
#include <bitset>
#define rep(i, l, r) for (int i = (l); i <= (r); i ++ )
#define per(i, r, l) for (int i = (r); i >= (l); i -- )
using namespace std;
const int N = 1e5 + 1;
int n, a[N], x;
vector<int> vc[N];
bitset<2 * N> b, ans, tmp;
int main() {
    scanf("%d", &n);
    rep(i, 0, n - 1) scanf("%d", &a[i]), vc[a[i]].push_back(i);
    rep(i, 0, n - 1) scanf("%d", &x), b[i] = x;
    rep(i, 0, n - 1) {
        if (vc[i].empty()) continue;
        for (auto j: vc[i])
            tmp |= b << j;
        ans ^= tmp;
        tmp = 0;
    }
    rep(i, 0, 2 * n - 2) if (ans[i]) printf("ODD\n"); else printf("EVEN\n");
    return 0;
}