#include <bits/stdc++.h>
using namespace std;
const int MAXN = -1;
int b, k;
vector<int> A;
int main() {
  while (scanf("%d %d", &b, &k) >= 1) {
    long long mul = 1;
    A.resize(k);
    for (int i = (0); i < (int)(k); i++) scanf("%d", &A[i]);
    reverse(A.begin(), A.end());
    long long ans = 0;
    for (int i = (0); i < (int)(k); i++) {
      ans = (ans + mul * A[i]) % 2;
      mul = mul * b % 2;
    }
    cout << (ans == 0 ? "even" : "odd") << endl;
  }
  return 0;
}
