#include <bits/stdc++.h>
#define rep(i,n) for(int i=(0);i<(n);i++)

using namespace std;

typedef long long ll;

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 (a>b) { a=b; return 1; } return 0; }

ll mygcd(ll a, ll b){
	if(b == 0) return a;
	return mygcd(b, a % b);
}

bool cond(ll y, ll x){
	if(y == 0) return true;
	return y <= x / y;
}

// condを満たす最大のxを求める(upper_bound)
// 全てのxが条件を満たさない場合は-1を返す(-1はとりえない値)
ll upper_bound_cond(ll x){
	ll lb = -1, ub = 1e18 + 10000;

	while(ub - lb > 1){
		ll mid = (lb + ub) / 2;

		bool ok = cond(mid, x);
		// cout << mid << "," << ok << endl;
		if(ok) lb = mid;   // Answer is in [mid, ub)
		else ub = mid;            // Answer is in [lb, mid)
	}

	// now lb + 1 = ub
	return lb;
}

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

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

	ll x = mygcd(a, b);
	ll y = upper_bound_cond(x);

	if(y * y == x){
		cout << "Odd" << endl;
	}else{
		cout << "Even" << endl;
	}

}