#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;

long long GCD(long long a,long long b){
	long long x=max(a,b),y=min(a,b);
	if(x%y==0){
		return y;
	}else{
		return GCD(y,x%y);
	}
}

bool sqr_2bun(long long x){
	long long start=1;
	long long end=x;
	int id=0;
	long long mid;
	if(x==1){
		return true;
	}
	while(1){
		mid=(end+start)/2;
		if(mid*mid>x){
			end=mid;	
		}else if(mid*mid<x){
			start=mid;
		}else if(mid*mid==x){
			return true;
		}
		if(end-start<=1){
			return false;
		}
	}
}

int main(){
	cin.tie(0);
	ios::sync_with_stdio(false);
	
	long long a,b;
	cin >> a >> b;
	long long g=GCD(a,b);
	
	if(sqr_2bun(g)){
		cout << "Odd" << endl;
	}else{
		cout << "Even" << endl;
	}
	
	return 0;
}