#include <bits/stdc++.h>
using namespace std;
bool comp(pair<int, int> a, pair<int, int> b) {
  if (a.first != b.first)
    return a.first > b.first;
  else
    return a.second < b.second;
}
long int jou(long int x, long int y) {
  long int f = 1;
  for (int i = 0; i < y; ++i) {
    f = f * x % int(pow(10, 9) + 7);
  }
  return f;
}
inline bool pn(long int x) {
  if (x <= 1) return false;
  if (x != 2 && x % 2 == 0) return false;
  for (int i = 3; i <= (3 + int(sqrt(x))) / 2; ++i) {
    if ((x != i && x % i == 0) ||
        (x != (3 + int(sqrt(x)) - i) && x % (3 + int(sqrt(x)) - i) == 0))
      return false;
  }
  return true;
}
long int factorial(long int n) {
  long int f = 1;
  for (long int i = 1; i <= n; ++i) {
    f = f * i % int(pow(10, 9) + 7);
  }
  return f;
}
long int Func2(long int n, long int m) {
  long int s2 = 1, r = 1;
  for (long int i = 1; i <= m; ++i) {
    s2 = (s2 * (n - (i - 1)) / i) % (int(pow(10, 9) + 7));
  }
  return s2;
}
bool secsort(pair<int, int> a, pair<int, int> b) {
  if (a.second == b.second)
    return a.first > b.first;
  else
    return a.second > b.second;
}
long int GCD(long int a, long int b) {
  if (b == 0) return a;
  return GCD(b, a % b);
}
long int LCM(long int a, long int b) { return a / GCD(a, b) * b; }
void warfl(vector<vector<int> > &dist, int n) {
  for (int k = 0; k < n; k++) {
    for (int i = 0; i < n; i++) {
      for (int j = 0; j < n; j++) {
        dist[i][j] = min(dist[i][j], dist[i][k] + dist[k][j]);
      }
    }
  }
  return;
}
const int MAX = 1000000;
const int MOD = 1e9 + 7;
long mpow(long x, long n) {
  long ans = 1;
  while (n != 0) {
    if (n % 2 == 1) ans = ans * x % MOD;
    x = x * x % MOD;
    n = n / 2;
  }
  return ans;
}
long mfact(long n) {
  long ans = 1;
  for (long i = 2; i <= n; i++) {
    ans = ans * i % MOD;
  }
  return ans;
}
long mcomb(long n, long m) {
  if (n == 0 && m == 0) return 1;
  if (n < m || n < 0) return 0;
  long ans = mfact(n) * mpow(mfact(m), MOD - 2) % MOD;
  ans = ans * mpow(mfact(n - m), MOD - 2) % MOD;
  return ans;
}
long int jjjjj(long int n) {
  long int x = 1;
  for (int i = 1; i <= n; ++i) {
    x *= i;
  }
  return x;
}
int main() {
  int a, b;
  cin >> a >> b;
  if (a % 2 == 1 && b % 2 == 1)
    cout << "Even" << endl;
  else
    cout << "Odd" << endl;
}
