#pragma GCC optimize("Ofast", "unroll-loops")

#include <bits/stdc++.h>

using namespace std;

#define ll long long
#define ld long double

ll gcd(ll a, ll b) {
	if (a < b) swap(a, b);
	if (b == 0) return a;
	return gcd(a % b, b);
}

bool is_square(ll a) {
	ll l = 0, g = 1000000001LL;
	while (g - l > 1) {
		ll mid = l + (g - l) / 2;
		if (mid * mid <= a) l = mid;
		else g = mid;
	}
	return l * l == a;
}

int main(void) {
	ll A, B; cin >> A >> B;
	ll g = gcd(A, B);
	cout << (is_square(g) ? "Odd" : "Even") << endl;
	return 0;
}