def largest_prime_factor(N):
    for i in range(2,1000):
        #print(i)
        if N%i == 0:
            return N/i
    return N
  

M = int(input())
T = 13090205643631553649901988478632101527080421043419719290



if T % M % 2 == 0:
  print("even")
else:
  print("odd")