#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
template <typename T1, typename T2>
ostream& operator<<(ostream& os, const pair<T1, T2> p) {
  os << '{' << p.first << ", " << p.second << '}';
  return os;
}
template <typename T>
inline void showArray(T* it1, T* it2) {
  cout << "{ ";
  while (it1 != it2) {
    cout << *it1++ << ' ';
  }
  cout << " }" << endl;
}
inline int readInt() {
  int n;
  char c = getchar(), k = '+';
  if (c == '-') {
    k = '-';
  } else {
    n = c - '0';
  }
  c = getchar();
  while (c != ' ' && c != '\n') {
    n = n * 10 + c - '0';
    c = getchar();
  }
  if (k == '-') {
    n = -n;
  }
  return n;
}
inline void printInt(int n) {
  if (n < 0) {
    putchar('-');
    n = -n;
  }
  char st[10], *p;
  p = st + 10;
  while (n) {
    *(--p) = (n % 10) + '0';
    n /= 10;
  }
  if (p == st + 10) {
    *(--p) = '0';
  }
  while (p != st + 10) {
    putchar(*p++);
  }
}
const bool debug = false;
const int MAXN = 3e5 + 2, INF = 1e9, p = 998244353, g = 3;
const double pi = acos(-1), eps = 1e-9;
int b, n, a[MAXN];
int main() {
  scanf("%d %d", &b, &n);
  int ans = 0;
  b %= 2;
  for (int i = 0; i < n - 1; ++i) {
    scanf("%d", &a[i]);
    ans += (a[i] % 2) * b;
    ans %= 2;
  }
  scanf("%d", &a[n - 1]);
  ans += (a[n - 1] % 2);
  ans %= 2;
  if (ans) {
    printf("odd\n");
  } else {
    printf("even\n");
  }
  return 0;
}
