#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
bool isprime(long long int x) {
  for (long long int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
long long int modpow(long long int x, long long int y) {
  x %= 1000000007;
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res *= x % 1000000007;
    y = y >> 1;
    x = x * x % 1000000007;
  }
  return res % 1000000007;
}
long long int ncr(long long int n, long long int k) {
  long long int res = 1;
  if (k > n - k) k = n - k;
  for (long long int i = 0; i < (long long int)k; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long int bintodec(long long int n) {
  long long int decimal = 0, i = 0, rem;
  while (n != 0) {
    rem = n % 10;
    n /= 10;
    decimal += rem * pow(2, i);
    ++i;
  }
  return decimal;
}
void create(vector<long long int> graph[], long long int n, long long int m) {
  long long int a, b;
  while (m--) {
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
}
void createweighted(vector<pair<long long int, long long int> > pp[],
                    long long int n, long long int m) {
  long long int a, b, wt;
  while (m--) {
    cin >> a >> b >> wt;
    pp[a].push_back(make_pair(b, wt));
    pp[b].push_back(make_pair(a, wt));
  }
}
void printweighted(vector<pair<long long int, long long int> > pp[],
                   long long int n) {
  long long int v, w;
  for (long long int i = 0; i < (long long int)n; i++) {
    cout << i;
    for (auto it = pp[i].begin(); it != pp[i].end(); it++) {
      v = it->first;
      w = it->second;
      cout << "->" << v << " :" << w;
    }
    cout << '\n';
  }
}
void print(vector<long long int> graph[], long long int n, long long int m) {
  for (long long int i = 0; i < (long long int)n; i++) {
    cout << i;
    for (auto it : graph[i]) cout << "->" << it;
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int i, k, b, aa;
  vector<long long int> a;
  long long int s = 0;
  cin >> b >> k;
  bool f = false;
  for (long long int i = 0; i < (long long int)k; i++) {
    cin >> aa;
    if (aa % 2 == 1) s++;
    a.push_back(aa);
  }
  long long int y = 2;
  if (b % 2 == 0) {
    long long int x = a[a.size() - 1];
    x % 2 == 0 ? cout << "even" : cout << "odd";
  } else {
    s % 2 == 0 ? cout << "even" : cout << "odd";
  }
  return 0;
}

### Prompt

Construct a cpp code solution to the problem outlined:

You are given an integer n (n ≥ 0) represented with k digits in base (radix) b. So,

$$$n = a_1 ⋅ b^{k-1} + a_2 ⋅ b^{k-2} + … a_{k-1} ⋅ b + a_k.$$$

For example, if b=17, k=3 and a=[11, 15, 7] then n=11⋅17^2+15⋅17+7=3179+255+7=3441.

Determine whether n is even or odd.

Input

The first line contains two integers b and k (2≤ b≤ 100, 1≤ k≤ 10^5) — the base of the number and the number of digits.

The second line contains k integers a_1, a_2, …, a_k (0≤ a_i < b) — the digits of n.

The representation of n contains no unnecessary leading zero. That is, a_1 can be equal to 0 only if k = 1.

Output

Print "even" if n is even, otherwise print "odd".

You can print each letter in any case (upper or lower).

Examples

Input

13 3
3 2 7


Output

even


Input

10 9
1 2 3 4 5 6 7 8 9


Output

odd


Input

99 5
32 92 85 74 4


Output

odd


Input

2 2
1 0


Output

even

Note

In the first example, n = 3 ⋅ 13^2 + 2 ⋅ 13 + 7 = 540, which is even.

In the second example, n = 123456789 is odd.

In the third example, n = 32 ⋅ 99^4 + 92 ⋅ 99^3 + 85 ⋅ 99^2 + 74 ⋅ 99 + 4 = 3164015155 is odd.

In the fourth example n = 2.

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  return b == 0 ? a : gcd(b, a % b);
}
long long int lcm(long long int a, long long int b) {
  return (a * b) / gcd(a, b);
}
bool isprime(long long int x) {
  for (long long int i = 2; i <= sqrt(x); i++) {
    if (x % i == 0) return false;
  }
  return true;
}
long long int modpow(long long int x, long long int y) {
  x %= 1000000007;
  long long int res = 1;
  while (y > 0) {
    if (y & 1) res *= x % 1000000007;
    y = y >> 1;
    x = x * x % 1000000007;
  }
  return res % 1000000007;
}
long long int ncr(long long int n, long long int k) {
  long long int res = 1;
  if (k > n - k) k = n - k;
  for (long long int i = 0; i < (long long int)k; i++) {
    res *= (n - i);
    res /= (i + 1);
  }
  return res;
}
long long int bintodec(long long int n) {
  long long int decimal = 0, i = 0, rem;
  while (n != 0) {
    rem = n % 10;
    n /= 10;
    decimal += rem * pow(2, i);
    ++i;
  }
  return decimal;
}
void create(vector<long long int> graph[], long long int n, long long int m) {
  long long int a, b;
  while (m--) {
    cin >> a >> b;
    graph[a].push_back(b);
    graph[b].push_back(a);
  }
}
void createweighted(vector<pair<long long int, long long int> > pp[],
                    long long int n, long long int m) {
  long long int a, b, wt;
  while (m--) {
    cin >> a >> b >> wt;
    pp[a].push_back(make_pair(b, wt));
    pp[b].push_back(make_pair(a, wt));
  }
}
void printweighted(vector<pair<long long int, long long int> > pp[],
                   long long int n) {
  long long int v, w;
  for (long long int i = 0; i < (long long int)n; i++) {
    cout << i;
    for (auto it = pp[i].begin(); it != pp[i].end(); it++) {
      v = it->first;
      w = it->second;
      cout << "->" << v << " :" << w;
    }
    cout << '\n';
  }
}
void print(vector<long long int> graph[], long long int n, long long int m) {
  for (long long int i = 0; i < (long long int)n; i++) {
    cout << i;
    for (auto it : graph[i]) cout << "->" << it;
    cout << '\n';
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  long long int i, k, b, aa;
  vector<long long int> a;
  long long int s = 0;
  cin >> b >> k;
  bool f = false;
  for (long long int i = 0; i < (long long int)k; i++) {
    cin >> aa;
    if (aa % 2 == 1) s++;
    a.push_back(aa);
  }
  long long int y = 2;
  if (b % 2 == 0) {
    long long int x = a[a.size() - 1];
    x % 2 == 0 ? cout << "even" : cout << "odd";
  } else {
    s % 2 == 0 ? cout << "even" : cout << "odd";
  }
  return 0;
}

```