#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<int, int> P;

int main()
{
	int n;
	cin>>n;
	vector<int> w[100001];
	for(int i=0; i<n; i++){
		int a; cin>>a;
		w[a].push_back(i);
	}
	vector<int> v;
	for(int i=0; i<n; i++){
		int b; cin>>b;
		if(b) v.push_back(i);
	}
	bitset<200001> ans;
	for(int i=1; i<=100000; i++){
		if(w[i].empty()) continue;
		bitset<200001> bs, bs0;
		for(auto x:w[i]){
			bs[x]=1;
		}
		for(auto x:v){
			bs0|=(bs<<x);
		}
		ans^=bs0;
	}
	for(int i=0; i<2*n-1; i++){
		if(ans[i]) cout<<"ODD"<<endl;
		else cout<<"EVEN"<<endl;
	}
	return 0;
}