#include <bits/stdc++.h>
using namespace std;
long long i, j, n, k, ans = 0, A, B, x = 1, xx, ar[300005];
long long bigmod(long long b, long long p, long long m) {
  if (b == 0) return 0;
  long long x, power;
  x = 1;
  power = b % m;
  while (p) {
    if (p % 2 == 1) x = (x * power) % m;
    power = (power * power) % m;
    p = p / 2;
  }
  return x;
}
int main() {
  cin >> n >> k;
  for (i = 0; i < k; i++) cin >> ar[i];
  for (i = 0; i < k; i++) {
    x = bigmod(n, k - i - 1, 2);
    x = (ar[i] * x) % 2;
    ans = (ans + x) % 2;
  }
  if (ans)
    cout << "odd" << endl;
  else
    cout << "even" << endl;
  return 0;
}
