def maxPosPrefixes(arr):
    arr.sort(reverse=True)
    prefix_sum = 0
    positive_count = 0
    for num in arr:
        prefix_sum += num
        if prefix_sum > 0:
            positive_count += 1
        else:
            break  
    return positive_count

def solution(menu, order):

    t_cost = 0
    for item in order:
        pizza = next(p for p in menu if p.name == item.name)
        price = getattr(pizza, f'price_{item.size[0]}')
        total_cost += price * item.quantity
    total_pizzas = sum(item.quantity for item in order)
    if total_pizzas >= 3:
        cheapest_price = min(getattr(next(p for p in menu if p.name == item.name), f'price_{item.size[0]}')
                             for item in order)
        discounted_cost = t_cost - cheapest_price
        return min(t_cost, discounted_cost)
    return t_cost

def isPrime(n):
    if n < 2:
        return False
    for i in range(2, int(n**0.5) + 1):
        if n % i == 0:
            return False
    return True

def endsWithThree(n):
    return n % 10 == 3

def maxGameScore(cell):
    n = len(cell)
    dp = [float('-inf')] * n
    dp[0] = cell[0]  
    
    for i in range(1, n):
        dp[i] = max(dp[i], dp[i-1] + cell[i])

        for j in range(i):
            jump = i - j
            if isPrime(jump) and endsWithThree(jump):
                dp[i] = max(dp[i], dp[j] + cell[i])
    
    return dp[n-1]

import java.util.*;
public class Main {
        private static int solve(List<Integer> subset) {
        if (subset.isEmpty()) return 0;
        int result = subset.get(0);
        int n = subset.size();
        int opIndex = 0; 
        for (int i = 1; i < n; i++) {
            int num = subset.get(i);
            switch (opIndex) {
                case 0: 
                    result ^= num;
                    break;
                case 1:
                    result += num;
                    break;
                case 2:
                    result |= num;
                    break;
            }
            
            opIndex = (opIndex + 1) % 3; 
        }
        
        return result;
    }
    
    public static void main(String[] args) {
        Scanner sc = new Scanner(System.in);
        int T = sc.nextInt(); 
        for (int t = 0; t < T; t++) {
            int N = sc.nextInt(); 
            List<Integer> numbers = new ArrayList<>();
            for (int i = 0; i < N; i++) {
                numbers.add(sc.nextInt());
            }
            int maxResult = Integer.MIN_VALUE;
            for (int i = 1; i < (1 << N); i++) {
                List<Integer> subset = new ArrayList<>();
                for (int j = 0; j < N; j++) {
                    if ((i & (1 << j)) > 0) {
                        subset.add(numbers.get(j));
                    }
                }
                int result = solve(subset);
                maxResult = Math.max(maxResult, result);
            }
            if (maxResult % 2 == 0) {
                System.out.println("Even");
            } else {
                System.out.println("Odd");
            }
        }
        
        sc.close();
    }
}