#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,popcnt,abm,mmx,tune=native")
#pragma GCC optimize("fast-math")
using namespace std;
inline void ForSpeed() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
const int MAXN = int(1e5 + 5);
const int inf = 1e9 + 7;
const int MOD = 998244353;
const long long INF = (1e18 + 7);
long long b, k, a[MAXN];
int main() {
  ForSpeed();
  cin >> b >> k;
  for (int i = 0; i < k; i++) {
    cin >> a[i];
  }
  if (k == 1) {
    if (a[0] % 2 != 0 && b % 2 != 0) {
      cout << "odd";
      return 0;
    }
  }
  if (b % 2 == 0 && a[k - 1] % 2 == 0) {
    cout << "even";
    return 0;
  } else if (b % 2 == 0 && a[k - 1] % 2 != 0) {
    cout << "odd";
    return 0;
  }
  long long ch = 0;
  if (a[0] % 2 == 0) {
    ch = 1;
  }
  for (int i = 1; i < k - 1; i++) {
    if (ch == 0 && a[i] % 2 != 0) {
      ch = 1;
    } else if (ch == 1 && a[i] % 2 == 0) {
      continue;
    } else {
      ch = 0;
    }
  }
  if (ch == 1 && a[k - 1] % 2 == 0) {
    cout << "even";
  } else if (ch == 0 && a[k - 1] % 2 != 0) {
    cout << "even";
  } else {
    cout << "odd";
  }
  return 0;
}
