import std.conv, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken().to!int; } long readLong() { return readToken().to!long; } real readReal() { return readToken().to!real; } void chmin(T)(ref T t, in T f) { if (t > f) t = f; } void chmax(T)(ref T t, in T f) { if (t < f) t = f; } int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; } int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); } int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); } import std.bitmanip : BitArray; int N; int[] A; BitArray B; void main() { try { for (; ; ) { N = readInt(); A = new int[N]; foreach (i; 0 .. N) { A[i] = readInt(); } B.length = 2 * N - 1; foreach (i; 0 .. N) { B[i] = (readInt() == 1); } int[][int] posss; foreach (i; 0 .. N) { posss[A[i]] ~= i; } BitArray ans; ans.length = 2 * N - 1; BitArray sum; sum.length = 2 * N - 1; foreach (poss; posss) { (cast(size_t[])(sum))[] = 0; BitArray b; b.length = 2 * N - 1; (cast(size_t[])(b))[] = (cast(size_t[])(B))[]; int bef; foreach (i; poss) { b <<= (i - bef); bef = i; sum |= b; } ans ^= sum; } foreach (i; 0 .. 2 * N - 1) { writeln(ans[i] ? "ODD" : "EVEN"); } } } catch (EOFException e) { } }