#include <bits/stdc++.h>
using namespace std;

#define ll long long
#define rep(i, n) for (int i = 0; i < (n); i++)
#define P pair<int, int>

ll gcd(ll a, ll b) {
  return a%b ? gcd(b, a%b) : b;
}

bool isSquare(ll x) {
  ll ac = 0, wa = 1e9+5;
  while (wa-ac>1) {
    ll wj = (wa+ac)/2;
    if (wj*wj <= x) ac = wj;
    else wa = wj;
  }
  ll wa2 = 0, ac2 = 1e9+5;
  while (ac2-wa2>1) {
    ll wj = (wa2+ac2)/2;
    if (wj*wj >= x) ac2 = wj;
    else wa2 = wj;
  }

  if (ac == ac2) return true;
  else return false;

}

int main() {
  ll a, b;
  cin >> a >> b;
  ll g = gcd(a,b);


  if (isSquare(g)) cout << "Odd" << endl;
  else cout << "Even" << endl;

}