#include <iostream>
#include <vector>
#include <cstring>
#include <algorithm>
#include <queue>
#include <cmath>
#include <bitset>
#include <cassert>
#include <array>

using namespace std;
using ll = long long;
using uint = unsigned int;

const int MN = 100128;

vector<int> g[MN];

using B = array<uint, MN/32>;

void orassign(B &l, B r) {
    for (int i = 0; i < MN/32; i++) {
        l[i] |= r[i];
    }
}
void xorassign(B &l, B r) {
    for (int i = 0; i < MN/32; i++) {
        l[i] ^= r[i];
    }
}

B shiftL(const B &x, int k) { // <<
    B ans; ans.fill(0);
    for (int i = 0; i < MN/32-k/32; i++) {
        ans[i+k/32] |= x[i]<<(k%32);
        if (i < MN/32-k/32-1 && k%32) {
            ans[i+k/32+1] |= x[i]>>(32-k%32);
        }
    }
    return ans;
}
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int a;
        scanf("%d", &a);
        g[a].push_back(i);
    }
    bool x[n];
    for (int i = 0; i < n; i++) {
        int xx;
        scanf("%d", &xx);
        x[i] = (xx == 1);
    }

    B mp; mp.fill(0);
    for (uint i = 0; i < n; i++) {
        if (x[i]) {
            mp[i/32] |= 1U<<(i%32);
        }
    }
    B ans; ans.fill(0);
    for (uint i = 0; i < MN; i++) {
        B res; res.fill(0);
        for (uint d: g[i]) {
            orassign(res, shiftL(mp, d));
        }
        xorassign(ans, res);
    }
    for (int i = 0; i < 2*n-1; i++) {
        if (ans[i/32] & (1U<<(i%32))) {
            printf("ODD\n");
        } else {
            printf("EVEN\n");
        }
    }
    return 0;
}