#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
//#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
//#include<list>
#include<queue>
#include<deque>
#include<algorithm>
//#include<numeric>
#include<utility>
//#include<memory>
#include<functional>
#include<cassert>
#include<set>
#include<stack>
#include<random>
#include<bitset>

const int dx[] = {1, 0, -1, 0};
const int dy[] = {0, -1, 0, 1};
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;

const int MAXA = 100001;
const int MAXN = 100001;
vector<int> pos[MAXA];
int B[MAXN];

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N;
    cin >> N;
    for (int i = 0; i < N; i++) {
        int a;
        cin >> a;
        pos[a].push_back(i);
    }
    for (int i = 0; i < N; i++)
        cin >> B[i];
    bitset<2*MAXN> ans;
    for (int i = 0; i < MAXA; i++) if (pos[i].size()) {
        bitset<2*MAXN> memo;
        for (int j = 0; j < N; j++) if (B[j]) {
            for (int to : pos[i])
            memo.set(j+to); 
        }
        ans ^= memo;
    }
    for (int i = 0; i < 2*N-1; i++) {
        if (ans[i]) cout << "ODD" << endl;
        else cout << "EVEN" << endl;
    }
    return 0;
}