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

using namespace std;
using ll = long long;

namespace StopWatch {
    clock_t st;
    bool f = false;
    void start() {
        f = true;
        st = clock();
    }
    int msecs() {
        assert(f);
        return (clock()-st)*1000 / CLOCKS_PER_SEC;
    }
}

const int MN = 100128;
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);
    }
    bool x[n];
    for (int i = 0; i < n; i++) {
        int xx;
        scanf("%d", &xx);
        x[i] = (xx == 1);
    }
    StopWatch::start();
    B mp;
    for (int i = 0; i < n; i++) {
        if (x[i] == 1) {
            mp[i] = true;
        }
    }
    cerr << StopWatch::msecs() << endl;
//    B ans;
    int ans[2*MN] = {};
    for (int i = 0; i < MN; i++) {
        B res;
        for (int d: g[i]) {
            res |= mp << d;
        }
        for (int j = 0; j < 2*MN; j++) {
            ans[i] += (res[i] ? 1 : 0);
        }
//        ans ^= res;
    }
    cerr << StopWatch::msecs() << endl;
    for (int i = 0; i < 2*n-1; i++) {
        if (ans[i] % 2) {
            printf("ODD\n");
        } else {
            printf("EVEN\n");
        }
    }
    return 0;
}