#include <bits/stdc++.h>
using namespace std;
int t, values[100001], v[100001], sizze, b, k, lastDigit;
bitset<100001> found;
int main() {
  ios ::sync_with_stdio(0);
  cin.tie(0);
  cin >> b >> k;
  for (int i = 1; i <= k; i++) cin >> values[i];
  int x = b;
  found[b % 10] = 1;
  v[0] = 1;
  v[++sizze] = b % 10;
  while (true) {
    x = (x % 10) * (b % 10) % 10;
    if (!found[x])
      found[x] = 1, v[++sizze] = x;
    else
      break;
  }
  for (int i = 1; i <= k; i++)
    if ((k - i) % sizze == 0 && k - i)
      lastDigit = (lastDigit + (v[sizze] * values[i])) % 10;
    else
      lastDigit = (lastDigit + (v[(k - i) % sizze] * values[i])) % 10;
  if (lastDigit % 2)
    cout << "odd\n";
  else
    cout << "even\n";
  return 0;
}
