#include <bits/stdc++.h>
using ll = long long;
using namespace std;
const int INFint = 1e9+1;
const ll INFll = (ll)1e18+1;
ll MOD=1e9+7;

ll gcd(ll a, ll b) { return __gcd(a,b); } //最大公約数
ll lcm(ll a, ll b) { return a/gcd(a,b)*b; } //最小公倍数

int main(){
  ll a,b;
  cin>>a>>b;
  ll x = gcd(a,b);
  if(sqrt(x) == ll(sqrt(x))){
    cout << "Odd" << endl;
  }else{
    cout << "Even" << endl;
  }
  return 0;
}