#include<bits/stdc++.h>

using namespace std;
using ll=long long;
#define rep2(i, a, n) for(int i = (a); i < (n); i++)
#define rep(i, n) rep2(i,0,n)

template<typename S,typename T,typename U>void flagfunc1(S flag,T A,U B){flag?cout<<A<<'\n':cout<<B<<'\n';}

vector<ll> divisor(int n){
  vector<ll> res;
  for(int i=1;i*i<=n;i++){
    if(n%i==0){
      res.push_back(i);
      if(i!=n/i) res.push_back(n/i);
    }
  }
  return res;
}

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

  ll a,b;cin>>a>>b;
  vector<ll> c,d;
  c=divisor(a);
  d=divisor(b);

  sort(c.begin(),c.end());
  sort(d.begin(),d.end());

  /*
  rep(i,c.size())cout<<c[i]<<" ";
  cout<<endl;
  rep(i,d.size())cout<<d[i]<<" ";
  cout<<endl;
   */

  ll cnt=0,e=0,f=0;
  for(int e=0;e<c.size();e++){
    if(c[e]==d[f]){
      cnt++;
      f++;
    }
  }

  //cout<<cnt<<endl;
  flagfunc1(cnt%2,"Odd","Even");
}