#include<iostream>
#include<iomanip>
#include<cmath>
#include<string>
#include<cstring>
#include<vector>
#include<list>
#include<algorithm>
#include<map>
#include<set>
#include<queue>
#include<stack>
using namespace std;
typedef long long ll;
#define fi first
#define se second
#define mp make_pair
#define rep(i, n) for(int i=0;i<n;++i)
#define rrep(i, n) for(int i=n;i>=0;--i)
const int inf=1e9+7;
const ll mod=1e9+7;
const ll big=1e18;
const double PI=2*asin(1);

ll gcd(ll a, ll b) {
  ll v0 = a, v1 = b, v2 = v0%v1;
  while(v2>0) {
    v0 = v1;
    v1 = v2;
    v2 = v0%v1;
  }
  return v1;
}

int main() {
  ll A, B;
  cin>>A>>B;
  vector<ll> primea, primeb;
  map<ll, int> amap, bmap;
  for(ll i=2;i*i<=A;++i) {
    if(A%i==0) {
      primea.push_back(i);
      while(A%i==0) {
        amap[i]++;
        A /= i;
      }
    }
  }
  if(A>1) {
    primea.push_back(A);
    amap[A]++;
  }
  for(ll i=2;i*i<=B;++i) {
    if(B%i==0) {
      primeb.push_back(i);
      while(B%i==0) {
        bmap[i]++;
        B /= i;
      }
    }
  }
  if(B>1) {
    primeb.push_back(B);
    bmap[B]++;
  }
  bool even = false;
  for(int i=0;i<primea.size();++i) {
    if(bmap[primea[i]]>0) {
      if(min(amap[primea[i]], bmap[primea[i]])%2==1) even = true;
    }
  }
  if(even) cout<<"Even"<<endl;
  else cout<<"Odd"<<endl;
}