#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef int _loop_int;
#define REP(i,n) for(_loop_int i=0;i<(_loop_int)(n);++i)
#define FOR(i,a,b) for(_loop_int i=(_loop_int)(a);i<(_loop_int)(b);++i)
#define FORR(i,a,b) for(_loop_int i=(_loop_int)(b)-1;i>=(_loop_int)(a);--i)

#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define DEBUG_VEC(v) cout<<#v<<":";REP(i,v.size())cout<<" "<<v[i];cout<<endl
#define ALL(a) (a).begin(),(a).end()

#define CHMIN(a,b) a=min((a),(b))
#define CHMAX(a,b) a=max((a),(b))

// mod
const ll MOD = 1000000007ll;
#define FIX(a) ((a)%MOD+MOD)%MOD

// floating
typedef double Real;
const Real EPS = 1e-11;
#define EQ0(x) (abs(x)<EPS)
#define EQ(a,b) (abs(a-b)<EPS)
typedef complex<Real> P;

// 1 <= n <= 1e5
// 1 <= a_i <= 1e5
// b_i in {0,1}

int n;
vi as;
vi g[100001];
bitset<200000> b;
bitset<200000> tmp,res;

int main(){
  scanf("%d",&n);
  as.resize(n);
  REP(i,n){
    int a;
    scanf("%d",&a);
    as[i] = a;
    g[a].push_back(i);
  }
  sort(ALL(as));
  as.erase(unique(ALL(as)),as.end());
  REP(i,n){
    int x;
    scanf("%d",&x);
    if(x==1)b.set(i);
  }
  REP(i,as.size()){
    int a = as[i];
    bitset<200000> tmp;
    REP(j,g[a].size()){
      int x = g[a][j];
      tmp |= b<<x;
    }
    res ^= tmp;
  }
  REP(i,2*n-1){
    puts(res[i]?"ODD":"EVEN");
  }
  return 0;
}