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

using namespace std;
using ll = long long;

const int MN = 100100;
vector<int> g[MN];
using B = bitset<2*MN>;
int main() {
    int n;
    scanf("%d", &n);
    for (int i = 0; i < n; i++) {
        int a;
        scanf("%d", &a);
        g[a].push_back(i);
    }
    B mp; mp.reset();
    for (int i = 0; i < n; i++) {
        int x;
        scanf("%d", &x);
        if (x == 1) {
            mp[i] = true;
        }
    }
    B ans; ans.reset();
    for (int i = 0; i < MN; i++) {
        B res; res.reset();
        for (int d: g[i]) {
            res |= mp << d;
        }
        ans ^= res;
    }
    for (int i = 0; i < 2*n-1; i++) {
        if (ans[i]) {
            printf("ODD\n");
        } else {
            printf("EVEN\n");
        }
    }
    return 0;
}