#pragma GCC optimize("Ofast")
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<vector>
#include<string.h>
#include<math.h>
#include<map>
#include<iomanip>
#include<queue>

const long long INF_L = 1e17+7;
const long long INF_I = 1e9+7;
const long long MOD = 1e9+7;
const double EPS = 1e-8;
const double PI=acos(-1);

using namespace std;

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	long long x,y;;
	cin >> x >> y;
	long long a,b;
	
	if(x>y){
		a=x;
		b=y;
	}else{
		a=y;
		b=x;
	}
	
	long long cnt=0;
	for(long long i=1;i*i<=b;i++){
		if(b%i==0){
			if(a%i==0)cnt++;
			if(a%(b/i)==0)cnt++;
		}
	}
	
	if(cnt%2==0){
		cout << "Even" << endl;
	}else{
		cout << "Odd" << endl;
	}
	//cout << cnt << endl;
	return 0;
}