/**
*    author:  yuya1234
*    created: 17.07.2020 21:20:39
**/

#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

#define REP(i,n) for(ll i=0;i<(ll)(n);i++)
#define REPD(i,n) for(ll i=n-1;i>=0;i--)
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define FORD(i,a,b) for(ll i=a;i>=(ll)(b);i--)

#define SORT(x) sort(x.begin(),x.end())
#define SORTD(x) sort(x.rbegin(),x.rend())
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define SZ(x) ll(x.size())

#define MEMSET(v, h) memset((v), h, sizeof(v))

template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
    
bool prime_factor1(ll n) {
  map< ll, ll > ret;
  for(ll i = 2; i * i <= n; i++) {
    if(ret[i-1]%2==1)return true;
    while(n % i == 0) {
      ret[i]++;
      n /= i;
    }
  }
  if(n != 1) ret[n] = 1;
  return false;
}

bool count_divisor(ll n){
  ll i=1,cout=0;
  while(i*i<=n){
    if(n%i==0){
      if(i+i==n){
        return true;
      }
    }
    i+=1;
  }
  return false;
}

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);

  ll a,b;
  cin>>a>>b;

  ll _gcd=gcd(a,b);

  if(_gcd==1)
  {
    cout<<"Odd"<<endl;
    return 0;
  }

  if(prime_factor1(_gcd))cout<<"Even"<<endl;
  else cout<<"Odd"<<endl;

  return 0;
}