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

typedef long long ll;
#define REP(i,n) for(int i=0,_n=(int)(n);i<_n;++i)
#define ALL(v) (v).begin(),(v).end()
#define CLR(t,v) memset(t,(v),sizeof(t))
template<class T1,class T2>ostream& operator<<(ostream& os,const pair<T1,T2>&a){return os<<"("<<a.first<<","<<a.second<< ")";}
template<class T>void pv(T a,T b){for(T i=a;i!=b;++i)cout<<(*i)<<" ";cout<<endl;}
template<class T>void chmin(T&a,const T&b){if(a>b)a=b;}
template<class T>void chmax(T&a,const T&b){if(a<b)a=b;}

ll nextLong() { ll x; scanf("%lld", &x); return x;}

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

bool isSquare(ll g) {

  if (g <= 100000) {
    ll r = 1;
    while (r * r < g) r++;
    return r * r == g;
  }

  ll r = sqrt(g + 0.5) - 5;
  while (r * r < g) { r++; }
  return r * r == g;
}

int main2() {
  ll A = nextLong();
  ll B = nextLong();
  ll g = gcd(A, B);

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

  return 0;
}

int main() {

#ifdef LOCAL
  for (;!cin.eof();cin>>ws)
#endif
    main2();
  return 0;
}