#include<bits/stdc++.h>
#define Add(x,y) (x+y>=mod)?(x+y-mod):(x+y)
#define lowbit(x) x&(-x)
#define pi pair<ll,ll>
#define pii pair<ll,pair<ll,ll>>
#define iip pair<pair<ll,ll>,ll>
#define ppii pair<pair<ll,ll>,pair<ll,ll>>
#define fi first
#define se second
#define full(l,r,x) for(auto it=l;it!=r;it++) (*it)=x
#define Full(a) memset(a,0,sizeof(a))
#define open(s1,s2) freopen(s1,"r",stdin),freopen(s2,"w",stdout);
#define For(i,l,r) for(register int i=l;i<=r;i++)
#define _For(i,l,r) for(register int i=r;i>=l;i--)
using namespace std;
typedef double db;
typedef unsigned long long ull;
typedef long long ll;
bool Begin;
const ll N=1e5+10,M=2*N;
inline ll read(){
    ll x=0,f=1;
    char c=getchar();
    while(c<'0'||c>'9'){
        if(c=='-')
          f=-1;
        c=getchar();
    }
    while(c>='0'&&c<='9'){
        x=(x<<1)+(x<<3)+(c^48);
        c=getchar();
    }
    return x*f;
}
inline void write(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9)
	  write(x/10);
	putchar(x%10+'0');
}
ll n,x;
vector<ll> E[N];
bitset<M> A,B;
bool End;
int main(){
	n=read();
	For(i,1,n){
		x=read();
		E[x].push_back(i);
	}
	For(i,1,n){
		x=read();
		A[i]=x;
	}
	For(i,1,N-1){
		if(E[i].size()){
			bitset<M> T;
			for(auto v:E[i])
			  T|=A<<v;
			B^=T;
		}
	}
	For(i,2,2*n)
	  puts(B[i]?"ODD":"EVEN");
	cerr<<'\n'<<abs(&Begin-&End)/1048576<<"MB";
	return 0;
}