You are given an integer $n$ ($n \ge 0$) represented with $k$ digits in base (radix) $b$. So,

$$n = a_1 \cdot b^{k-1} + a_2 \cdot b^{k-2} + \ldots a_{k-1} \cdot b + a_k.$$

For example, if $b=17, k=3$ and $a=[11, 15, 7]$ then $n=11\cdot17^2+15\cdot17+7=3179+255+7=3441$.

Determine whether $n$ is even or odd.


-----Input-----

The first line contains two integers $b$ and $k$ ($2\le b\le 100$, $1\le k\le 10^5$) — the base of the number and the number of digits.

The second line contains $k$ integers $a_1, a_2, \ldots, a_k$ ($0\le a_i < b$) — the digits of $n$.

The representation of $n$ contains no unnecessary leading zero. That is, $a_1$ can be equal to $0$ only if $k = 1$.


-----Output-----

Print "even" if $n$ is even, otherwise print "odd".

You can print each letter in any case (upper or lower).


-----Examples-----
Input
13 3
3 2 7

Output
even

Input
10 9
1 2 3 4 5 6 7 8 9

Output
odd

Input
99 5
32 92 85 74 4

Output
odd

Input
2 2
1 0

Output
even



-----Note-----

In the first example, $n = 3 \cdot 13^2 + 2 \cdot 13 + 7 = 540$, which is even.

In the second example, $n = 123456789$ is odd.

In the third example, $n = 32 \cdot 99^4 + 92 \cdot 99^3 + 85 \cdot 99^2 + 74 \cdot 99 + 4 = 3164015155$ is odd.

In the fourth example $n = 2$.

Difficulty: EASY
Tags: Mathematics

Starter code:

Solutions:
(b, _) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if b % 2 == 0:
	a = a[-1:]
print('even' if sum(a) % 2 == 0 else 'odd')


n = input()
s = n.split()
b = int(s[0])
k = int(s[1])
a = input()
a = a.split()
a = a[::-1]
if b % 2 == 0:
	if int(a[0]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	cnt = 0
	for i in range(k):
		if int(a[i]) % 2 == 1:
			cnt += 1
	if cnt % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = [int(x) for x in input().split()]
a = list((int(x) for x in input().split()))
last_num = 0
for i in range(k):
	if k - 1 - i == 0:
		if a[i] % 2 == 0:
			last_num += 2
		else:
			last_num += 1
		continue
	if a[i] * b % 2 == 0:
		last_num += 2
	else:
		last_num += 1
if last_num % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
even = 0
odd = 0
for i in range(len(a) - 1):
	if a[i] % 2 == 0:
		even += 1
	elif a[i] % 2 != 0 and b % 2 == 0:
		even += 1
	else:
		odd += 1
if a[-1] % 2 == 0:
	even += 1
else:
	odd += 1
if odd % 2 != 0:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
if b % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	c = 0
	for i in l:
		if i % 2 != 0:
			c += 1
	if c % 2 != 0:
		print('odd')
	else:
		print('even')


(b, k) = map(int, input().split())
l = [int(x) for x in input().split()]
o = 0
ok = b % 2 == 0
for i in range(k - 1):
	done = ok or l[i] % 2 == 0
	if done == False:
		o += 1
if l[-1] % 2 != 0:
	o += 1
print('even' if o % 2 == 0 else 'odd')


import sys, math
from collections import deque, defaultdict
import operator as op
from functools import reduce
from itertools import permutations
import heapq
I = sys.stdin.readline
alpha = 'abcdefghijklmnopqrstuvwxyz'

def ii():
	return int(I().strip())

def li():
	return list(map(int, I().strip().split()))

def mi():
	return map(int, I().strip().split())

def ncr(n, r):
	r = min(r, n - r)
	numer = reduce(op.mul, range(n, n - r, -1), 1)
	denom = reduce(op.mul, range(1, r + 1), 1)
	return numer // denom

def gcd(x, y):
	while y:
		(x, y) = (y, x % y)
	return x

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

def main():
	(n, k) = mi()
	arr = li()
	odd = 0
	for i in range(k - 1):
		if n % 2:
			if arr[i] % 2:
				odd += 1
	if arr[k - 1] % 2:
		odd += 1
	if odd % 2:
		print('odd')
	else:
		print('even')
main()


(b, k) = [int(x) for x in input().split()]
h = input().split()
if b % 2 == 0:
	if int(h[len(h) - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	i = 0
	count = 0
	for i in range(len(h)):
		if int(h[i]) % 2 != 0:
			count = count + 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


(N, M) = input().split()
n = int(N)
k = int(M)
l = [int(item) for item in input().split()]
ln = len(l)
x = 0
y = 0
if n % 2 == 0:
	if l[ln - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in range(0, ln):
		if l[i] % 2 == 0:
			x = x + 1
		else:
			y = y + 1
	if y % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
l = list(map(lambda x: int(x) % 2, input().split()))
if b % 2 == 0:
	if l[-1] == 0:
		print('even')
	else:
		print('odd')
else:
	r = sum(l) % 2
	if r == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
ai = list(map(int, input().split()))
if b % 2 == 0:
	if ai[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	num = 0
	for i in range(k):
		num += ai[i] % 2
	if num % 2 == 0:
		print('even')
	else:
		print('odd')


from sys import stdin, stdout

def inp():
	return int(stdin.readline())

def minp():
	return map(int, stdin.readline().rstrip().split())

def linp():
	return list(minp())

def main():
	(n, k) = minp()
	l = linp()
	s = 0
	p = 1
	n %= 2
	for i in range(k):
		s += l[k - i - 1] * p % 2
		p *= n
	if s % 2 == 0:
		print('EVEN')
	else:
		print('ODD')
main()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
s = sum(a) * b + (1 - b) * a[k - 1]
print('even' if s % 2 is 0 else 'odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
b %= 2
ans = 0
for i in range(k):
	ans = (ans + a[i] % 2 * b ** (k - i - 1) % 2) % 2
if ans & 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
is_even = False
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		is_even = True
	else:
		is_even = False
else:
	r = 0
	for x in a:
		if x % 2 == 1:
			r = r + 1
	if r % 2 == 0:
		is_even = True
	else:
		is_even = False
if is_even:
	print('even')
else:
	print('odd')


(b, n) = map(int, input().split())
arr = list(map(int, input().split()))
ans = ['even', 'odd']
if b % 2:
	print(ans[sum(arr) % 2])
else:
	print(ans[arr[-1] % 2])


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
flag = 1
for i in range(len(arr) - 1):
	if b % 2 != 0 and arr[i] % 2 != 0:
		flag = flag * -1
if arr[-1] % 2 != 0:
	flag = flag * -1
if flag == -1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	odd_digits = 0
	for n in a:
		if n % 2 != 0:
			odd_digits += 1
	if odd_digits % 2 == 0:
		print('even')
	else:
		print('odd')


def read_int():
	return int(input().strip())

def read_string():
	return input().strip()

def read_int_list():
	return list(map(int, input().strip().split()))

def read_string_list():
	return input().strip().split()
import sys
(b, k) = read_int_list()
a_s = read_int_list()
if b % 2 == 0:
	if a_s[-1] % 2 == 1:
		print('odd')
		sys.exit()
	else:
		print('even')
		sys.exit()
else:
	flag = 0
	for a in a_s:
		if a % 2 == 1:
			flag = not flag
	if flag:
		print('odd')
		sys.exit()
	else:
		print('even')
		sys.exit()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
r = 0
for x in a:
	r = (r * b + x) % 2
if r == 0:
	print('even')
else:
	print('odd')


import sys
lne = [int(i) for i in sys.stdin.readline().rstrip().split(' ')]
b = lne[0]
l = lne[1]
num = [int(i) for i in sys.stdin.readline().rstrip().split(' ')]
t = 0
n = 0
for i in range(len(num) - 1, -1, -1):
	if t == 0:
		if num[i] % 2 == 1:
			n = 1 - n
	elif b % 2 != 0 and num[i] % 2 != 0:
		n = 1 - n
	t += 1
if n % 2 == 0:
	print('even')
else:
	print('odd')


(b, n) = map(int, input().split())
l = list(map(int, input().split()))
if b & 1:
	c = 0
	for i in range(n):
		if l[i] & 1:
			c += 1
	if c & 1:
		print('odd')
	else:
		print('even')
elif l[-1] & 1:
	print('odd')
else:
	print('even')


x = input()
y = input()
base = 0
temp = ''
for c in x:
	if c == ' ':
		base = int(temp)
		break
	else:
		temp += c
length = int(temp)
listNumbers = []
tempCap = ''
for c in y:
	if c == ' ':
		listNumbers.append(int(tempCap))
		tempCap = ''
	else:
		tempCap += c
listNumbers.append(int(tempCap))
suma = 0
for num in listNumbers:
	suma += num
sde = suma % 2 == 0
be = base % 2 == 0
lde = listNumbers[-1] % 2 == 0
if sde and be and lde:
	print('even')
elif sde and be and (not lde):
	print('odd')
elif sde and (not be) and lde:
	print('even')
elif sde and (not be) and (not lde):
	print('even')
elif not sde and be and lde:
	print('even')
elif not sde and be and (not lde):
	print('odd')
elif not sde and (not be) and lde:
	print('odd')
elif not sde and (not be) and (not lde):
	print('odd')


import math

def wa(a, b):
	f = 1
	while b > 0:
		if b % 2 == 0:
			f = f * f % 2
			b //= 2
		else:
			f = f * a % 2
			b -= 1
	return f

def ans(a, b, l):
	sum = 0
	l1 = len(l)
	i = 0
	while i < l1:
		sum += int(l[i]) * wa(a, b - 1 - i)
		i += 1
	if sum % 2 == 0:
		print('even')
	else:
		print('odd')
(a, b) = map(int, input().split())
l = list(map(int, input().split()))
ans(a, b, l)


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	counter = 0
	for item in a:
		if item % 2 == 1:
			counter += 1
	if counter % 2 == 0:
		print('even')
	else:
		print('odd')


from __future__ import division, print_function
import os
import sys
from io import BytesIO, IOBase
from bisect import *
from math import floor, sqrt, ceil, factorial as F, gcd, pi, log
from itertools import chain, combinations, permutations, accumulate
from collections import Counter, defaultdict, OrderedDict, deque
from functools import cmp_to_key, reduce
INT_MAX = sys.maxsize
INT_MIN = -sys.maxsize - 1
mod = 1000000007
ch = 'abcdefghijklmnopqrstuvwxyz'
lcm = lambda a, b: a * b // gcd(a, b)
setbit = lambda x: bin(x)[2:].count('1')
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip

def solve():
	(b, k) = map(int, input().split())
	a = list(map(int, input().split()))
	if not b & 1:
		if a[-1] & 1:
			print('odd')
		else:
			print('even')
	else:
		o = 0
		for i in a:
			if i & 1:
				o += 1
		e = k - o
		if o & 1:
			print('odd')
		else:
			print('even')
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
input = lambda : sys.stdin.readline().rstrip('\r\n')
solve()


(n, k) = list(map(int, input().split()))
m = list(map(int, input().split()))
if n % 2:
	if sum(m) % 2:
		print('odd')
	else:
		print('even')
elif m[-1] % 2:
	print('odd')
else:
	print('even')


linea = input().split()
(b, k) = (int(linea[0]), int(linea[1]))
a = [int(x) for x in list(input().split())]
b_dig = b % 10
b_act = b_dig
suma = 0
for i in range(k - 1, -1, -1):
	if i != k - 1:
		suma += a[i] % 10 * b_act % 10
		b_act = b_act * b_dig % 10
	else:
		suma += a[i] % 10
print('even' if suma % 2 == 0 else 'odd')


(a, b) = map(int, input().split())
l = list(map(int, input().split()))
if a % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	z = 0
	for i in l:
		if i % 2 != 0:
			z += 1
	if z % 2 != 0:
		print('odd')
	else:
		print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
c = sum(a) if b % 2 else a[-1]
if c % 2:
	print('odd')
else:
	print('even')


import math
alph = 'abcdefghijklmnopqrstuvwxyz'
(b, k) = map(int, input().split())
a = list(map(int, input().split()))
p = 0
for i in range(k - 1):
	if b * a[i] % 2 == 1:
		p += 1
if a[-1] % 2 == 1:
	p += 1
if p % 2 == 0:
	print('even')
else:
	print('odd')


def checaFuncion(arreglo, b, k):
	fir_is_even = arreglo[0] % 2 == 0 or (k != 1 and b % 2 == 0)
	for i in range(1, k):
		sec_is_even = arreglo[i] % 2 == 0 or (not k - 1 == i and b % 2 == 0)
		fir_is_even = fir_is_even == sec_is_even
	if fir_is_even:
		return 'even'
	else:
		return 'odd'
(b, k) = list(map(int, input().split()))
arreglo = list(map(int, input().split()))
print(checaFuncion(arreglo, b, k))


(b, k) = [int(i) for i in input().split()]
arr = [int(i) for i in input().split()]
odd = 0
for i in range(k - 1):
	if b & 1 and arr[i] & 1:
		odd += 1
if arr[-1] & 1:
	odd += 1
if odd & 1:
	print('odd')
else:
	print('even')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for it in a:
	ans = ans * n + it
	ans &= 1
if ans:
	print('odd')
else:
	print('even')


(b, k) = [int(x) for x in input().split()]
L = [int(x) for x in input().split()]
t = 0
for i in range(0, len(L) - 1):
	t += L[i]
t *= b % 2
t += L[-1]
if t % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(t) for t in input().split()]
print(['even', 'odd'][(a[-1] + sum(a[:-1]) * b) % 2])


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
ans = 0
for x in a:
	ans = ans * b + x
	ans %= 2
if ans == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
lst = list(map(int, input().split()))
if b % 2 == 0:
	if lst[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	cnt = 0
	for i in range(k):
		if lst[i] % 2 == 1:
			cnt += 1
	if cnt % 2 == 0:
		print('even')
	else:
		print('odd')


b = int(input().split()[0])
n = list(map(int, input().split()))
if b % 2:
	n = sum(n)
else:
	n = n[-1]
print('odd' if n % 2 else 'even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b & 1:
	if sum(a) & 1:
		print('odd')
	else:
		print('even')
elif a[-1] & 1:
	print('odd')
else:
	print('even')


import sys
i = 0
ans = 0
ni = 0
for line in sys.stdin:
	if i == 0:
		i = 1
		n = list(map(int, line.split()))
		b = n[0]
		nu = n[1]
	else:
		num = list(map(int, line.split()))
		if b % 2 == 0:
			if num[nu - 1] % 2 == 0:
				print('even')
			else:
				print('odd')
		else:
			for x in range(0, nu):
				if num[x] % 2 == 1:
					ni = ni + 1
			if ni % 2 == 1:
				print('odd')
			else:
				print('even')
		i = 0


(b, k) = map(int, input().split())
a = input().split()
odds = 0
for number in a:
	if int(number) % 2:
		odds += 1
if b % 2:
	if odds % 2:
		print('odd')
	else:
		print('even')
elif int(a[len(a) - 1]) % 2:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
(e, o) = (0, 0)
for i in a[:-1]:
	if b % 2 == 0 or i % 2 == 0:
		e += 1
	else:
		o += 1
if a[-1] % 2 == 0:
	e += 1
else:
	o += 1
if o % 2 == 0:
	print('even')
else:
	print('odd')


a = [int(e.strip()) for e in input().split(' ')]
(b, k) = (a[0], a[1])
a = [int(e.strip()) for e in input().split(' ')]
odd = 0
even = 0
for i in a:
	if i % 2 == 1:
		odd += 1
if b % 2 == 0 and a[-1] % 2 == 1:
	print('odd')
if b % 2 == 0 and a[-1] % 2 == 0:
	print('even')
if b % 2 == 1 and odd % 2 == 1:
	print('odd')
if b % 2 == 1 and odd % 2 == 0:
	print('even')


(b, k) = map(int, input().split())
ar = list(map(int, input().split()))
if b % 2 == 0:
	if ar[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	c = 0
	for x in ar:
		if x % 2 == 1:
			c += 1
	if c % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
cur = 0
for c in a:
	cur = (cur * b + c) % 2
if cur == 0:
	print('even')
else:
	print('odd')


a = input().split()
num = input().split()
b = int(a[0])
if b % 2 == 0:
	if int(num[len(num) - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	n = 0
	for i in range(len(num)):
		if int(num[i]) % 2 == 1:
			n += 1
	if n % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = [int(x) for x in input().split(' ')]
a = [int(x) for x in input().split(' ')]
metrika = len([i for i in a if i % 2 != 0])
print('even' if a[-1] % 2 == 0 and b % 2 == 0 or (b % 2 != 0 and metrika % 2 == 0) else 'odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
(chet, nechet) = (0, 0)
for (i, x) in enumerate(a):
	if x % 2 == 0:
		chet += 1
	else:
		nechet += 1
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif nechet % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
c = 0
for i in range(k - 1):
	if a[i] % 2 == 0 or b % 2 == 0:
		continue
	else:
		c += 1
if a[-1] % 2 == 1:
	c += 1
if c % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
X = [int(a) for a in input().split()]
if b % 2 == 1:
	r = sum(X) % 2
else:
	r = X[-1] % 2
if r == 0:
	print('even')
else:
	print('odd')


ls1 = [int(i) for i in input().split()]
ls2 = [int(i) for i in input().split()]
y = 0
for x in ls2:
	if x % 2 != 0:
		y += 1
if ls1[0] % 2 == 0:
	if ls2[ls1[1] - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif y % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
odd = 0
if b % 2 == 1:
	for i in range(len(arr) - 1):
		if arr[i] % 2 == 1:
			odd += 1
			odd = odd % 2
	if arr[k - 1] % 2 == 1:
		odd += 1
		odd %= 2
	if odd != 0:
		print('odd')
		exit()
	else:
		print('even')
		exit()
elif arr[k - 1] % 2 == 1:
	print('odd')
	exit()
else:
	print('even')


(b, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	odd = 0
	for i in a:
		if i % 2 == 1:
			odd += 1
	if odd % 2 == 0:
		print('even')
	else:
		print('odd')


(a, b) = map(int, input().split())
x = list(map(int, input().split()))
if a & 1 == 1:
	ans = sum(x) & 1
else:
	ans = x[-1] & 1
if ans == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(x) for x in input().split()]
result = sum(a[:-1]) * b + a[-1]
if result % 2 == 0:
	print('even')
else:
	print('odd')


a = list(map(int, input().split()))
b = list(map(int, input().split()))
t = 0
if a[0] % 2 == 0 and b[a[1] - 1] % 2 == 0:
	print('even')
elif a[0] % 2 == 0 and b[a[1] - 1] % 2 != 0:
	print('odd')
else:
	t = sum(b)
	if t % 2 == 0:
		print('even')
	else:
		print('odd')


import sys
s1 = sys.stdin.readline().rstrip().split(' ')
b = int(s1[0])
k = int(s1[1])
a = list(map(int, sys.stdin.readline().rstrip().split(' ')))
if b % 2 == 0:
	if a[-1] % 2 == 0:
		sys.stdout.write('even')
	else:
		sys.stdout.write('odd')
elif sum(a) % 2 == 0:
	sys.stdout.write('even')
else:
	sys.stdout.write('odd')


(b, k) = map(int, input().split())
l = [*map(int, input().split())]
l.reverse()
res = 0
for (i, e) in enumerate(l):
	res = (res + e * pow(b, i, 2)) % 2
if res == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
d = []
if b % 2 == 0:
	for i in range(len(a) - 1):
		if a[i] % 2 == 0:
			d.append('even')
		else:
			d.append('even')
else:
	for i in range(len(a) - 1):
		if a[i] % 2 == 0:
			d.append('even')
		else:
			d.append('odd')
if a[len(a) - 1] % 2 == 0:
	d.append('even')
else:
	d.append('odd')
s = d.count('odd')
if s % 2 == 0:
	print('even')
else:
	print('odd')


(n, K) = map(int, input().split())
a = [int(x) for x in input().split()]
if n % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	s = 0
	for i in a:
		if i % 2 != 0:
			s += 1
	if s % 2 == 0:
		print('even')
	else:
		print('odd')


(n, k) = map(int, input().split())
arr1 = list(map(int, input().split()))
if n % 2 == 0:
	if arr1[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	c = 0
	for i in arr1:
		if i % 2 != 0:
			c += 1
	if c % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
x = list(map(int, input().split()))
flag = 0
for j in range(k):
	if b % 2 == 0:
		if j < k - 1:
			flag = 0
		elif x[j] % 2 != 0:
			flag = 1
	elif j == 0:
		if x[j] % 2 == 0:
			flag = 0
		else:
			flag = 1
	elif x[j] % 2 != 0:
		if flag == 0:
			flag = 1
		else:
			flag = 0
if flag == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
chislo = list(map(int, input().split()))[::-1]
print('even' if (sum(chislo[1:]) * b + chislo[0]) % 2 == 0 else 'odd')


(b, k) = tuple(map(int, input().split()))
nums = list(map(int, input().split()))
if b % 2 == 0:
	if nums[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for i in nums:
		if i % 2 == 1:
			count += 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


import math, string, itertools, fractions, heapq, collections, re, array, bisect, sys, random, time, copy, functools
sys.setrecursionlimit(10 ** 7)
inf = 10 ** 20
eps = 1.0 / 10 ** 10
mod = 10 ** 9 + 7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]

def LI():
	return [int(x) for x in sys.stdin.readline().split()]

def LI_():
	return [int(x) - 1 for x in sys.stdin.readline().split()]

def LF():
	return [float(x) for x in sys.stdin.readline().split()]

def LS():
	return sys.stdin.readline().split()

def I():
	return int(sys.stdin.readline())

def F():
	return float(sys.stdin.readline())

def S():
	return input()

def pf(s):
	return print(s, flush=True)

def main():
	(b, k) = LI()
	a = LI()
	t = 0
	for c in a:
		t *= b
		t += c
		t %= 2
	if t % 2 == 1:
		return 'odd'
	return 'even'
print(main())


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
(odd_cnt, even_cnt) = (0, 0)
for i in a:
	if i % 2:
		odd_cnt += 1
	else:
		even_cnt += 1
if n % 2:
	if odd_cnt % 2:
		print('odd')
	else:
		print('even')
elif a[-1] % 2:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
ar = list(map(int, input().split()))
odd = [n for n in ar if n % 2 == 1]
if b % 2 == ar[-1] % 2 == 0 or b % 2 != len(odd) % 2 == 0:
	print('even')
else:
	print('odd')


from math import *
(b, k) = map(int, input().split())
L1 = list(map(int, input().split()))
a = 0
for i in L1:
	if b % 2 != 0:
		if i % 2 != 0:
			a += 1
if L1[-1] % 2 != 0 and b % 2 == 0:
	a += 1
if a % 2 == 0:
	print('even')
else:
	print('odd')


import sys
import math
get_string = lambda : sys.stdin.readline().strip()
get_int_list = lambda : list(map(int, sys.stdin.readline().strip().split()))
get_int = lambda : int(sys.stdin.readline())
pt = lambda x: sys.stdout.write(str(x) + '\n')
(b, k) = get_int_list()
lst = get_int_list()
if b & 1 == 0:
	if lst[-1] & 1 == 0:
		print('even')
	else:
		print('odd')
else:
	s = sum(lst)
	if s & 1 == 0:
		print('even')
	else:
		print('odd')


import sys
import re
vals = re.compile('\\s').split(sys.stdin.readline())
del vals[len(vals) - 1]
vals = list(map(lambda x: int(x), vals))
b = vals[0] % 10
k = vals[1]
vals = re.compile('\\s').split(sys.stdin.readline())
del vals[len(vals) - 1]
vals = list(map(lambda x: int(x), vals))
vals.reverse()
sum = 0
pow = 1
for i in range(k):
	sum = (sum % 10 + pow * (vals[i] % 10) % 10) % 10
	pow = pow % 10 * b % 10
if sum % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
ar = list(map(int, input().split()))
t = 1
cnt = 0
if b % 2 != 0:
	for i in ar:
		if i % 2 != 0:
			cnt += 1
	if cnt % 2 == 0:
		print('even')
	else:
		print('odd')
elif ar[len(ar) - 1] % 2 == 0:
	print('even')
else:
	print('odd')


(a, k) = [int(x) for x in input().split()]
l = [int(x) for x in input().split()]
odd = 0
even = 0
if a % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in l:
		if i % 2 != 0:
			odd += 1
	if odd % 2 == 0:
		print('even')
	else:
		print('odd')


import sys

def get_array():
	return list(map(int, sys.stdin.readline().split()))

def get_ints():
	return map(int, sys.stdin.readline().split())

def input():
	return sys.stdin.readline().strip('\n')
(b, k) = get_ints()
l = get_array()
j = 0
ans = 0
for i in reversed(l):
	ans += i * pow(b, j, 2)
	ans %= 2
	j += 1
if ans == 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
t = 0
p = 0
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in a:
		if i % 2 != 0:
			t += 1
	if t % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
e = 0 if l[k - 1] & 1 == 1 else 1
o = 0 if l[k - 1] & 1 == 0 else 1
for i in range(k - 1):
	if b * l[i] & 1 == 0:
		e += 1
	else:
		o += 1
if o & 1 == 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
s = 0
for i in range(k):
	k = k - 1
	s = s + l[i] * pow(b, k, 100)
if s % 2 == 0:
	print('even')
else:
	print('odd')


def main():
	(b, k) = [int(v) for v in input().split()]
	data = [int(v) for v in input().split()]
	s = 0
	d = 1
	for (i, v) in enumerate(reversed(data)):
		s += v % 2 * d
		d = d * b % 2
	print('even' if s % 2 == 0 else 'odd')
main()


(a, b) = map(int, input().split())
l1 = list(map(int, input().split()))
if a % 2 == 0 and l1[-1] % 2 == 0 or (a % 2 == 1 and sum(l1) % 2 == 0):
	print('even')
else:
	print('odd')


(n, m) = map(int, input().split())
l = list(map(int, input().split()))
if n % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum(l) % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(s) for s in input().split()]
n = 0
m = 1
for (i, c) in enumerate(reversed(a)):
	n = (n + c * m) % 2
	m = m * b % 2
print('even' if n % 2 == 0 else 'odd')


from sys import stdin, stdout
input = stdin.readline
listin = lambda : list(map(int, input().split()))
mapin = lambda : map(int, input().split())
(b, k) = mapin()
a = listin()
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for i in a:
		if i % 2 == 1:
			count += 1
	if count % 2 == 1:
		print('odd')
	else:
		print('even')


(b, k) = map(int, input().split())
s = list(map(int, input().split()))
print('eovdedn'[(sum(s[:-1]) * b + s[-1]) % 2::2])


s = list(map(int, input().split(' ')))
b = s[0]
k = s[1]
s = list(map(int, input().split(' ')))
oddc = 0
if b % 2 == 0:
	if s[-1] % 2 != 0:
		print('odd')
	else:
		print('even')
if b % 2 != 0:
	for i in s:
		if i % 2 == 1:
			oddc += 1
	if oddc % 2 == 0:
		print('even')
	else:
		print('odd')


s1 = input()
s2 = input()
x1 = s1.split()
b = int(x1[0])
k = int(x1[1])
y = s2.split()
sum = 0
if b % 2 == 0:
	if int(y[k - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in range(k):
		m = int(y[i]) % 2
		m *= (b % 2) ** (k - 1 - i)
		sum += m
	if sum % 2 == 0:
		print('even')
	else:
		print('odd')


firstLine = input().split()
b = int(firstLine[0])
k = int(firstLine[1])
a = input().split()
counter = 0
if b % 2 == 0:
	if int(a[len(a) - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in range(0, len(a)):
		if int(a[i]) % 2 != 0:
			counter = counter + 1
	if counter % 2 == 0:
		print('even')
	else:
		print('odd')


(a, b) = map(int, input().split())
a = a % 2
s = 0
for (i, j) in zip(map(int, input().split()), range(1, b + 1)):
	if j == b:
		s += i % 2
	elif i % 2:
		s += 1 * a
print('odd' if s % 2 else 'even')


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
even = 1
k -= 1
bb = b % 2
for a in arr:
	if a % 2 != 0 and (bb != 0 or k == 0):
		even ^= 1
	k -= 1
print('even' if even else 'odd')


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
dict_of_even_odd = {}
dict_of_even_odd['odd'] = 0
dict_of_even_odd['even'] = 0
for i in range(len(a)):
	if i == len(a) - 1:
		if a[i] % 2 == 0:
			dict_of_even_odd['even'] = dict_of_even_odd['even'] + 1
		else:
			dict_of_even_odd['odd'] = dict_of_even_odd['odd'] + 1
	elif b % 2 != 0:
		if a[i] % 2 == 0:
			dict_of_even_odd['even'] = dict_of_even_odd['even'] + 1
		else:
			dict_of_even_odd['odd'] = dict_of_even_odd['odd'] + 1
	else:
		dict_of_even_odd['even'] = dict_of_even_odd['even'] + 1
if dict_of_even_odd['odd'] % 2 == 0:
	print('even')
else:
	print('odd')


l1 = [int(x) % 2 for x in input().split()]
l2 = [int(x) % 2 for x in input().split()]
if not l1[0]:
	if not l2[-1]:
		print('even')
	else:
		print('odd')
elif sum(l2) % 2:
	print('odd')
else:
	print('even')


(b, j) = map(int, input().strip().split())
a = list(map(int, input().strip().split()))
s = 0
for x in range(j):
	if x == j - 1:
		s += a[x]
	else:
		s += a[x] * b
if s % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
ans = ''
a = list(map(int, input().split()))
if b % 2 == 0:
	if a[k - 1] % 2 == 1:
		ans = 'odd'
	else:
		ans = 'even'
elif sum(a) % 2 == 1:
	ans = 'odd'
else:
	ans = 'even'
print(ans)


arr = list(map(int, input().strip().split()))
integers = list(map(int, input().strip().split()))
(b, k) = (arr[0], arr[1])
if b % 2:
	rem = 0
	for num in integers:
		rem = (rem + num) % 2
	print(['even', 'odd'][rem])
else:
	print(['even', 'odd'][integers[-1] % 2])


(b, k) = map(int, input().split())
l = list(map(lambda x: int(x) % 2, input().split()))
s = 0
for x in range(k - 1):
	if l[x] != 0 and b % 2 != 0:
		s += 1
if l[-1] == 1:
	s += 1
if s % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(i) for i in input().split()]
if a[-1] % 2 == 0 and b % 2 == 0:
	out = 'even'
elif a[-1] % 2 == 1 and b % 2 == 0:
	out = 'odd'
else:
	qq = 0
	for i in a:
		if i % 2 == 1:
			qq += 1
	if qq % 2 == 0:
		out = 'even'
	else:
		out = 'odd'
print(out)


def A():
	(b, k) = map(int, input().split())
	a = [int(x) for x in input().split()]
	if not b % 2:
		print('odd') if a[-1] % 2 else print('even')
		return
	print('odd') if sum(a) % 2 else print('even')
A()


line1 = input()
line2 = input()
sum1 = 0
sum2 = 0
list1 = line2.split()
list3 = []
for i in list1:
	if int(i) % 2 != 0:
		list3.append(int(i))
(a, b) = line1.split()
a = int(a)
b = int(b)
for i in list3:
	sum1 += i
if a % 2 == 0:
	if int(list1[-1]) % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum1 % 2 == 0:
	print('even')
else:
	print('odd')


(n, k) = [int(i) for i in input().split()]
L = [int(i) for i in input().split()]
if n % 2 == 0:
	if L[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	t = 0
	for i in L:
		if i % 2 == 1:
			t += 1
	if t % 2 == 0:
		print('even')
	else:
		print('odd')


ll = lambda : list(map(int, input().split()))
[b, k] = ll()
arr = ll()
(on, en) = (0, 0)
for i in arr:
	if i % 2 == 0:
		en += 1
	else:
		on += 1
if b % 2 == 0:
	if arr[k - 1] % 2 == 1:
		print('odd')
	else:
		print('even')
elif on % 2 == 1:
	print('odd')
else:
	print('even')


(b, K) = map(int, input().split())
a = [int(x) for x in input().split()]
n = 0
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count_odd = 0
	for k in range(K):
		if a[k] % 2 == 1:
			count_odd += 1
	if count_odd % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
if b % 2 == 0:
	if l[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
	exit(0)
od_count = 0
for x in l:
	if x % 2 != 0:
		od_count += 1
if od_count % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
n = 0
e = 0
o = 0
for i in a:
	if i % 2 == 0:
		e += 1
	else:
		o += 1
if b % 2 == 0 and a[n - 1] % 2 == 0:
	print('even')
elif b % 2 == 0 and a[n - 1] % 2 == 1:
	print('odd')
elif b % 2 == 1:
	if o % 2 == 1:
		print('odd')
	else:
		print('even')


list_int_input = lambda inp: list(map(int, inp.split()))
int_input = lambda inp: int(inp)
string_to_list_input = lambda inp: list(inp)
(b, k) = map(int, input().split())
a = list_int_input(input())
summ = 0
for (ind, i) in enumerate(a):
	if i % 2 == 1 and (b % 2 == 1 or ind == k - 1):
		summ += 1
if summ % 2 == 0:
	print('even')
else:
	print('odd')


(n, b) = map(int, input().split())
l = list(map(int, input().split()))
o = 0
e = 0
la = l[-1]
l.remove(l[-1])
for i in range(len(l)):
	if l[i] % 2 == 0:
		e += 1
	else:
		o += 1
if n % 2 == 0:
	if la % 2 == 0:
		print('even')
	else:
		print('odd')
elif o % 2 == 0 and la % 2 == 0:
	print('even')
elif o % 2 == 0 and la % 2 != 0:
	print('odd')
elif o % 2 != 0 and la % 2 != 0:
	print('even')
elif o % 2 != 0 and la % 2 == 0:
	print('odd')


import collections as cc
import sys
I = lambda : list(map(int, input().split()))
(b, k) = I()
l = I()[::-1]
temp = sum(l) if b % 2 else l[0]
if temp % 2:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
res = 0
sp = list(map(int, input().split()))
for i in range(k):
	if i == k - 1:
		res += sp[i] % 2
		break
	if b % 2 and sp[i] % 2:
		res += 1
if res % 2:
	print('odd')
else:
	print('even')


(b, k) = [int(s) for s in input().split(' ')]
a = [int(s) for s in input().split(' ')]
c = sum(a[:-1]) * b + a[-1]
if c % 2 == 0:
	print('even')
else:
	print('odd')


import math
(b, k) = map(int, input().split())
a_ls = list(map(int, input().split()))
b_string = ''
if b % 2 == 0:
	b_string = 'even'
else:
	b_string = 'odd'
if b_string == 'even':
	if a_ls[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	sum_string = 'even'
	for i in range(k):
		if a_ls[i] % 2 == 0:
			add_val = 'even'
		else:
			add_val = 'odd'
			if sum_string == 'even':
				sum_string = 'odd'
			else:
				sum_string = 'even'
	print(sum_string)


I = lambda : map(int, input().split())
(n, k) = I()
li = list(I())
if li[-1] % 2 == 0:
	ans = 0
else:
	ans = 1
li = li[:len(li) - 1]
if n % 2 == 0:
	if ans == 0:
		print('even')
	else:
		print('odd')
	exit()
for i in li:
	if i % 2 == 0:
		ans += 2
	else:
		ans += 1
if ans % 2 == 0:
	print('even')
else:
	print('odd')


(a, b) = map(int, input().split())
c = list(map(int, input().split()))
odd = []
even = []
if a % 2 == 0:
	if c[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif a % 2 != 0:
	for i in c:
		if i % 2 == 0:
			even.append(i)
		else:
			odd.append(i)
	if len(odd) % 2 == 0:
		print('even')
	else:
		print('odd')


(m, n) = map(int, input().split())
a = [int(x) for x in input().split()]
c = 0
for i in a:
	if i % 2 != 0:
		c += 1
if m % 2 == 0 and a[n - 1] % 2 == 0:
	print('even')
elif m % 2 == 0 and a[n - 1] % 2 != 0:
	print('odd')
elif m % 2 != 0 and c % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = list(map(int, input().split()))
A = list(map(int, input().split()))
if b % 2 == 0 and A[-1] % 2 == 0:
	print('even')
elif b % 2 == 0 and A[-1] % 2 == 1:
	print('odd')
else:
	answer = 0
	frr = 0
	for i in range(k):
		answer += A[i]
		answer %= 2
	if answer % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
D = [*map(int, input().split())]
ans = 0
for i in range(k):
	ans += D[i] * pow(b, k - 1 - i, 2)
	ans %= 2
print(['even', 'odd'][ans % 2 == 1])


def func(b, k, l):
	res = 0
	p = b % 2
	for i in range(len(l) - 1):
		a = l[i] % 2
		res += p * a % 2
	res += l[len(l) - 1] % 2
	if res % 2 == 0:
		return 'even'
	else:
		return 'odd'
(b, k) = map(int, input().split())
l = list(map(int, input().split()))
print(func(b, k, l))


odd = 0
even = 0
(B, K) = map(int, input().split(' '))
A = list(map(int, input().split(' ')))
power = K - 1
for _ in range(K):
	power_even = False if power == 0 else B % 2 == 0
	if power_even and A[_] % 2 == 0 or (not power_even and A[_] % 2 == 0) or (power_even and A[_] % 2 != 0):
		even += 1
	else:
		odd += 1
	power -= 1
if odd % 2 == 0:
	print('even')
else:
	print('odd')


import sys
read = lambda : map(int, sys.stdin.readline().split())
(b, k) = read()
a = list(read())
s = 0
for i in range(k):
	if a[i] % 2 == 0:
		continue
	elif b % 2 == 0:
		if i == k - 1:
			s += 1
		else:
			continue
	else:
		s += 1
if s % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = (*map(int, input().split()),)
print('eovdedn'[[a[k - 1], sum((x % 2 for x in a))][b % 2] % 2::2])


import sys
import math
sys.setrecursionlimit(100000)
input = sys.stdin.readline

def inp():
	return int(input())

def inara():
	return list(map(int, input().split()))

def insr():
	s = input()
	return list(s[:len(s) - 1])

def invr():
	return map(int, input().split())
(b, k) = invr()
ara = inara()
if b % 2 == 0:
	if ara[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	tot = 0
	for num in ara:
		if num % 2:
			tot += 1
	if tot % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
b = b % 2
c = [i % 2 for i in a]
d = []
for j in c[:-1]:
	d.append(b * j)
if (sum(d) + c[-1]) % 2 == 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
s = 0
for i in range(len(a)):
	s += a[i] * pow(b, k - 1 - i, 2)
if s % 2 == 0:
	print('even')
else:
	print('odd')


from functools import reduce
import math
from decimal import *

def factors(n):
	return set(reduce(list.__add__, ([i, n // i] for i in range(1, int(n ** 0.5) + 1) if n % i == 0)))

def sol():
	(b, k) = list(map(int, input().split()))
	s = 0
	arr = list(map(int, input().split()))
	f = 0
	s = sum(arr)
	s -= arr[-1]
	s *= b
	s += arr[-1]
	if not s & 1:
		print('even')
	else:
		print('odd')
sol()


(b, k) = map(int, input().split())
d = list(map(int, input().split()))
if b % 2 == 0:
	if d[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	j = 0
	for i in range(k):
		if d[i] % 2 == 1:
			j += 1
	if j % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
res = 0
if b % 2 == 0:
	print('even' if l[-1] % 2 == 0 else 'odd')
else:
	for e in l:
		if e % 2 == 1:
			res += 1
	print('even' if res % 2 == 0 else 'odd')


(b, k) = map(int, input().split())
d = list(map(int, input().split()))
s = 0
for i in range(k):
	tmp = d[k - 1 - i] * pow(b, i, 2) % 2
	s = (s + tmp) % 2
if s == 0:
	print('even')
else:
	print('odd')


(b, n) = map(int, input().strip().split())
arr = list(map(int, input().strip().split()))
sum1 = sum(arr[:-1])
sum2 = arr[-1]
if sum1 * b % 2 == 0:
	print('odd' if sum2 % 2 else 'even')
else:
	print('even' if sum2 % 2 else 'odd')


R = lambda : map(int, input().split())
(b, k) = R()
a = [*R()]
if b % 2 == 0:
	parity = a[-1] % 2
else:
	parity = sum(a) % 2
if parity:
	print('odd')
else:
	print('even')


first = input().split(' ')
b = int(first[0])
k = int(first[1])
second = input().split(' ')
a = [int(i) for i in second]
n = 0
for i in range(k):
	if k - i - 1 == 0:
		tmp = a[i]
	else:
		tmp = a[i] * b
	tmp = tmp % 10
	n += tmp
	if n > 10:
		n = n % 10
if n & 1 == 0:
	print('even')
else:
	print('odd')


import sys
import math
fileoperation = 0
if fileoperation:
	orig_stdout = sys.stdout
	orig_stdin = sys.stdin
	inputfile = open('W:/Competitive Programming/input.txt', 'r')
	outputfile = open('W:/Competitive Programming/output.txt', 'w')
	sys.stdin = inputfile
	sys.stdout = outputfile
mod = 1000000007

def nospace(l):
	ans = ''.join((str(i) for i in l))
	return ans
t = 1
for tt in range(t):
	(b, k) = map(int, sys.stdin.readline().split(' '))
	ans = 0
	a = list(map(int, sys.stdin.readline().split(' ')))
	a = a[::-1]
	for i in range(k):
		v = pow(b, i, 2)
		ans += v * a[i]
		ans %= 2
	if ans:
		print('odd')
	else:
		print('even')
if fileoperation:
	sys.stdout = orig_stdout
	sys.stdin = orig_stdin
	inputfile.close()
	outputfile.close()


inp1 = str(input()).split(' ')
inp2 = str(input()).split(' ')
b = int(inp1[0])
k = int(inp1[1])
a = [int(x) for x in inp2]
n = 0
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for i in range(k):
		if a[i] % 2 != 0:
			count += 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


f = lambda : map(int, input().split())
(b, k) = f()
b = b % 10
l = list(f())
l1 = []
if b % 2 == 0:
	print('even' if l[-1] % 2 == 0 else 'odd')
else:
	for i in l:
		if i % 2 != 0:
			l1.append(1)
	print('even' if sum(l1) % 2 == 0 else 'odd')


try:
	(x, y) = map(int, input().split())
	l = list(map(int, input().split()))
	if x % 2 == 0:
		if l[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	else:
		c = 0
		for i in range(0, len(l)):
			if l[i] % 2 != 0:
				c += 1
		if c % 2 == 0:
			print('even')
		else:
			print('odd')
except:
	pass


(b, k) = map(int, input().split())
a = [*map(int, input().split())]
if b % 2 == 0:
	a = a[-1:]
print('even' if sum(a) % 2 == 0 else 'odd')


d = {0: [0], 1: [1], 2: [2, 4, 8, 6], 3: [3, 9, 7, 1], 4: [4, 6], 5: [5], 6: [6], 7: [7, 9, 3, 1], 8: [8, 4, 2, 6], 9: [9, 1]}
(b, k) = map(int, input().split())
l = list(map(int, input().split()))
c = 0
n = k - 1
ans = 0
x1 = b % 10
y1 = len(d[x1])
for i in range(0, k):
	x = l[i] % 10
	r = n % y1
	r1 = d[x1][r - 1]
	if n == 0:
		r1 = 1
	ans = ans + x * r1
	n = n - 1
if ans % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
x = a.pop()
check = x % 2
for i in a:
	check += i * b % 2
if check % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
A = [int(i) for i in input().split()]
t = 0
for i in range(k):
	t += A[i] * pow(b, k - 1 - i, 2)
	t %= 2
if t == 0:
	print('even')
else:
	print('odd')


def inint():
	return int(input())

def mp():
	return map(int, input().split())
(b, k) = mp()
a = list(mp())
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
		exit()
	else:
		print('odd')
		exit()
else:
	cho = 0
	for i in range(k - 1):
		if a[i] % 2 != 0:
			cho += 1
	if a[-1] % 2 != 0:
		cho += 1
	if cho % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = (int(i) for i in input().strip().split())
a = [int(x) for x in input().split()]
if b % 2 == 0 and a[k - 1] % 2 > 0:
	print('odd')
elif b % 2 == 0 and a[k - 1] % 2 == 0:
	print('even')
else:
	c = 0
	i = k
	while i > 0:
		if a[i - 1] % 2 == 0:
			c += 1
		i -= 1
	if (k - c) % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
x = 0
if b % 2 == 0:
	if arr[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	x = 0
	for i in range(k - 1):
		if arr[i] % 2 == 1:
			x += 1
	if arr[k - 1] % 2 == 1:
		x += 1
	if x % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = list(map(int, input().split(' ')))
A = list(map(int, input().split(' ')))
is_b_odd = b % 2 == 1
odd = 0
for i in range(len(A) - 1, -1, -1):
	isOdd = A[i] % 2 == 1
	if i == len(A) - 1:
		odd += [1 if isOdd else 0][0]
	else:
		odd += 1 if isOdd and is_b_odd else 0
print(['even', 'odd'][odd % 2 == 1])


values = input().split()
b = int(values[0])
coefficients = list(map(lambda x: int(x), input().split()))
last = coefficients[-1]
if b % 2 == 0:
	if last % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	sum_c = sum(coefficients[:-1])
	if sum_c % 2 == 0:
		if last % 2 == 0:
			print('even')
		else:
			print('odd')
	elif last % 2 == 0:
		print('odd')
	else:
		print('even')


(b, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
odd = 0
even = 0
if b % 2 == 0 and a[k - 1] % 2 == 0:
	print('even')
elif b % 2 == 0 and a[k - 1] % 2 == 1:
	print('odd')
else:
	for num in a:
		if num % 2 == 0:
			even += 1
		else:
			odd += 1
	if b % 2 != 0 and odd % 2 == 0:
		print('even')
	else:
		print('odd')


x = input().split()
n = int(x[0])
k = int(x[1])
A = input().split()
A = list(map(int, A))
ev = 0
if n % 2 == 0:
	ev = 1
if ev == 1:
	if A[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	odds = 0
	for i in A:
		if i % 2 == 1:
			odds += 1
	if odds % 2 == 0:
		print('even')
	else:
		print('odd')


(n, k) = list(map(int, input().split()))
pa = list(map(int, input().split()))
sam = 0
la = []
if n % 2 == 0:
	if pa[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for x in range(k - 1):
		if pa[x] % 2 == 0:
			la.append('e')
		else:
			la.append('o')
	if la.count('o') % 2 == 0:
		if pa[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	elif pa[-1] % 2 == 0:
		print('odd')
	else:
		print('even')


a = [int(e) for e in input().split()]
b = [int(e) for e in input().split()]
o = []
if a[0] % 2 == 0:
	if b[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in b:
		if i % 2 != 0:
			o.append(i)
	if len(o) % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
r = 0
for i in map(int, input().split()):
	r = (b * r + i) % 2
print('odd' if r else 'even')


import sys, re
from collections import deque, defaultdict, Counter
from math import sqrt, hypot, factorial, pi, sin, cos, radians
if sys.version_info.minor >= 5:
	from math import gcd
else:
	from fractions import gcd
from heapq import heappop, heappush, heapify, heappushpop
from bisect import bisect_left, bisect_right
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from functools import reduce, partial
from fractions import Fraction
from string import ascii_lowercase, ascii_uppercase, digits

def input():
	return sys.stdin.readline().strip()

def list2d(a, b, c):
	return [[c] * b for i in range(a)]

def list3d(a, b, c, d):
	return [[[d] * c for j in range(b)] for i in range(a)]

def ceil(a, b=1):
	return int(-(-a // b))

def round(x):
	return int((x * 2 + 1) // 2)

def fermat(x, y, MOD):
	return x * pow(y, MOD - 2, MOD) % MOD

def lcm(x, y):
	return x * y // gcd(x, y)

def lcm_list(nums):
	return reduce(lcm, nums, 1)

def gcd_list(nums):
	return reduce(gcd, nums, nums[0])

def INT():
	return int(input())

def MAP():
	return map(int, input().split())

def LIST():
	return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7
(b, k) = MAP()
A = LIST()
if b % 2 == 0:
	if A[-1] % 2 == 1:
		print('odd')
	else:
		print('even')
else:
	odd = 0
	for i in range(k):
		if A[i] % 2 == 1:
			odd += 1
	if odd % 2 == 1:
		print('odd')
	else:
		print('even')


s = input().split()
n = int(s[0])
k = int(s[1])
s = input().split()
for i in range(k):
	s[i] = int(s[i]) % 2
if n % 2 == 0:
	if s[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum(s) % 2 == 0:
	print('even')
else:
	print('odd')


from sys import setrecursionlimit, stderr
from functools import reduce
from itertools import *
from collections import defaultdict, Counter
from bisect import bisect
setrecursionlimit(10 ** 7)

def read():
	return int(input())

def reads():
	return [int(x) for x in input().split()]
(b, k) = reads()
a = reads()

def answer(n):
	print('even' if n % 2 == 0 else 'odd')
	return
if b % 2 == 0:
	answer(a[-1])
else:
	answer(sum(a))


n = [int(x) for x in input().split()]
f = [int(x) for x in input().split()]
if n[0] % 2 == 0:
	if f[len(f) - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum(f) % 2 == 0:
	print('even')
else:
	print('odd')


import sys
input = sys.stdin.buffer.readline
from math import *
(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
odd = 0
for i in range(k - 1):
	if arr[i] % 2 == 1:
		odd += 1
even = k - odd - 1
if n % 2 == 0:
	if arr[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif odd % 2 == 0:
	if arr[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif arr[-1] % 2 == 0:
	print('odd')
else:
	print('even')


b = list(map(int, input().split()))
K = list(map(int, input().split()))
if b[0] % 2 == 0:
	if K[-1] % 2 == 1:
		print('odd')
	else:
		print('even')
else:
	su = 0
	for i in K:
		su += i % 2
	if su % 2 == 1:
		print('odd')
	else:
		print('even')


(b, k) = map(int, input().split())
m = [int(i) for i in input().split()]
odd = 0
if b % 2 == 0:
	if m[-1] % 2 == 1:
		print('odd')
	else:
		print('even')
else:
	for i in range(k):
		if m[i] % 2 == 1:
			odd += 1
	if odd % 2 == 1:
		print('odd')
	else:
		print('even')


import sys
import math
import bisect
import itertools
import random

def main():
	(m, n) = map(int, input().split())
	A = list(map(int, input().split()))
	val = 0
	for a in A:
		val = (val * m + a) % 2
	if val % 2 == 0:
		print('even')
	else:
		print('odd')
main()


e = '02468'
(b, k) = input().split()
ar = input().split()
r = 0
if b[-1] in e:
	r = ar[-1] not in e
else:
	for a in ar:
		r += a[-1] not in e
print('eovdedn'[r % 2::2])


(b, k) = input().split()
b = int(b)
k = int(k)
count = 0
a = list(map(int, input().split()))
for i in range(0, k):
	c = a[i]
	if c % 2 != 0:
		count = count + 1
if b % 2 == 0:
	if c % 2 == 0:
		print('even')
	else:
		print('odd')
elif count % 2 == 0:
	print('even')
else:
	print('odd')


from collections import deque, Counter, OrderedDict
from heapq import nsmallest, nlargest
from math import ceil, floor, log, log2, sqrt

def binNumber(n, size=1):
	return bin(n)[2:].zfill(size)

def gcd(a, b):
	if a == 0:
		return b
	return gcd(b % a, a)

def iar():
	return list(map(int, input().split()))

def ini():
	return int(input())

def isp():
	return map(int, input().split())

def sti():
	return str(input())
(b, k) = isp()
a = iar()
odd = 0
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in a:
		odd += i % 2
	if odd % 2 == 0:
		print('even')
	else:
		print('odd')


(a, b) = map(int, input().split())
arr = [200010]
arr = list(map(int, input().split()))
ans = 0
for i in range(0, b):
	ans = (ans * a + arr[i]) % 2
if ans % 2:
	print('odd')
else:
	print('even')


o = input().rstrip().split(' ')
p = input().rstrip().split(' ')
f = 0
a = 0
O = 0
E = 0
b = int(o[0])
k = int(o[1]) - 1
while k:
	if b % 2 != 0:
		if k % 2 == 0 or k % 2 != 0:
			if int(p[a]) % 2 != 0:
				O = O + 1
			else:
				E = E + 1
	else:
		E = E + 1
	a += 1
	k -= 1
if int(p[len(p) - 1]) % 2 != 0:
	O = O + 1
else:
	E = E + 1
if E == 0:
	if O % 2 == 0:
		print('even')
	else:
		print('odd')
elif O == 0:
	print('even')
elif O == E:
	if O % 2 != 0 and E % 2 != 0:
		print('odd')
	else:
		print('even')
elif O > E:
	if O % 2 == 0 and E % 2 != 0:
		print('even')
	else:
		print('odd')
elif (E % 2 == 0 or E % 2 != 0) and O % 2 != 0:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if not b % 2:
	print(['even', 'odd'][a[-1] % 2])
else:
	h = list(filter(lambda x: x % 2 == 1, a))
	print(['even', 'odd'][len(h) % 2])


import math
(b, k) = map(int, input().split())
a = [i for i in map(int, input().split())]
stat = 0
for i in a:
	stat = (b * stat + i) % 2
print('odd' if stat else 'even')


a = input()
b = input()

def task1(a, b):
	a = a.split()
	b = b.split()
	x = 0
	for i in b:
		x = (x * int(a[0]) + int(i)) % 2
	if x == 0:
		print('even\n')
	else:
		print('odd\n')
task1(a, b)


(b, n) = map(int, input().split())
l = [i for i in map(int, input().split())]
l.reverse()
i = 1
r = 0
for e in l:
	r += e * i % 2
	i *= b % 2
print('even' if r % 2 == 0 else 'odd')


(b, n) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	o = 0
	for i in a:
		o += i % 2
	if o % 2 == 0:
		print('even')
	else:
		print('odd')


def iseven(x):
	if x % 2 == 0:
		return True
	else:
		return False
l = []
s = 0
(b, k) = map(int, input().split())
l = [int(x) for x in input().split()]
for i in range(0, len(l) - 1):
	s += int(l[i] * b)
s += l[len(l) - 1]
if iseven(s) is True:
	print('even')
else:
	print('odd')
exit()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
a = [x % 2 for x in a]
s = sum(a)
if b % 2:
	if s % 2 == 0:
		print('even')
	else:
		print('odd')
elif a[-1]:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
su = 0
for i in range(k - 1):
	su += b * (l[i] % 10)
su += l[-1]
if su % 2 == 0:
	print('even')
else:
	print('odd')


def last_digit(n1, n2):
	if n2 == 0:
		return 1
	cycle = [n1 % 10]
	while True:
		nxt = cycle[-1] * n1 % 10
		if nxt == cycle[0]:
			break
		cycle.append(nxt)
	return cycle[(n2 - 1) % len(cycle)]
i = input().split()
b = int(i[0])
k = int(i[1])
x = input().split()
n = 0
for m in range(k):
	x[m] = int(x[m])
for m in range(k):
	n += x[m] * last_digit(b, k - 1 - m)
if n % 2 == 0:
	print('even')
else:
	print('odd')


def ans(a, bk):
	(b, k) = (bk[0], bk[1])
	if b % 2:
		o_cnt = 0
		e_cnt = 0
		for i in range(0, k - 1):
			if a[i] % 2:
				o_cnt += 1
			else:
				e_cnt += 1
		if a[-1] % 2:
			o_cnt += 1
		else:
			e_cnt += 1
		if o_cnt % 2:
			return 'odd'
		return 'even'
	else:
		if a[-1] % 2:
			return 'odd'
		return 'even'
bk = list(map(int, input().strip().split()))
a = list(map(int, input().strip().split()))
print(ans(a, bk))


(b, k) = input().split()
b = int(b)
k = int(k)
oddcount = 0
data = input().split()
for i in range(0, len(data) - 1):
	if int(data[i]) * b % 2:
		oddcount = oddcount + 1
if int(data[len(data) - 1]) % 2:
	oddcount = oddcount + 1
if oddcount % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(x) for x in input().split()]
p = [1 for i in range(len(a))]
for i in range(len(a)):
	if a[i] % 2 == 0:
		p[i] = 0
if b % 2 == 0:
	for i in range(len(a) - 1):
		p[i] = 0
e = 0
o = 0
for i in p:
	if i % 2 == 0:
		e += 1
	else:
		o += 1
if o % 2 == 0:
	print('even')
else:
	print('odd')


nk = list(map(int, input().split()))
(b, k) = (nk[0], nk[1])
even = True
ar = list(map(int, input().split()))
for i in range(k):
	x = ar[i]
	if b % 2 == 0:
		even = x % 2 == 0
	else:
		even ^= x % 2
if even:
	print('even')
else:
	print('odd')


def old1(a, b, c):
	if b % 2 == 0:
		return 0
	elif a % 2 != 0:
		return 1
	else:
		return 0
(b, k) = map(int, input().split())
a = list(map(int, input().split()))
q = k - 1
w = []
for i in range(k - 1):
	w.append(old1(a[i], b, q))
	q -= 1
if a[k - 1] % 2 == 0:
	w.append(0)
else:
	w.append(1)
e = w[0]
for i in range(k - 1):
	if w[i] == 0 and w[i + 1] == 0 or (w[i] == 1 and w[i + 1] == 1):
		e = 0
		w[i + 1] = e
	else:
		e = 1
		w[i + 1] = e
if e == 0:
	print('even')
else:
	print('odd')


import sys
import math
from collections import deque

def scan():
	return list(map(int, sys.stdin.readline().strip().split()))

def print_primes_till_n(n):
	(i, j, flag) = (0, 0, 0)
	a = []
	c = 0
	for i in range(1, n + 1, 1):
		if i == 1 or i == 0:
			continue
		flag = 1
		for j in range(2, i // 2 + 1, 1):
			if i % j == 0:
				flag = 0
				break
		if flag == 1:
			a.append(i)
			c += 1
	return (a, c)

def is_square(n):
	b = math.sqrt(n)
	if n == int(b * b):
		return True
	return False

def solution():
	(n, k) = scan()
	a = scan()
	if n % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	else:
		s = sum(a)
		if s % 2 == 0:
			print('even')
		else:
			print('odd')
solution()


l = input().split()
b = int(l[0])
k = int(l[1])
l = input().split()
li = [int(i) for i in l]
if b % 2 == 0:
	if li[-1] % 2:
		print('odd')
	else:
		print('even')
else:
	z = sum(li)
	if z % 2:
		print('odd')
	else:
		print('even')


(k, n) = map(int, input().split())
mat = list(map(int, input().split()))
if k % 2 == 0:
	print('odd' if mat[-1] % 2 == 1 else 'even')
else:
	odds = sum((i / i for i in mat if i % 2 == 1))
	print('odd' if odds % 2 == 1 else 'even')


bk = list(map(int, input().strip().split()))
b = bk[0]
k = bk[1]
l = [int(i) for i in input().split()]
l1 = l[:k - 1]
res = sum(l1) * b
res += l.pop()
if res % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
l = list(map(int, input().strip().split()))[:k]
if b % 2 == 0:
	if l[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	s = sum(l)
	if s % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
A = list(map(int, input().split()))
if b % 2:
	if sum(A) % 2:
		print('odd')
	else:
		print('even')
elif A[-1] % 2:
	print('odd')
else:
	print('even')


(a, b) = map(int, input().split())
c = input().split()
t = 1
sum = 0
for i in c:
	sum = sum + eval(i) * pow(a, b - t, 2)
	sum %= 2
	t = t + 1
if sum == 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
array = list(map(int, input().split()))
if b % 2 == 0:
	if array[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count_odd = 0
	for i in array:
		if i % 2:
			count_odd += 1
	if count_odd % 2:
		print('odd')
	else:
		print('even')


(b, k) = [int(i) for i in input().split(' ')]
dig = [int(i) for i in input().split(' ')]
S = 0
if b % 2 == 0:
	if dig[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in dig:
		S += i % 2
	if S % 2 == 0:
		print('even')
	else:
		print('odd')


import math
import bisect
import itertools
import sys
I = lambda : sys.stdin.readline()
mod = 10 ** 9 + 7

def modu(a, m):
	if a % m:
		return a % m
	return m

def mindiff(a):
	b = a[:]
	b.sort()
	m = 10000000000
	for i in range(len(b) - 1):
		if b[i + 1] - b[i] < m:
			m = b[i + 1] - b[i]
	return m

def lcm(a, b):
	return a * b // math.gcd(a, b)

def merge(a, b):
	i = 0
	j = 0
	c = 0
	ans = []
	while i < len(a) and j < len(b):
		if a[i] < b[j]:
			ans.append(a[i])
			i += 1
		else:
			ans.append(b[j])
			c += len(a) - i
			j += 1
	ans += a[i:]
	ans += b[j:]
	return (ans, c)

def mergesort(a):
	if len(a) == 1:
		return (a, 0)
	mid = len(a) // 2
	(left, left_inversion) = mergesort(a[:mid])
	(right, right_inversion) = mergesort(a[mid:])
	(m, c) = merge(left, right)
	c += left_inversion + right_inversion
	return (m, c)

def is_prime(num):
	if num == 1:
		return False
	if num == 2:
		return True
	if num == 3:
		return True
	if num % 2 == 0:
		return False
	if num % 3 == 0:
		return False
	t = 5
	a = 2
	while t <= int(math.sqrt(num)):
		if num % t == 0:
			return False
		t += a
		a = 6 - a
	return True

def ceil(a, b):
	if a % b == 0:
		return a // b
	else:
		return a // b + 1

def binsearch(arr, b, low, high):
	if low == high:
		return low
	if arr[math.ceil((low + high) / 2)] < b:
		return binsearch(arr, b, low, math.ceil((low + high) / 2) - 1)
	else:
		return binsearch(arr, b, math.ceil((low + high) / 2), high)

def ncr1(n, r):
	s = 1
	for i in range(min(n - r, r)):
		s *= n - i
		s %= mod
		s *= pow(i + 1, mod - 2, mod)
		s %= mod
	return s

def calc(n, m, r):
	s = 0
	for i in range(0, r + 1, 2):
		s += ncr1(n, i) * ncr1(m, i)
		s %= mod
	return s
(n, k) = map(int, input().split())
a = list(map(int, input().split()))
if n % 2 == 0:
	if a[-1] % 2:
		print('odd')
	else:
		print('even')
else:
	o = 0
	for i in a:
		if i % 2:
			o += 1
	if o % 2:
		print('odd')
	else:
		print('even')


def check_right(i, arr, n, k):
	count = 0
	s = i
	s += 1
	while s <= i + k and arr[s] == '0':
		s += 1
		count += 1
	if count == k:
		return True
	return False

def check_left(i, arr, n, k):
	m = i
	m -= 1
	count1 = 0
	while m >= i - k and arr[m] == '0':
		m -= 1
		count1 += 1
	if count1 == k:
		return True
	return False

def solve():
	[b, k] = [int(x) for x in input().split()]
	even = odd = False
	if b % 2 == 0:
		even = True
	else:
		odd = True
	arr = [int(x) for x in input().split()]
	odd_count = 0
	even_count = 0
	for i in range(len(arr) - 1):
		if arr[i] % 2 == 0 and even:
			even_count += 1
		elif arr[i] % 2 != 0 and even:
			even_count += 1
		elif arr[i] % 2 == 0 and odd:
			even_count += 1
		elif arr[i] % 2 != 0 and odd:
			odd_count += 1
	if arr[-1] % 2 != 0:
		odd_count += 1
	if odd_count % 2 == 0:
		return 'Even'
	return 'Odd'

def main():
	ans = solve()
	print(ans)
main()


import sys
for s in sys.stdin:
	(n, k) = list(map(int, s.split(' ')))
	ar = list(map(int, input().split(' ')))
	ar.reverse()
	tot = ar[0]
	if n % 2 == 0:
		n = 2
	else:
		n = 3
	for i in range(1, len(ar)):
		tot += ar[i] * n
	if tot % 2 == 0:
		print('even')
	else:
		print('odd')


import time
(b, k) = (int(i) for i in input().split())
a = [int(i) for i in input().split()]
start = time.time()
ans = ' '
if b % 2 == 0:
	test = a[-1] % 2
else:
	test = sum(a) % 2
if test == 0:
	print('even')
else:
	print('odd')
finish = time.time()


(b, k) = map(int, input().split())
l = [int(x) for x in input().split()]
if b % 2 == 0:
	ans = 'even' if l[k - 1] % 2 == 0 else 'odd'
else:
	odd = sum((1 for x in l[:k - 1] if x % 2 != 0))
	odd += 1 if l[k - 1] % 2 != 0 else 0
	ans = 'even' if odd % 2 == 0 else 'odd'
print(ans)


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
q = ''
if b % 2 == 0:
	if a[len(a) - 1] % 2 == 0:
		q = 'even'
	else:
		q = 'odd'
else:
	t = 0
	for i in range(0, len(a)):
		if a[i] % 2 != 0:
			t += 1
	if t % 2 == 0:
		q = 'even'
	else:
		q = 'odd'
print(q)


(b, k) = map(int, input().split())
ans = 0
numbers = list(map(int, input().split()))
x = numbers.pop()
for a in numbers:
	ans += a * b % 2
ans += x % 2
if ans % 2 == 1:
	print('odd')
else:
	print('even')


(b, n) = map(int, input().split())
l = list(map(int, input().split()))
if b % 2 == 0 and l[n - 1] % 2 == 0:
	print('even')
elif b % 2 == 0 and l[n - 1] % 2 != 0:
	print('odd')
else:
	cnt = 0
	for i in range(n):
		if l[i] % 2 != 0:
			cnt += 1
	if cnt % 2 != 0:
		print('odd')
	else:
		print('even')


import sys
sys.setrecursionlimit(200000)
input = sys.stdin.readline
(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b % 2 == 0:
	if a[-1] % 2 == 1:
		print('odd')
	else:
		print('even')
else:
	ans = 0
	for i in a:
		if i % 2 == 0:
			continue
		else:
			ans += 1
	if ans % 2 == 0:
		print('even')
	else:
		print('odd')


def get():
	return list(map(int, input().split()))
(b, k) = get()
a = get()
if b % 2 == 0:
	if a[-1] % 2:
		print('odd')
	else:
		print('even')
elif sum(a) % 2 == 0:
	print('even')
else:
	print('odd')


import math

def f(b, k, arr):
	if b % 2 == 1:
		return sum([el % 2 for el in arr]) % 2
	else:
		return arr[-1] % 2
here = [int(el) for el in input().split(' ')]
b = here[0]
k = here[1]
arr = [int(el) for el in input().split(' ')]
if f(b, k, arr):
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b % 2 == 0:
	print('Even' if a[-1] % 2 == 0 else 'Odd')
else:
	c = 0
	for i in range(k):
		if a[i] % 2 != 0:
			c += 1
	print('Even' if c % 2 == 0 else 'Odd')


(B, K) = list(map(int, input().split()))
A = list(map(int, input().split()))
if B % 2 == 0:
	print('odd' if A[-1] % 2 else 'even')
else:
	print('odd' if sum(A) % 2 else 'even')


def main():
	(b, k) = map(int, input().split())
	a = list(map(int, input().split()))
	even = 0
	odd = 0
	for i in a:
		if i % 2 == 0:
			even += 1
		else:
			odd += 1
	if b % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	elif odd % 2 == 0:
		print('even')
	else:
		print('odd')
main()


R = lambda : map(int, input().split())
(b, k) = R()
L = list(R())
c = 0
for i in range(k - 1):
	if L[i] % 2 and b % 2:
		c += 1
if L[k - 1] % 2:
	c += 1
if c % 2:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
a.reverse()
s = 0
b = b % 10
last = 1
for i in range(len(a)):
	s = (s + last * a[i] % 10) % 10
	last = last * b % 10
if s % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
is_even = 0
cur_pow = 1
for i in range(k):
	is_even += cur_pow * a[k - i - 1]
	is_even %= 2
	cur_pow *= b
	cur_pow %= 2
	if cur_pow == 0:
		break
if is_even == 0:
	print('even')
else:
	print('odd')


(a, b) = input().split()
b = int(b)
li = list(map(int, input().split()))
test = 0
for i in li:
	b = b - 1
	test = test + i * pow(int(a), b, 100)
if test % 2 == 0:
	print('even')
else:
	print('odd')


[b, k] = [int(x) for x in input().split()]
xs = [int(x) for x in input().split()]
I = [xs[-1], sum([x % 2 for x in xs])][b % 2]
print(['even', 'odd'][I % 2])


from math import *
from copy import *
from string import *
from random import *
from sys import stdin
from itertools import *
from collections import Counter
(b, k) = map(int, stdin.readline().rstrip().split())
l = list(map(int, stdin.readline().rstrip().split()))
odd = False
if b & 1 == 1:
	odd = True
summ = 0
ans = 'even'
x = 0
l = l[::-1]
for i in range(len(l) - 1, -1, -1):
	if l[i] != 0:
		if i == 0:
			summ += l[i]
		elif odd:
			if l[i] & 1 == 1:
				l[i] = 3
				c = 3
				summ += 1
			else:
				summ += 2
		else:
			summ += 2
if summ & 1 == 0:
	print('even')
else:
	print('odd')


import random

def ii():
	return int(input())

def mi():
	return map(int, input().split())

def li():
	return list(mi())
(b, k) = tuple(mi())
a = li()
ans = 0
p = []
for i in range(1, k):
	if pow(b, i) % 10 in p:
		break
	p.append(pow(b, i) % 10)
size = len(p)
for i in range(k - 2, -1, -1):
	ans += a[i] * p[(k - 2 - i) % size]
ans += a[k - 1]
print('even' if ans % 2 == 0 else 'odd')


(s, k) = map(int, input().split())
a = list(map(int, input().split()))
z = 'even'
if s % 2:
	n = 0
	for i in range(k):
		n += a[i]
	if n % 2:
		z = 'odd'
elif a[len(a) - 1] % 2:
	z = 'odd'
print(z)


(b, k) = map(int, input().split())
A = list(map(int, input().split()))
if b % 2 == 1:
	cnt = 0
	for i in A:
		if i % 2 == 1:
			cnt += 1
	if cnt % 2:
		print('odd')
	else:
		print('even')
elif A[-1] % 2:
	print('odd')
else:
	print('even')


from functools import reduce
bk = input().split()
b = int(bk[0])
k = int(bk[1])
L = list(map(int, input().split()))
if b % 2 == 0:
	if L[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	s = reduce(lambda x, y: x + y, L)
	if s % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
a.reverse()
x = 1
s = 0
for i in range(k):
	s += x * a[i] % 2
	s %= 2
	x = x * b % 2
if s != 0:
	print('odd')
else:
	print('even')


(b, k) = input().split(' ')
listInputs = input().split(' ')
n = 0
nImparesBasePar = 0
if int(b) % 2 == 0:
	if int(listInputs[-1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for value in listInputs:
		if int(value) % 2 != 0:
			nImparesBasePar += 1
	if nImparesBasePar % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
(*a,) = map(int, input().split())
x = 0
for i in range(k):
	x = x % 10 + a[i] * pow(b, k - i - 1, 10)
print(['even', 'odd'][x % 2])


str_in = str(input())
(b, k) = (int(str_in.split()[0]), int(str_in.split()[1]))
a = input().split()
if k == 1 and int(a[0]) == 0:
	print('even')
elif b % 2 == 0:
	if int(a[k - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	num = 0
	for i in range(k):
		num += int(a[i])
	if num % 2 == 0:
		print('even')
	else:
		print('odd')


import sys
t = list(map(int, sys.stdin.readline().split()))
(b, k) = (t[0], t[1])
a = list(map(int, sys.stdin.readline().split()))
if k == 1:
	if a[0] % 2 == 0:
		print('even')
	else:
		print('odd')
elif b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	c = 0
	for i in a:
		c += i % 2
	if c % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split(' '))
a = input().split(' ')
a = [int(i) for i in a]
t = []
for i in range(k):
	if a[i] % 2 == 0:
		t.append(int(0))
	else:
		t.append(int(1))
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	temp = t.count(1)
	if temp % 2 == 0:
		print('even')
	else:
		print('odd')


def nn():
	return int(input())

def li():
	return list(input())

def mi():
	return map(int, input().split())

def lm():
	return list(map(int, input().split()))
(k, n) = mi()
ilist = lm()
if k % 2 == 0:
	if ilist[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	s = sum(ilist)
	if s % 2 == 0:
		print('even')
	else:
		print('odd')


from sys import stdin, stdout
from collections import Counter

def ai():
	return list(map(int, stdin.readline().split()))

def ei():
	return map(int, stdin.readline().split())

def ip():
	return int(stdin.readline().strip())

def op(ans):
	return stdout.write(str(ans) + '\n')
import math
(b, k) = ei()
a = ai()
if b % 2:
	x = sum(a)
else:
	x = a[-1]
print('odd' if x % 2 else 'even')


(b, c) = [int(x) for x in input().split()]
a = input().split()
if b % 2 == 0:
	if int(a[-1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	odd = 0
	for val in a:
		if int(val) % 2 != 0:
			odd += 1
	if odd % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
for v in a:
	ans = ans * b + v
	ans = ans % 2
if ans:
	print('odd')
else:
	print('even')


def isEven(i):
	return i % 2 == 0
b = int(input().split(' ')[0])
klist = [int(x) for x in input().split(' ')]
res = list()
if isEven(b):
	if isEven(klist[len(klist) - 1]):
		print('even')
	else:
		print('odd')
else:
	o = 0
	for l in klist:
		if not isEven(l):
			o += 1
	if isEven(o):
		print('even')
	else:
		print('odd')


(n, k) = map(int, input().split())
arr = list(map(int, input().split()))
if n % 2 == 0:
	if arr[-1] % 2 != 0:
		print('odd')
	else:
		print('even')
elif len([x for x in arr if x % 2 != 0]) % 2 != 0:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))

def main(a, b, k):
	if b % 2 == 0:
		if a[-1] % 2 != 0:
			return 'odd'
		else:
			return 'even'
	else:
		ans = 0
		for ai in a:
			if (ans + ai) % 2 == 0:
				ans = 0
			else:
				ans = 1
		if ans == 0:
			return 'even'
		else:
			return 'odd'
print(main(a, b, k))


(n, k) = map(int, input().split())
a = []
sum = 0
a = list(map(int, input().split()))
if n % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in range(0, k):
		sum = sum + a[i]
	if sum % 2 == 0:
		print('even')
	else:
		print('odd')


import sys

def get_single_int():
	return int(sys.stdin.readline().strip())

def get_string():
	return sys.stdin.readline().strip()

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def get_list():
	return list(map(int, sys.stdin.readline().strip().split()))
(b, k) = get_ints()
ar = get_list()
le = len(ar)
count_odd = 0

def check_b(b):
	if b % 2 == 0:
		return True
	else:
		return False
if check_b(b):
	if ar[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in range(le):
		if ar[i] % 2 == 1:
			count_odd += 1
	if count_odd % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
sum = 0
loop = 0
flag = True
for index in range(len(a)):
	if b % 2 != 0:
		if a[index] % 2 != 0:
			sum = sum + 1
if b % 2 == 0 and a[-1] % 2 != 0:
	sum = sum + 1
if sum % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
seq = list(map(int, input().split()))
if b % 2 == 0:
	if seq[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	ans = [0 for x in range(k)]
	for i in range(len(seq)):
		ans[i] = seq[i] % 2
	print('odd' if sum(ans) % 2 else 'even')


from collections import deque
import pdb
import heapq
from heapq import *
from pprint import pprint
from bisect import *
mod = 99999999999

def rI():
	return [int(i) for i in input().split()]
(b, k) = rI()
dat = rI()
ld = b % 10
lda = [None for i in range(10)]
for i in range(10):
	lda[i] = ld ** i % 10
per = {1: 1, 2: 4, 3: 4, 4: 2, 5: 1, 6: 7, 7: 4, 8: 4, 9: 2, 0: 1}
perrr = per[ld]
lda[0] = lda[perrr]
dat.reverse()
out = dat[0]
for i in range(1, len(dat)):
	out += lda[i % perrr] * dat[i]
	out %= 10
if out % 2 == 1:
	print('odd')
else:
	print('even')


(base, n) = map(int, input().split())
ls = list(map(int, input().split()))
if base & 1:
	x = sum((1 if item & 1 else 0 for item in ls))
	if x & 1:
		print('odd')
	else:
		print('even')
elif ls[-1] & 1:
	print('odd')
else:
	print('even')


[b, k] = [int(i) for i in input().split()]
lt = [int(i) for i in input().split()]
odd = 0
if b % 2 == 0:
	if lt[-1] % 2 == 1:
		odd = 1
else:
	tot = sum([i % 2 for i in lt])
	if tot % 2 == 1:
		odd = 1
if odd == 1:
	print('odd')
else:
	print('even')


ans = []
(b, k) = map(int, input().split())
a = list(map(int, input().split()))
for i in range(k):
	t1 = a[i]
	t2 = k - (i + 1)
	if t2 > 0:
		if b % 2 == 1:
			t3 = 1
		else:
			t3 = 0
	else:
		t3 = 1
	if t1 % 2 == 0 or t3 % 2 == 0:
		ans.append(0)
	else:
		ans.append(1)
if sum(ans) % 2 == 0:
	print('even')
else:
	print('odd')


R = lambda : map(int, input().split())
(b, k) = R()
a = [*R()]
print('eovdedn'[(b % 2 * sum(a[:-1]) + a[-1]) % 2::2])


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
(q1, answer) = (1, 0)
for q in range(k):
	answer += a[-q - 1] * q1 % 2
	q1 *= b
	q1 %= 2
if answer % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
sum = 0
aa = input()
a = list(map(int, aa.split()))
if b & 1:
	for i in a:
		if i & 1:
			sum += 1
else:
	sum += a[k - 1] & 1
if sum & 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().strip().split())
L = list(map(int, input().strip().split()))
s = sum(L)
k = 0
if b % 2 == 0:
	if L[-1] % 2 == 0:
		k += 1
elif k % 2 == 0:
	if s % 2 == 0:
		k += 1
	else:
		print()
elif k % 2 != 0:
	if s % 2 != 0:
		k += 1
	else:
		pass
if k == 0:
	print('odd')
else:
	print('even')


(b, k) = list(map(int, input().split()))
array = list(map(int, input().split()))
result = 0
for a in array:
	result = (result * b + a) % 2
if result == 1:
	print('odd')
else:
	print('even')


from collections import deque
(b, k) = map(int, input().split())
nums = map(int, input().split())
if b % 2 == 0:
	result = 'even' if deque(nums, maxlen=1).pop() % 2 == 0 else 'odd'
else:
	result = 'even' if sum(nums) % 2 == 0 else 'odd'
print(result)


temp = list(map(lambda entry: int(entry), input().split()))
b = temp[0]
k = temp[1]
digits = list(map(lambda entry: int(entry), input().split()))
if b % 2 is 0:
	s = digits[-1]
else:
	s = sum(digits)
if s % 2 is 0:
	print('even\n')
else:
	print('odd\n')


(a, b) = [int(i) for i in input().split()]
s = [int(i) for i in input().split()]
if a % 2:
	e = sum(s) % 2
	if e:
		print('odd')
	else:
		print('even')
else:
	e = s[-1] % 2
	if e:
		print('odd')
	else:
		print('even')


def even_odd(n, k, lst):
	(count1, count2) = (0, 0)
	if n % 2 == 0:
		if lst[k - 1] % 2 == 0:
			return 'even'
		else:
			return 'odd'
	else:
		for i in range(k):
			if lst[i] % 2 == 0:
				count2 += 1
			else:
				count1 += 1
		if count1 % 2 == 0:
			return 'even'
		else:
			return 'odd'
(N, K) = [int(i) for i in input().split()]
a = [int(j) for j in input().split()]
print(even_odd(N, K, a))


(b, k) = map(int, input().split())
a = list((int(i) for i in input().split()))
ev = 0
bev = b % 2
mult = k - 1
for i in a:
	if mult == 0:
		ev = (ev + i * 1 % 2) % 2
	else:
		ev = (ev + i * bev % 2) % 2
	mult -= 1
if ev % 2:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
(*a,) = map(int, input().split())
if b % 2:
	print('eovdedn'[len([i for i in a if i % 2]) % 2::2])
else:
	print('eovdedn'[a[-1] % 2::2])


(b, k) = map(int, input().split())
d = list(map(int, input().split()))
parity = 'even'
if b % 2 == 0:
	if d[-1] % 2 == 0:
		parity = 'even'
	else:
		parity = 'odd'
else:
	numOdd = 0
	for _d in d:
		if _d % 2 != 0:
			numOdd += 1
	if numOdd % 2 == 0:
		parity = 'even'
	else:
		parity = 'odd'
print(parity)


import sys

def getAndParseInt(num=1):
	string = sys.stdin.readline().strip()
	if num == 1:
		return int(string)
	else:
		return [int(part) for part in string.split()]

def getAndParseString(num=1, delim=''):
	string = sys.stdin.readline().strip()
	if num == 1:
		return string
	elif delim != '':
		return [part for part in string.split(delim)]
	else:
		return [part for part in string.split()]
(b, k) = getAndParseInt(2)
representation = getAndParseInt(2)
if b % 2 == 0 and representation[-1] % 2 == 0:
	print('even')
elif b % 2 == 0:
	print('odd')
else:
	numOdds = 0
	for num in representation:
		if num % 2:
			numOdds += 1
	if numOdds % 2 == 0:
		print('even')
	else:
		print('odd')


ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(mi())
(b, k) = mi()
a = li()
b = b % 2
c = 1
ans = 0
for x in a[::-1]:
	ans = (ans + c * x) % 2
	c *= b
print('odd' if ans else 'even')


ln1 = input().split(' ')
b = int(ln1[0])
k = int(ln1[1])
ln = list(map(int, input().split(' ')))
if b % 2 == 0:
	if ln[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	sm = sum(ln)
	if sm % 2 == 0:
		print('even')
	else:
		print('odd')


import sys
import math
line = input()
(n, k) = [int(x) for x in line.split()]
line = input()
number = [int(x) for x in line.split()]
total = 0
if n % 2 == 0:
	if number[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for l in number:
		total ^= l % 2
	if total:
		print('odd')
	else:
		print('even')


def f(a, b):
	if b % 2 == 0:
		return a[-1] % 2 == 0
	nodd = sum([x % 2 > 0 for x in a])
	return nodd % 2 == 0
(b, _) = list(map(int, input().split()))
a = list(map(int, input().split()))
print('even' if f(a, b) else 'odd')


(b, k) = map(int, input().split())
L = list(map(int, input().split()))
if b % 2:
	L = [i % 2 * (b % 2) for i in L]
	print(['even', 'odd'][sum(L) % 2])
else:
	print(['even', 'odd'][L[k - 1] % 2])


import sys
from bisect import bisect_left, bisect_right
from collections import deque, Counter
from math import gcd, sqrt, factorial, ceil, log
from itertools import permutations
inf = float('inf')
mod = 1000000007
mini = 1000000007

def fact(n):
	if n == 0:
		return 1
	p = 1
	d = 10 ** 9 + 7
	for i in range(1, n + 1):
		p = p * i
		p = p % d
	return p

def ncr(n, r):
	d = 10 ** 9 + 7
	num = fact(n)
	den = fact(r) * fact(n - r) % d
	den = pow(den, d - 2, d)
	return num * den % d

def sieve(n):
	prime = [True for i in range(n + 1)]
	lst = [0] * (n + 1)
	p = 2
	while p * p <= n:
		if prime[p]:
			lst[p] = p
			for i in range(p * p, n + 1, p):
				if prime[i] == True:
					prime[i] = False
					lst[i] = p
		p = p + 1
	for i in range(1, n + 1):
		if lst[i] == 0:
			lst[i] = i
	mylist = [0] * (n + 1)
	for i in range(2, n + 1):
		mylist[lst[i]] = mylist[lst[i]] + 1
	return mylist

def binary(number):
	result = 0
	while number:
		result = result + 1
		number = number & number - 1
	return result

def calculate_factors(n):
	hh = [1] * (n + 1)
	p = 2
	while p * p < n:
		if hh[p] == 1:
			for i in range(p * 2, n, p):
				hh[i] = 0
		p += 1
	total = 1
	for p in range(2, n + 1):
		if hh[p] == 1:
			count = 0
			if n % p == 0:
				while n % p == 0:
					n = int(n / p)
					count += 1
				total *= count + 1
	return total

def prime_factors(n):
	i = 2
	factors = set()
	while i * i <= n:
		if n % i:
			i += 1
		else:
			n //= i
			factors.add(i)
	if n > 1:
		factors.add(n)
	if len(factors) == 2:
		return True
	else:
		return False

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

def get_array():
	return list(map(int, sys.stdin.readline().strip().split()))

def get_ints():
	return map(int, sys.stdin.readline().strip().split())

def input():
	return sys.stdin.readline().strip()
(b, k) = get_ints()
Arr = get_array()
Arr = Arr[::-1]
count_odd = 0
count_even = 0
if Arr[0] & 1:
	count_odd += 1
else:
	count_even += 1
for i in range(1, len(Arr)):
	if b % 2 == 0 or Arr[i] % 2 == 0:
		count_even = count_even + 1
	else:
		count_odd = count_odd + 1
if count_odd & 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
c = b % 2
bc = ''
for i in range(k - 1):
	if a[i] % 2 == 1:
		if c and bc == 'odd':
			bc = 'even'
		elif c and bc == 'even':
			bc = 'odd'
		elif not c and bc == 'even':
			bc = 'even'
		elif not c and bc == 'odd':
			bc = 'odd'
		elif c:
			bc = 'odd'
		elif not c:
			bc = 'even'
	elif c and bc == 'odd':
		bc = 'odd'
	elif c and bc == 'even':
		bc = 'even'
	elif not c and bc == 'odd':
		bc = 'odd'
	elif not c and bc == 'even':
		bc = 'even'
	elif c:
		bc = 'even'
	elif not c:
		bc = 'even'
if k == 1:
	if a[0] % 2:
		print('odd')
	else:
		print('even')
	exit()
if a[-1] % 2 and bc == 'even' or (a[-1] % 2 and bc == 'odd5'):
	bc = 'odd'
elif a[-1] % 2 and bc == 'odd' or (a[-1] % 2 == 0 and bc == 'even'):
	bc = 'even'
print(bc)


(b, k) = map(int, input().split())
A = map(int, input().split())
p = 0
for a in A:
	p *= b
	p &= 1
	p += a
	p &= 1
print('odd' if p else 'even')


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
arr.insert(0, 0)
s = 0
for i in range(1, len(arr)):
	s = s + arr[-i] * pow(b, i - 1, 1000000000)
if s & 1:
	print('odd')
else:
	print('even')


entrada = input().split(' ')
b = int(entrada[0])
k = int(entrada[1])
arr = input().split(' ')
if b % 2 == 0:
	if int(arr[k - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for i in range(k):
		if int(arr[i]) % 2 == 1:
			count += 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('EVEN')
	else:
		print('ODD')
else:
	count = 0
	for i in a:
		if i % 2 != 0:
			count += 1
	if count % 2 == 0:
		print('EVEN')
	else:
		print('ODD')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
nr = 0
r_b = b
even = odd = 0
b = b % 10
is_b_even = b % 2 == 0
for (idx, aa) in enumerate(a):
	aa %= 10
	if idx == len(a) - 1 and aa:
		even += int(aa % 2 == 0)
		odd += int(aa % 2 == 1)
	elif aa % 2 == 0:
		even += 1
	elif is_b_even:
		even += 1
	else:
		odd += 1
if odd % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = map(int, input().split())
n = 0
for i in a:
	n = (n * b + i) % 128
if n % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = [int(s) for s in input().split()]
array = [int(s) for s in input().split()]
number = 0
for i in range(k - 1, -1, -1):
	if i == 0:
		number += array[k - 1 - i]
	else:
		number += b * array[k - 1 - i]
	number %= 2
if number % 2 == 0:
	print('even')
else:
	print('odd')


def count_odd(L):
	cnt = 0
	for i in L:
		if i % 2 == 1:
			cnt += 1
	return cnt
(b, k) = map(int, input().split())
inp = [*map(int, input().split())]
if k == 1:
	print('even' if inp[0] % 2 == 0 else 'odd')
	exit()
if b % 2 == 0:
	if inp[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	chk = 0
	if count_odd(inp) % 2 == 1:
		print('odd')
		exit()
	print('even')


import sys
import math
input = sys.stdin.readline
(b, k) = map(int, input().split())
l = list(map(int, input().split()))
if b % 2 == 1:
	count = 0
	for i in range(k):
		if l[i] % 2 == 1:
			count += 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')
elif l[-1] % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b & 1:
	count = 0
	for number in a:
		if number & 1:
			count += 1
	print('eovdedn'[count & 1::2])
else:
	print('eovdedn'[a[-1] & 1::2])


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
mult = b % 2
b = [i % 2 for i in a[:len(a) - 1]]
c = mult * sum(b) + a[-1]
if c % 2 == 0:
	print('even')
else:
	print('odd')


def po(x, n, mod=2):
	res = int(1)
	while n > 0:
		if n & 1:
			res = res * x % mod
		x = x * x % mod
		n //= 2
	return int(res)
(b, k) = map(int, input().split())
l = list(map(int, input().split()))
ans = 0
for i in range(1, k + 1):
	ans = (ans + l[i - 1] * po(b, k - i) % 2) % 2
if ans:
	print('odd')
if ans == 0:
	print('even')


(b, n) = input().split()
(b, n) = (int(b), int(n))
nums = input().split()
if b % 2 == 0:
	if int(nums[n - 1]) % 2 == 0:
		print('even')
	else:
		print('odd')
	exit()
sum = 0
for k in nums:
	sum += int(k)
if sum % 2 == 0:
	print('even')
else:
	print('odd')


TN = 1

def solution():
	(b, k) = map(int, input().split())
	a = list(map(int, input().split()))
	if b % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	else:
		ch = 0
		nch = 0
		for i in range(k):
			if a[i] % 2 == 0:
				ch += 1
			else:
				nch += 1
		if nch % 2 == 0:
			print('even')
		else:
			print('odd')
while TN != 0:
	solution()
	TN -= 1


(b, k) = map(int, input().split(' '))
arrList = list(map(int, input().split(' ')))
b = b % 10
k = k - 1
last_digit_power = dict()
last_digit_power[0] = [0]
last_digit_power[1] = [1]
last_digit_power[2] = [2, 4, 8, 6]
last_digit_power[3] = [3, 9, 7, 1]
last_digit_power[4] = [4, 6]
last_digit_power[5] = [5]
last_digit_power[6] = [6]
last_digit_power[7] = [7, 9, 3, 1]
last_digit_power[8] = [8, 4, 2, 6]
last_digit_power[9] = [9, 1]
num = 0
if b == 0:
	if arrList[len(arrList) - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	tmpList = last_digit_power[b]
	for x in range(len(arrList) - 1):
		idx = k % len(tmpList)
		val = arrList[x] * tmpList[idx]
		last = val % 10
		k -= 1
		num = (num + last) % 10
	num = (num + arrList[len(arrList) - 1]) % 10
	if num % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = list(map(int, input().split()))
A = list(map(int, input().split()))
s = 0
res = 0
d = b % 2
for i in range(len(A)):
	if d == 0 and i != k - 1:
		res += 0
	elif d == 1:
		res += A[i] % 2
	else:
		res += A[i] % 2
	res = res % 2
if res == 0:
	print('even')
else:
	print('odd')


s = [int(n) for n in input().split()]
z = [int(n) % 2 for n in input().split()]
if s[0] % 2 == 0:
	if z[len(z) - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum(z) % 2 == 0:
	print('even')
else:
	print('odd')


(b, n) = map(int, input().split())
l = list(map(int, input().split()))
l = l[:n]
ans = 0
for i in l[:n]:
	if i % 2 != 0:
		ans = ans + 1
if b % 2 == 0:
	if i % 2 == 0:
		print('even')
	else:
		print('odd')
elif ans % 2 == 0:
	print('even')
else:
	print('odd')


input1 = input()
input2 = input()
b = 0
temp = ''
for c in input1:
	if c == ' ':
		b = int(temp)
		break
	else:
		temp += c
len = int(temp)
lNum = []
tempc = ''
for c in input2:
	if c == ' ':
		lNum.append(int(tempc))
		tempc = ''
	else:
		tempc += c
lNum.append(int(tempc))
sum = 0
for num in lNum:
	sum += num
s = sum % 2 == 0
b1 = b % 2 == 0
ldnu = lNum[-1] % 2 == 0
if s and b1 and ldnu:
	print('even')
elif s and b1 and (not ldnu):
	print('odd')
elif s and (not b1) and ldnu:
	print('even')
elif s and (not b1) and (not ldnu):
	print('even')
elif not s and b1 and ldnu:
	print('even')
elif not s and b1 and (not ldnu):
	print('odd')
elif not s and (not b1) and ldnu:
	print('odd')
elif not s and (not b1) and (not ldnu):
	print('odd')


from __future__ import division, print_function
import itertools, os, sys, threading
from io import BytesIO, IOBase
if sys.version_info[0] < 3:
	from __builtin__ import xrange as range
	from future_builtins import ascii, filter, hex, map, oct, zip
BUFSIZE = 8192

class FastIO(IOBase):
	newlines = 0

	def __init__(self, file):
		self._fd = file.fileno()
		self.buffer = BytesIO()
		self.writable = 'x' in file.mode or 'r' not in file.mode
		self.write = self.buffer.write if self.writable else None

	def read(self):
		while True:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			if not b:
				break
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines = 0
		return self.buffer.read()

	def readline(self):
		while self.newlines == 0:
			b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
			self.newlines = b.count(b'\n') + (not b)
			ptr = self.buffer.tell()
			(self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr))
		self.newlines -= 1
		return self.buffer.readline()

	def flush(self):
		if self.writable:
			os.write(self._fd, self.buffer.getvalue())
			(self.buffer.truncate(0), self.buffer.seek(0))

class IOWrapper(IOBase):

	def __init__(self, file):
		self.buffer = FastIO(file)
		self.flush = self.buffer.flush
		self.writable = self.buffer.writable
		self.write = lambda s: self.buffer.write(s.encode('ascii'))
		self.read = lambda : self.buffer.read().decode('ascii')
		self.readline = lambda : self.buffer.readline().decode('ascii')

def print(*args, **kwargs):
	(sep, file) = (kwargs.pop('sep', ' '), kwargs.pop('file', sys.stdout))
	at_start = True
	for x in args:
		if not at_start:
			file.write(sep)
		file.write(str(x))
		at_start = False
	file.write(kwargs.pop('end', '\n'))
	if kwargs.pop('flush', False):
		file.flush()
if sys.version_info[0] < 3:
	(sys.stdin, sys.stdout) = (FastIO(sys.stdin), FastIO(sys.stdout))
else:
	(sys.stdin, sys.stdout) = (IOWrapper(sys.stdin), IOWrapper(sys.stdout))
from math import sqrt, floor, factorial, gcd, log
from collections import deque, Counter, defaultdict
from itertools import permutations, combinations
from math import gcd
from bisect import bisect
from random import randrange
input = lambda : sys.stdin.readline().rstrip('\r\n')
read = lambda : list(map(int, input().strip().split(' ')))

def main():
	(b, k) = read()
	arr = read()
	if b % 2 == 0:
		if arr[-1] % 2:
			print('odd')
		else:
			print('even')
	else:
		c = 0
		for i in arr:
			c += i % 2 != 0
		if c % 2 == 0:
			print('even')
		else:
			print('odd')
main()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
ods = 0
if b % 2 == 0:
	ods = a[-1] % 2
else:
	for ai in a:
		if ai % 2 == 1:
			ods += 1
if ods % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = [int(x) for x in input().split()]
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	t = 0
	for i in range(0, k):
		t = t + a[i]
	if t % 2 == 0:
		print('even')
	else:
		print('odd')


from sys import stdin

def main():
	(base, k) = [int(x) for x in stdin.readline().strip().split()]
	a = [int(x) for x in stdin.readline().strip().split()]
	if base % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
			return
		else:
			print('odd')
			return
	even = True
	for i in range(len(a)):
		even = even == (a[i] % 2 == 0)
	if even:
		print('even')
	else:
		print('odd')
main()


(b, k) = list(map(int, input().split()))
arr = list(map(int, input().split()))
pw = [0] * k
pw[0] = 1
for i in range(1, k):
	pw[i] = pw[i - 1] * b % 2
sum = 0
for i in range(len(arr)):
	sum = (sum + pw[i] * arr[k - i - 1]) % 2
if sum == 1:
	print('odd')
else:
	print('even')


(n, k) = list(map(int, input().split()))
t = list(map(int, input().split()))
if n % 2 == 0:
	if t[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	h = 0
	for j in t:
		if j % 2 == 0:
			pass
		else:
			h += 1
	if h % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = list(map(int, input().split()))
cl = list(map(int, input().split()))
if b % 2 == 0:
	if cl[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for x in cl:
		if x % 2 != 0:
			count += 1
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


import sys
pin = sys.stdin.readline
pout = sys.stdout.write
(li, ans) = ([], 1)
(b, r) = map(int, pin().split())
li = list(map(int, pin().split()))
if b % 2 == 0:
	if li[-1] % 2 == 0:
		pout('even\n')
	else:
		pout('odd\n')
else:
	for i in li:
		if i % 2:
			ans *= -1
	if ans == 1:
		pout('even\n')
	else:
		pout('odd\n')


(b, k) = map(int, input().split())
li = list(map(int, input().split()))
store = 0
if b % 2:
	for i in li:
		if i % 2:
			store -= -1
elif li[-1] % 2:
	store -= -1
print('odd' if store % 2 else 'even')


BK = list(map(int, input().split()))
A = list(map(int, input().split()))
suma = sum(A)
SumD = False
Base = False
LastDigit = False
if suma % 2 == 0:
	SumD = True
if BK[0] % 2 == 0:
	Base = True
if A[-1] % 2 == 0:
	LastDigit = True
if SumD and Base and LastDigit:
	print('Even')
elif SumD and Base and (not LastDigit):
	print('Odd')
elif SumD and (not Base) and LastDigit:
	print('Even')
elif SumD and (not Base) and (not LastDigit):
	print('Even')
elif not SumD and Base and LastDigit:
	print('Even')
elif not SumD and Base and (not LastDigit):
	print('Odd')
elif not SumD and (not Base) and LastDigit:
	print('Odd')
elif not SumD and (not Base) and (not LastDigit):
	print('Odd')


(b, g) = tuple(map(int, input().split()))
a = list(map(int, input().split()))
even = False
if b % 2 == 0:
	if a[len(a) - 1] % 2 == 0:
		even = True
else:
	odds_counter = 0
	for i in a:
		if i % 2 != 0:
			odds_counter += 1
	if odds_counter % 2 == 0:
		even = True
if even:
	print('even')
else:
	print('odd')


__author__ = 'NIORLYS'
[b, k] = list(map(int, input().split()))
a = list(map(int, input().split()))
if b % 2 == 0 and a[-1] % 2 == 0:
	print('even')
elif b % 2 == 0:
	print('odd')
else:
	count_of_odd = 0
	for element in a:
		if element % 2:
			count_of_odd += 1
	if count_of_odd % 2:
		print('odd')
	else:
		print('even')


import sys
import os
(b, k) = map(int, input().split())
oddCount = 0
evenCount = 0
digits = list(map(int, input().split()))
for i in range(0, k):
	if digits[i] == 0:
		continue
	if i == k - 1:
		if digits[i] % 2 == 0:
			evenCount += 1
		else:
			oddCount += 1
		continue
	if digits[i] * b % 2 == 0:
		evenCount += 1
	else:
		oddCount += 1
oddCount %= 2
if oddCount == 0:
	print('even')
else:
	print('odd')


(x, y) = map(int, input().split())
a = list(map(int, input().split()))
t = 0
if x % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
if x % 2 == 1:
	for i in range(y):
		if a[i] % 2 == 1:
			t = t + 1
	if t % 2 == 1:
		print('odd')
	else:
		print('even')


q = input().split()
b = int(q[0])
k = int(q[1])
l = list(map(int, input().split()))
if b % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	even = True
	for i in range(k):
		if l[i] % 2 != 0:
			even = not even
	if even:
		print('even')
	else:
		print('odd')


(b, k) = [int(t) for t in input().split(' ')]
a = [int(t) for t in input().split(' ')]
sum2 = 0
bi = 1
for i in range(k):
	sum2 = (sum2 + a[-i - 1] * bi) % 2
	bi = bi * b % 2
print('odd' if sum2 % 2 == 1 else 'even')


(b, k) = map(int, input().split())
mass = list(map(int, input().split()))
tracker = 0
if b % 2 != 0:
	for i in range(len(mass)):
		if mass[i] % 2 != 0:
			tracker += 1
elif mass[k - 1] % 2 != 0:
	tracker += 1
if tracker % 2 == 0:
	print('even')
else:
	print('odd')


a = list(map(int, input().split()))
b = list(map(int, input().split()))
i = 0
e = 0
o = 0
if a[0] % 2 == 0:
	if b[a[1] - 1] % 2 == 0:
		y = 'even'
		e += 1
	else:
		y = 'odd'
		o += 1
else:
	while i < a[1]:
		if b[i] % 2 == 0:
			y = 'even'
			e += 1
		else:
			y = 'odd'
			o += 1
		i += 1
if o % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
bo = b & 1
if bo:
	co = 0
	for i in range(k):
		if a[i] & 1:
			co += 1
	if co & 1:
		print('odd')
	else:
		print('even')
elif a[-1] & 1:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = [int(i) for i in input().split()]
if b % 2 == 1:
	s = sum(a)
	if s % 2 == 1:
		print('odd')
	else:
		print('even')
elif a[-1] % 2 == 1:
	print('odd')
else:
	print('even')


def main():
	(b, k) = [int(a) for a in input().split()]
	ais = [int(a) for a in input().split()]
	if b % 2 == 0:
		if ais[-1] % 2 == 1:
			print('odd')
		else:
			print('even')
	elif sum(ais) % 2 == 1:
		print('odd')
	else:
		print('even')
main()


X = list(map(int, input().split()))
A = list(map(int, input().split()))
if X[1] == 1 and X[0] == 1:
	print('even')
	exit()
Answer = 'even' if A[-1] % 2 == 0 else 'odd'
for i in range(len(A) - 2, -1, -1):
	if X[0] * A[i] % 2 == 0:
		Answer = 'even' if Answer == 'even' else 'odd'
	else:
		Answer = 'odd' if Answer == 'even' else 'even'
print(Answer)


from functools import lru_cache

@lru_cache(maxsize=10000)
def power(x: int, exp: int):
	if exp == 0:
		return 1
	if exp == 1:
		return x
	tmp = power(x, exp // 2)
	res = tmp * tmp
	if exp % 2 == 1:
		res *= x
	return res
s = input()
(b, k) = (int(x) for x in s.split())
s = input()
a = [int(x) for x in s.split()]
s = 0
b_is_odd = b & 1 == 1
for i in range(len(a) - 1):
	if a[i] & 1 and b_is_odd:
		s += a[i] % 2 * b % 2
s += a[-1]
if s % 2 == 1:
	print('odd')
else:
	print('even')


def parity(b, k, dig):
	if b % 2 == 0:
		if dig[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	elif sum(map(lambda x: x % 2, dig)) % 2 == 0:
		print('even')
	else:
		print('odd')
(b, k) = list(map(int, input().split()))
dig = list(map(int, input().split()))
parity(b, k, dig)


def main():
	(b, k) = (int(i) for i in input().split())
	a = [int(i) for i in input().split()]
	a = a[::-1]
	total = sum((val * b ** idx for (idx, val) in enumerate(a)))
	print('even') if total % 2 == 0 else print('odd')

def main2():
	(b, k) = (int(i) for i in input().split())
	a = [int(i) for i in input().split()]
	if b % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	else:
		total = sum(a)
		print('even') if total % 2 == 0 else print('odd')
main2()


[b, k] = list(map(int, input().split(' ')))
a = list(map(int, input().split(' ')))
l = a.pop()
s = sum(a)
r = (s % 2 * (b % 2) + l % 2) % 2
print('even' if r == 0 else 'odd')


(b, k) = map(int, input().split())
dig = list(map(int, input().split()))
dig.reverse()
even = True
for i in dig:
	if b % 2 == 0:
		if i % 2 != 0:
			even = False
		break
	elif i % 2 != 0:
		even = not even
if even:
	print('even')
else:
	print('odd')


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
b_odd = b % 2
sum = 0
for i in range(k - 1):
	sum += a[i] * b_odd
sum += a[k - 1]
if sum % 2:
	print('odd')
else:
	print('even')


def main():
	inpu = input().split(' ')
	b = int(inpu[0])
	k = int(inpu[1])
	inpu2 = input().split(' ')
	summa = 0
	if b % 2 == 0:
		if int(inpu2[-1]) % 2 != 0:
			summa += 1
	else:
		for num in inpu2:
			k -= 1
			if int(num) % 2 != 0:
				summa += 1
	if summa % 2 == 0:
		print('even')
	else:
		print('odd')
main()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
c = len([0 for i in a if i % 2])
o = b % 2 == 0 and a[-1] % 2 or (b % 2 and c % 2)
print('odd' if o else 'even')


(b, k) = map(int, input().split())
bp = b % 2
total = 0
arr = list(map(int, input().split()))
for i in range(k - 1):
	total += arr[i] % 2 & bp
total += arr[-1] % 2
print('eovdedn'[total % 2::2])


b = k = s = 0
ans = ''
(b, k) = input().split()
b = int(b)
k = int(k)
nums = list(map(int, input().split()))
if b % 2 == 0 and nums[k - 1] % 2 == 0:
	ans = 'even'
elif b % 2 == 0 and nums[k - 1] % 2 != 0:
	ans = 'odd'
else:
	for i in nums:
		s = s + i
	if s % 2 == 0:
		ans = 'even'
	else:
		ans = 'odd'
print(ans)


(b, k) = map(int, input().split())
a = [int(x) for x in input().split()]
(countEven, countOdd) = (0, 0)
bol = b % 2 is 0
for x in range(k - 1):
	if a[x] % 2 is 0:
		countEven += 1
	elif bol:
		pass
	else:
		countOdd += 1
if a[-1] % 2 != 0:
	countOdd += 1
if countOdd % 2 is 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split(' '))
a = list(map(int, input().split(' ')))
i = 0
ans = []
while i < len(a) - 1:
	sum1 = a[i] * b
	ans.append(sum1)
	i = i + 1
if (sum(ans) + a[len(a) - 1]) % 2 == 0:
	print('even')
else:
	print('odd')


import sys
(b, k) = [int(tmp) for tmp in sys.stdin.readline().split()]
a = [int(tmp) for tmp in sys.stdin.readline().split()]
even = -1
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		even = True
	else:
		even = False
else:
	even = sum(a) % 2 == 0
print('even' if even else 'odd')


t = [int(i) for i in input().split()]
(b, k) = (t[0], t[1])
inp = [int(i) for i in input().split()]
lis = [i for i in inp if i % 2 != 0]
if b % 2 == 0:
	a = b + inp[-1]
else:
	a = b * len(lis)
if a % 2 == 0:
	print('even')
else:
	print('odd')


def parseInt(s):
	return int(s)

def c():
	arrlen = list(map(parseInt, input().split()))
	arr = list(map(parseInt, input().split()))
	sde = sum(arr) % 2 is 0
	be = arrlen[0] % 2 is 0
	lde = arr[-1] % 2 is 0
	if be and lde or (sde and (not be)):
		print('even')
	else:
		print('odd')
c()


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	tot = 0
	for guy in a:
		if guy % 2 == 1:
			tot += 1
	if tot % 2 == 0:
		print('even')
	else:
		print('odd')


import sys
from math import *

def minp():
	return sys.stdin.readline().strip()

def mint():
	return int(minp())

def mints():
	return list(map(int, minp().split()))
(b, k) = mints()
z = 0
for i in mints():
	z = z * b + i
	z = z & 1
if z == 0:
	print('even')
else:
	print('odd')


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()][::-1]
r = 0 if b & 1 else a[0] & 1
if b & 1:
	for x in a:
		r ^= 1 & x & b
print('odd' if r else 'even')


(b, k) = [int(x) for x in input().split()]
a = list(reversed([int(x) for x in input().split()]))
s = a[0] % 2
for i in range(1, len(a)):
	s += a[i] % 2 * b % 2
	s %= 2
if s % 2 == 0:
	print('even')
else:
	print('odd')


import sys
input = sys.stdin.readline
(n, k) = [int(i) for i in input().split()]
a = [int(i) for i in input().split()]
if n % 2:
	if sum(a) % 2:
		print('odd')
	else:
		print('even')
elif a[-1] % 2:
	print('odd')
else:
	print('even')


t = list(map(int, input().split(' ')))
b = t[0]
k = t[1]
a = list(map(int, input().split(' ')))
if b % 2 == 0:
	if a[k - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	n = 0
	for i in range(k - 1):
		if a[i] % 2 != 0:
			n = n + 1
	if n % 2 == 0:
		if a[k - 1] % 2 == 0:
			print('even')
		else:
			print('odd')
	elif a[k - 1] % 2 == 0:
		print('odd')
	else:
		print('even')


def solve():
	(b, k) = map(int, input().split())
	a = list(map(int, input().split()))
	if b % 2 == 0:
		if a[k - 1] % 2 == 0:
			print('even')
			return
		else:
			print('odd')
			return
	else:
		m = 0
		for i in range(k - 1):
			if a[i] % 2 != 0:
				m += 1
		if m % 2 == 0:
			if a[k - 1] % 2 == 0:
				print('even')
				return
			else:
				print('odd')
				return
		elif a[k - 1] % 2 == 0:
			print('odd')
			return
		else:
			print('even')
			return
solve()


(lambda b, k, n, N: [[N.__setitem__(0, N[0] * b + i & 1) for i in n], print('odd' if N[0] else 'even')])(*map(int, input().split()), list(map(int, input().split())), [0])


(b_num, k_num) = map(int, input().split(' '))
a_list = list(map(int, input().split(' ')))
is_b_even = b_num % 2 == 0
f_list = []
for i in range(k_num - 1):
	num = a_list[i]
	is_even = num % 2 == 0
	if is_b_even and is_even:
		f_list.append(True)
	elif not is_b_even and (not is_even):
		f_list.append(False)
	else:
		f_list.append(True)
f_list.append(a_list[len(a_list) - 1] % 2 == 0)
ans = f_list[0]
for i in range(1, k_num):
	if ans and f_list[i]:
		ans = True
	elif not ans and (not f_list[i]):
		ans = True
	else:
		ans = False
print('even' if ans else 'odd')


(b, k) = map(int, input().split())
var = list(map(int, input().split()))
if b % 2 == 0:
	if var[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	ss = sum(var)
	if ss % 2 == 0:
		print('even')
	else:
		print('odd')


f = lambda : map(int, input().split())
(b, k) = f()
s = [*f()]
print('eovdedn'[(sum(s[:-1]) * b + s[-1]) % 2::2])


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = 0
for i in range(len(a) - 1):
	if a[i] % 2 == 1 and n % 2 == 1:
		ans += 1
if a[-1] % 2 == 1:
	ans += 1
if ans % 2:
	print('odd')
else:
	print('even')


def main():
	(b, k) = map(int, input().split())
	a = list(map(int, input().split()))
	a.reverse()
	ret = 0
	for i in range(k):
		temp = 0
		if i == 0:
			temp = 1
		else:
			temp = b % 2
		ret = (ret + a[i] * temp) % 2
	if ret % 2:
		print('odd')
	else:
		print('even')
main()


(b, k) = map(int, input().split())
arr = list(map(int, input().split()))
if b % 2 == 0:
	if arr[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = len(list(filter(lambda x: x % 2 != 0, arr)))
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


def main():
	[b, k] = list(map(int, input().split(' ')))
	ar = list(map(int, input().split(' ')))
	if b % 2 == 0:
		if ar[k - 1] % 2 == 0:
			print('even')
			return
		elif ar[k - 1] % 2 != 0:
			print('odd')
			return
	elif b % 2 != 0:
		sumVal = sum(ar[:k - 1])
		if sumVal % 2 == 0:
			if ar[k - 1] % 2 == 0:
				print('even')
				return
			elif ar[k - 1] % 2 != 0:
				print('odd')
				return
		elif sumVal % 2 != 0:
			if ar[k - 1] % 2 == 0:
				print('odd')
				return
			elif ar[k - 1] % 2 != 0:
				print('even')
				return
	return
main()


(base, length) = [int(i) for i in input().split()]
n = [int(i) for i in input().split()]
if not base % 2:
	print('odd' if n[-1] % 2 else 'even')
else:
	even = True
	for i in range(length):
		bl = not bool(n[i] % 2)
		even = even is bl
	print('even' if even else 'odd')


(b, k) = list(map(int, input().split()))
l = list(map(int, input().split()))
o = 0
for i in l:
	if i & 1:
		o += 1
if b & 1 and o & 1:
	print('odd')
elif b & 1 == 0 and l[-1] & 1:
	print('odd')
else:
	print('even')


(b, k) = list(map(int, input().strip().split()))
l = list(map(int, input().strip().split()))
if b % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	o = 0
	for x in l:
		if x % 2 == 1:
			o += 1
	if o % 2 == 0:
		print('even')
	else:
		print('odd')


def modulo(a, b, c):
	x = 1
	y = a
	while b > 0:
		if b & 1:
			x = x * y % c
		y = y * y % c
		b = b // 2
	return x % c
(b, k) = map(int, input().split())
d = list(map(int, input().split()))
s = 0
for i in range(k):
	tmp = d[k - 1 - i] * modulo(b, i, 2) % 2
	s = (s + tmp) % 2
if s == 0:
	print('even')
else:
	print('odd')


(n, m) = map(int, input().split())
a = list(map(int, input().split()))
a.reverse()
ans = 0
for i in range(m):
	ans += a[i] % 10 * pow(n, i, 10) % 10
	ans = ans % 10
if ans % 2:
	print('odd')
else:
	print('even')


(b, k) = [int(x) for x in input().split()]
arr = [int(x) for x in input().split()]
arr = arr[::-1]
curr = 1
ans = 0
for i in range(k):
	ans += arr[i] * curr
	curr *= b
	ans %= 2
	curr %= 2
print('even' if ans % 2 == 0 else 'odd')


(k, n) = [int(y) for y in input().split(' ')]
a = [int(y) for y in input().split(' ')]
if k % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	c = 0
	for j in a:
		if j % 2 == 1:
			c = c + 1
	if c % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
tmp = sum([i % 2 * (b % 2) for i in a[:-1]]) + a[-1] % 2
if tmp % 2 == 0:
	print('even')
elif tmp % 2 == 1:
	print('odd')
else:
	print('wtf')


(b, n) = map(int, input().split())
a = list(map(int, input().split()))
odds = 0
for i in range(n - 1):
	if b * a[i] % 2 != 0:
		odds += 1
if a[n - 1] % 2 != 0:
	odds += 1
if odds % 2 == 0:
	print('even')
else:
	print('odd')


input0 = input()
input1 = input()
base = 0
temp = ''
for c in input0:
	if c == ' ':
		base = int(temp)
		break
	else:
		temp += c
length = int(temp)
listNumbers = []
tempC = ''
for c in input1:
	if c == ' ':
		listNumbers.append(int(tempC))
		tempC = ''
	else:
		tempC += c
listNumbers.append(int(tempC))
suma = 0
for num in listNumbers:
	suma += num
sde = suma % 2 == 0
be = base % 2 == 0
lde = listNumbers[-1] % 2 == 0
if sde and be and lde:
	print('even')
elif sde and be and (not lde):
	print('odd')
elif sde and (not be) and lde:
	print('even')
elif sde and (not be) and (not lde):
	print('even')
elif not sde and be and lde:
	print('even')
elif not sde and be and (not lde):
	print('odd')
elif not sde and (not be) and lde:
	print('odd')
elif not sde and (not be) and (not lde):
	print('odd')


import sys
(B, K) = map(int, sys.stdin.readline().rstrip().split(' '))
it = map(int, sys.stdin.readline().rstrip().split(' '))
arr = []
for i in it:
	arr.append(i)
b = B % 10
brr = [1]
now = 1
for i in range(1, len(arr)):
	now *= b
	now = now % 10
	if now % 2 == 1:
		brr.append(1)
	else:
		brr.append(0)
brr.reverse()
even = 0
odd = 0
for i in range(0, len(arr)):
	if arr[i] % 2 == 1:
		if brr[i] == 1:
			odd += 1
		else:
			even += 1
	else:
		even += 1
if odd % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
ans = 'even'
if b % 2:
	n = 0
	for i in range(k):
		n += a[i]
	if n % 2:
		ans = 'odd'
elif a[len(a) - 1] % 2:
	ans = 'odd'
print(ans)


in_arr = input().split()
(b, k) = (int(in_arr[0]), int(in_arr[1]))
in_arr = input().split()
a_arr = [int(x) for x in in_arr]
n = 0
if b % 2 == 0 and a_arr[-1] % 2 == 0:
	print('even')
	exit(0)
n = a_arr[-1]
n = n % 2
for i in range(1, k):
	n += a_arr[k - i - 1] * b
	n = n % 2
if n % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
coefs = [int(x) for x in input().split()]
(impar, par) = (0, 0)
for itr in range(0, k - 1):
	if coefs[itr] * b % 2 == 0:
		par += 1
	else:
		impar += 1
if coefs[-1] % 2 == 0:
	par += 1
else:
	impar += 1
if impar % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a_values = list(map(int, input().split()))
if b % 2 == 0 and a_values[-1] % 2 == 0:
	print('even')
elif b % 2 == 0 and a_values[-1] % 2 != 0:
	print('odd')
else:
	odd_count = len([a_value for a_value in a_values if a_value % 2 != 0])
	if odd_count % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = (int(k) for k in input().split())
A = [int(k) for k in input().split()]

def OddOrEven(num1, num2):
	if num1 == num2:
		return True
	else:
		return False
B_Status = b % 2 == 0
Status = A[k - 1] % 2 == 0
for a in range(k - 1):
	temp = A[a] % 2 == 0
	if not temp and (not B_Status):
		Status = OddOrEven(Status, False)
	else:
		Status = OddOrEven(Status, True)
if Status:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
z = 0
for i in range(k):
	if a[i] % 2 == 1 and (b % 2 == 1 or k - 1 - i == 0):
		z += 1
if z % 2 == 1:
	print('odd')
else:
	print('even')


(b, k) = (int(x) for x in input().split())
a = [int(x) for x in input().split()]
if b % 2 == 0:
	print('even' if a[-1] % 2 == 0 else 'odd')
else:
	numOdd = False
	for x in a:
		numOdd += 1 if x % 2 == 1 else 0
	print('even' if numOdd % 2 == 0 else 'odd')


import sys
(b, k) = [int(x) for x in sys.stdin.readline().rstrip().split()]
listA = [int(x) for x in sys.stdin.readline().rstrip().split()]
if b % 2 == 0 and listA[-1] % 2 == 0:
	print('even')
elif b % 2 == 0 and listA[-1] % 2 == 1:
	print('odd')
else:
	countOdd = 0
	for x in listA:
		if x % 2 != 0:
			countOdd += 1
	if countOdd % 2 == 0:
		print('even')
	else:
		print('odd')


(b, k) = list(map(int, input().split()))
coeffs = list(map(int, input().split()))
even = True
for coeff in coeffs:
	if b % 2 == 0:
		even = coeff % 2 == 0
	else:
		even ^= coeff % 2
print('even' if even else 'odd')


(b, k) = [int(x) for x in input().split()]
a = [int(x) for x in input().split()]
odd = lambda x: x % 2 == 1
even = lambda x: x % 2 == 0
ans = lambda x: 'even' if even(x) else 'odd'
if even(b):
	print(ans(a[-1]))
else:
	odd_count = sum(map(odd, a))
	print(ans(odd_count))


from collections import Counter
(b, k) = tuple(map(int, input().split(' ')))
a = tuple(map(int, input().split(' ')))
if b % 2 == 0:
	print('odd' if a[-1] % 2 else 'even')
else:
	odds = 0
	for i in a:
		odds += 1 if i % 2 == 1 else 0
	print('odd' if odds % 2 else 'even')


(b, k) = map(int, input().split())
a = [int(elem) for elem in input().split()]
ans = 0
for i in range(k):
	if i != k - 1:
		if a[i] % 2 == 0 or b % 2 == 0:
			ans = ans
		elif ans == 1:
			ans = 0
		else:
			ans = 1
	elif a[i] % 2 == 0:
		ans = ans
	elif ans == 1:
		ans = 0
	else:
		ans = 1
if ans == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	ans = a[-1]
	a = a[:k - 1]
	a = list(filter(lambda x: x % 2 != 0, a))
	x = len(a)
	if ans % 2 != 0:
		x += 1
	if x % 2 != 0:
		print('odd')
	else:
		print('even')


(b, k) = map(int, input().split())
l = list(map(int, input().split()))
if k == 1:
	if l[0] % 2 == 0:
		print('even')
		exit()
	else:
		print('odd')
		exit()
elif b % 2 == 0 and l[-1] % 2 == 0:
	print('even')
	exit()
elif b % 2 == 0 and l[-1] % 2 != 0:
	print('odd')
	exit()
else:
	l1 = [1 for i in l if i % 2 != 0]
	if sum(l1) % 2 == 0:
		print('even')
		exit()
	else:
		print('odd')
		exit()


(b, k) = map(int, input().split())
od = 0
l = list(map(int, input().split()))
if b % 2 == 0:
	if l[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
	exit()
else:
	for i in range(k):
		if l[i] % 2 == 1:
			od += 1
	if od % 2 == 0:
		print('even')
	else:
		print('odd')


(a, b) = map(int, input().split())
s = map(int, input().split())
if a % 2 == 1:
	print('odd' if sum(s) % 2 == 1 else 'even')
else:
	print('odd' if list(s)[-1] % 2 == 1 else 'even')


(b, _) = map(int, input().split())
a = list(map(int, input().split()))[::-1]

def parity(n, k):
	if k == 0:
		return 1
	res = parity(n, k // 2) ** 2
	if k % 2 == 1:
		res *= n
	return 2 if res % 2 == 0 else 1
res = 0
for i in range(len(a)):
	res += parity(b, i) * a[i]
print('even' if res % 2 == 0 else 'odd')


(b, _) = map(int, input().split())
data = list(map(int, input().split()))
if b % 2 == 0:
	parity = data[-1] % 2
else:
	parity = sum(data) % 2
print(('even', 'odd')[parity])


import sys
from functools import lru_cache, cmp_to_key
from heapq import merge, heapify, heappop, heappush
from collections import defaultdict as dd, deque, Counter as C
from itertools import combinations as comb, permutations as perm
from bisect import bisect_left as bl, bisect_right as br, bisect
from time import perf_counter
from fractions import Fraction
sys.setrecursionlimit(int(pow(10, 6)))
mod = int(pow(10, 9) + 7)
mod2 = 998244353

def data():
	return sys.stdin.readline().strip()

def out(*var, end='\n'):
	sys.stdout.write(' '.join(map(str, var)) + end)

def l():
	return list(sp())

def sl():
	return list(ssp())

def sp():
	return map(int, data().split())

def ssp():
	return map(str, data().split())

def l1d(n, val=0):
	return [val for i in range(n)]

def l2d(n, m, val=0):
	return [l1d(n, val) for j in range(m)]
for _ in range(1):
	(b, k) = l()
	A = l()
	ans = 0
	for i in range(1, k + 1):
		ans = (ans + A[i - 1] * pow(b, k - i, 2)) % 2
	if ans == 0:
		print('even')
	else:
		print('odd')


(b, k) = [int(x) for x in input().split(' ')]
ns = [int(x) for x in input().split(' ')]
odds = 0
ns.reverse()
if b % 2 == 0:
	odds = ns[0] % 2
else:
	for i in ns:
		if i % 2 == 1:
			odds = (odds + 1) % 2
if odds == 1:
	print('odd')
else:
	print('even')


(a, b) = map(int, input().split())
x = [int(a) for a in input().split()]
if a & 1 == 1:
	ans = sum(x) & 1
else:
	ans = x[-1] & 1
if ans == 0:
	print('even')
else:
	print('odd')


(b, n) = list(map(int, input().split()))
c = b % 2
l = list(map(int, input().split()))
if c == 0:
	a = l[-1] % 2
else:
	a = sum(l) % 2
print('even' if a == 0 else 'odd')


from sys import stdin
(b, k) = map(int, stdin.readline().strip().split())
s = list(map(int, stdin.readline().strip().split()))
p = b % 2 == 0
if k > 1:
	imp = not p and s[0] % 2 != 0
else:
	imp = s[0] % 2 != 0
for i in range(1, k):
	if i != k - 1:
		imp1 = not p and s[i] % 2 != 0
	else:
		imp1 = not s[i] % 2 == 0
	if imp1 != imp:
		imp = True
	else:
		imp = False
if imp:
	print('odd')
else:
	print('even')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
s = a[-1]
for i in range(k - 1):
	s += b * a[i]
if s & 1 == 1:
	print('odd')
else:
	print('even')


import copy
import fractions
import itertools
import numbers
import string
import sys

def to_basex(num, x):
	while num > 0:
		yield (num % x)
		num //= x

def from_basex(it, x):
	ret = 0
	p = 1
	for d in it:
		ret += d * p
		p *= x
	return ret

def core():
	(b, k) = [int(x) for x in input().split()]
	a = [int(x) for x in input().split()]
	a.reverse()
	num = 0
	while a:
		num *= b
		num += a.pop()
		num %= 2
	print('even' if num == 0 else 'odd')
core()


mn = input().split()
b = int(mn[0])
k = int(mn[1]) - 1
a = list(map(int, input().rstrip().split()))

def parity(b, a):
	if b % 2 == 0:
		if a[-1] % 2 == 0:
			print('even')
		else:
			print('odd')
	else:
		base = 1
		res = 0
		for n in a:
			if n % 2 == 0:
				num = 0
			else:
				num = 1
			cur = base and num
			res = cur != res
		if res:
			print('odd')
		else:
			print('even')
parity(b, a)


arr = [int(x) for x in input().split()]
n = arr[0]
k = arr[1]
arr = [int(x) for x in input().split()]
impar = 0
ultimopar = False
for i in arr:
	if i % 2 == 1:
		impar = impar + 1
if arr[k - 1] % 2 == 1:
	impar = impar - 1
	ultimopar = True
if impar % 2 == 1 and n % 2 == 1:
	if ultimopar:
		print('even')
	else:
		print('odd')
elif ultimopar:
	print('odd')
else:
	print('even')


str = input()
mas = str.split(' ')
x = int(mas[0])
y = int(mas[1])
str = input().split(' ')
mas = []
for i in range(y):
	mas.append(int(str[i]))
if x % 2 == 0:
	if mas[len(mas) - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
elif sum(mas) % 2 == 0:
	print('even')
else:
	print('odd')


(b, k) = map(int, input().split())
a = list(map(int, input().split()))
av = 0
ans = ''
cnt = 0
acnt = 0
if b % 2 == 1:
	av = 1
for i in range(len(a) - 1):
	if a[i] % 2 == 1 and av == 1:
		cnt += 1
if a[-1] % 2 == 1:
	cnt += 1
if cnt % 2 == 0:
	print('even')
	exit()
print('odd')


(b, k) = map(int, input().split())
e = 0
ek = b % 2
for c in map(int, input().split()):
	e = (e + ek * (int(c) % 2)) % 2
if b % 2 == 0:
	e = int(c) % 2
print('odd' if e else 'even')


I = lambda : map(int, input().split())
(b, _) = I()
A = list(I())
n = (sum(A) if b % 2 else A[-1]) % 2
print(('even', 'odd')[n])


from bisect import bisect_right as br
from bisect import bisect_left as bl
from collections import defaultdict
from itertools import *
import functools
import sys
import math
MAX = sys.maxsize
MAXN = 10 ** 6 + 10
MOD = 10 ** 9 + 7

def isprime(n):
	n = abs(int(n))
	if n < 2:
		return False
	if n == 2:
		return True
	if not n & 1:
		return False
	for x in range(3, int(n ** 0.5) + 1, 2):
		if n % x == 0:
			return False
	return True

def mhd(a, b, x, y):
	return abs(a - x) + abs(b - y)

def numIN():
	return map(int, sys.stdin.readline().strip().split())

def charIN():
	return sys.stdin.readline().strip().split()
t = [0] * 1000010

def create(a, n):
	global t
	for i in range(n, 2 * n):
		t[i] = a[i - n]
	for i in range(n - 1, 0, -1):
		t[i] = t[2 * i] + t[2 * i + 1]

def ncr(n, k):
	res = 1
	c = [0] * (k + 1)
	c[0] = 1
	for i in range(1, n + 1):
		for j in range(min(i, k), 0, -1):
			c[j] = (c[j] + c[j - 1]) % MOD
	return c[k]
(b, k) = numIN()
a = list(numIN())[::-1]
if b % 2:
	f = 1
else:
	f = 0
ans = ['even', 'odd']
if f:
	print(ans[sum(a) % 2])
else:
	print(ans[a[0] % 2])


(b, k) = list(map(int, input().split()))
A = list(map(int, input().split()))
if b % 2 == 0:
	if A[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	count = 0
	for Ai in A:
		count += Ai % 2
	if count % 2 == 0:
		print('even')
	else:
		print('odd')


arr = list(map(int, input().strip().split()))
b = arr[0]
k = arr[1]
a = list(map(int, input().strip().split()))
odds = 0
if b % 2 == 0:
	if a[-1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	for i in a:
		if i % 2 != 0:
			odds += 1
	if odds % 2 == 0:
		print('even')
	else:
		print('odd')


entrada = input()
(b, k) = (int(entrada.split()[0]), int(entrada.split()[1]))
a = input()
a = [int(x) for x in a.split()]
exps = range(k)[::-1]
tot = 0
for i in range(k - 1):
	tot += b * a[i]
tot += a[k - 1]
res = 'even'
if tot % 2 == 1:
	res = 'odd'
print(res)


(b, k) = map(int, input().split())
A = list(map(int, input().split()))
C = 0
Z = 10

def power(x, y, p):
	res = 1
	x = x % p
	while y > 0:
		if y & 1 == 1:
			res = res * x % p
		y = y >> 1
		x = x * x % p
	return res
for i in range(len(A)):
	x = power(b, k - 1, Z)
	C += A[i] * x
	k -= 1
if C % 2 == 0:
	print('even')
else:
	print('odd')


def input_ints():
	return list(map(int, input().split()))

def main():
	(b, k) = input_ints()
	b %= 2
	a = input_ints()
	ans = 0
	for x in a:
		ans = (ans * b + x) % 2
	print('even' if ans == 0 else 'odd')
main()


(b, k) = tuple(map(int, input().split()))
a = list(map(lambda x: int(x) % 2, input().split()))
print('odd' if b % 2 == 0 and a[k - 1] == 1 or (b % 2 == 1 and sum(a) % 2 == 1) else 'even')


bk = list(map(int, input().split()))
a = list(map(int, input().split()))
if bk[0] % 2 == 0:
	if a[bk[1] - 1] % 2 == 0:
		print('even')
	else:
		print('odd')
else:
	odd = 0
	for i in range(bk[1]):
		if a[i] % 2 == 1:
			odd += 1
	if odd % 2 == 0:
		print('even')
	else:
		print('odd')


(n, k) = map(int, input().split())
a = list(map(int, input().split()))
b = [i for i in a if i % 2 == 1]
if k == 1:
	if a[0] % 2 == 0:
		print('even')
	else:
		print('odd')
	exit()
if n % 2 == 0 and a[-1] % 2 == 1:
	print('odd')
	exit()
if n % 2 == 0 and a[-1] % 2 == 0:
	print('even')
	exit()
if len(b) % 2 == 0:
	print('even')
else:
	print('odd')


import math
import sys
DEBUG = False

def inp():
	return sys.stdin.readline().rstrip()

def dprint(*value, sep=' ', end='\n'):
	if DEBUG:
		print(*value, sep=sep, end=end)

def solve(B, K, A):
	A.reverse()
	v = 0
	d = 1
	for a in A:
		v += a * d
		v %= 2
		d *= B
		d %= 2
	return v

def main():
	(B, K) = [int(e) for e in inp().split()]
	A = [int(e) for e in inp().split()]
	print('even' if solve(B, K, A) == 0 else 'odd')
main()