#include <bits/stdc++.h>
using namespace std;
clock_t TimeBegin, TimeEnd;
long long const INF = 1e18;
inline long long mod(string num, long long Base);
inline long long diMod(long long A, long long B, long long Base);
inline long long fpow(long long a, long long x, long long Base);
inline void Tstart();
inline void Tstop();
long long n = 0, b, k, a;
void Solve() {
  cin >> b >> k;
  for (long long i = (k - 1); i >= (0); --i) {
    cin >> a;
    n = (n + ((a % 2) * fpow(b, i, 2)) % 2) % 2;
  }
  cout << (n & 1 ? "odd" : "even");
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  Solve();
  return 0;
}
inline long long mod(string num, long long Base) {
  long long res = 0;
  for (long long i = 0; i < (num.length()); ++i)
    res = (res * 10 + (long long)num[i] - '0') % Base;
  return res;
}
inline long long fpow(long long a, long long x, long long Base) {
  if (x == 0) return 1;
  if (x & 1) {
    return a * fpow(a, x - 1, Base) % Base;
  } else {
    long long t = fpow(a, x / 2, Base);
    return t * t % Base;
  }
}
inline long long diMod(long long A, long long B, long long Base) {
  long long result = (A * fpow(B, Base - 2, Base)) % Base;
  return result;
}
inline void Tstart() { TimeBegin = clock(); }
inline void Tstop() {
  TimeEnd = clock();
  cout << "\nTime elapsed: " << 1000 * (TimeEnd - TimeBegin) / CLOCKS_PER_SEC
       << " ms\n";
}
