#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#include<utility>
#include<map>
#include<set>
#include<queue>
#include<stack>
#include<functional>
#include<math.h>
#include<random>
#include <bitset>
using namespace std;
#define N (1000000000+7)
//#define N 998244353
#define INF 1e16
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> Q;

const int inf = (int)1e9; 

ll gcd(ll a, ll b) {
	if (b > a) {
		ll tmp = b;
		b = a;
		a = tmp;
	}
	if (a%b == 0)return b;
	else return gcd(b, a%b);
}



int main(void){
	ll x,y;
	cin>>x>>y;
	ll g =gcd(x,y);
	ll ok = 0;
	ll ng = 1000000000+7;
	while(abs(ok-ng)>1){
		ll mid = (ok+ng)/2;
		if(mid*mid<=g)ok=mid;
		else ng = mid;
	}
	if(ok*ok==g)cout<<"Odd"<<endl;
	else cout<<"Even"<<endl;
	return 0;
}