#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
using namespace std;
long long gcd(long long a,long long b)
{
	while(b)
	{
		a %= b;
		swap(a,b);
	}
	return a;
}
void solve()
{
	long long A,B;
	cin >> A >> B;
	long long G = gcd(A,B);
	long long ok = 1,ng = (long long)2e9;
	while(ng-ok > 1)
	{
		long long mid = (ok+ng)/2;
		if(mid*mid <= G) ok = mid;
		else ng = mid;
	}

	cout << (ok*ok == G ? "Odd":"Even") << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	//cin >> tt;
	while(tt--) solve();
}