#include <bits/stdc++.h>
using namespace std;
const int N = 200000;
int n, a[N], b[N];
vector<int> pos[N];
bitset<N> ans, mark;
inline void optimizeIO(void) {
    ios::sync_with_stdio(false);
    cin.tie(NULL), cout.tie(NULL);
}
int main(int argc, char const *argv[]) {
    optimizeIO(), cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> a[i], pos[a[i]].push_back(i);
    }
    for (int i = 0; i < n; i++) {
        cin >> b[i], mark[i] = b[i];
    }
    bitset<N> cur;
    for (int i = 0; i < N; i++) { // color.
        if (pos[i].empty()) continue;
        for (auto &j : pos[i]) {
            cur |= mark << j;
        }
        ans ^= cur, cur = 0;
    }
    for (int i = 0; i < 2 * n - 1; i++) {
        if (ans[i]) {
            cout << "ODD\n";
        } else {
            cout << "EVEN\n";
        }
    }
    return 0;
}