package yukicoder;

import java.util.Arrays;
import java.util.Scanner;
public class Main {
	public static void main(String[] args) {
		new Main().solver();
	}

	void solver() {
		Scanner sc = new Scanner(System.in);
		int N = sc.nextInt();
		int[] a = new int[N];
		int[] b = new int[N];
		for (int i = 0; i < N; i++) {
			a[i] = sc.nextInt() - 1;
		}
		for (int i = 0; i < N; i++) {
			b[i] = sc.nextInt();
		}
		
		int[][] bucket=makeBucket(a,100001);
		
		long ans=0;
		int[] stamp=new int[100000];
		for(int i=0;i<N;i++){
			for(int j=0;j<64;j++){
				stamp[j]|=b[i]<<(j+i);
			}
		}
		for(int[] row:bucket){
			long d=0;
			for(int x:row){
//				System.out.println(x);
				d|=stamp[x];
			}
			ans^=d;
		}
		for(int i=0;i<2*N-1;i++){
			if(((ans>>i)&1)==1){
				System.out.println("ODD");
			}else{
				System.out.println("EVEN");
			}
		}
	}

	void tr(Object... o) {
		System.out.println(Arrays.deepToString(o));
	}

	int[][] makeBucket(int[] a, int sup) {
		int n = a.length;
		int[][] bucket = new int[sup + 1][];
		int[] bp = new int[sup + 1];
		for(int i=0;i<n;i++){
			bp[a[i]]++;
		}
		for(int i=0;i<sup+1;i++){
			bucket[i]=new int[bp[i]];
		}
		for(int i=n-1;i>=0;i--){
			bucket[a[i]][--bp[a[i]]]=i;
		}
		return bucket;
	}
}