#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;

template <typename T>
T gcd(T a, T b) {
	if (a < b) swap(a, b);
		while (b != 0) {
			T tmp = b;
			b = a % b;
			a = tmp;
		}
	return a;
}


int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    ll a, b; cin >> a >> b;
    ll g = gcd<ll>(a, b);
    ll l = 0, r = 15e8;
    while(r-l > 1){
        ll c = (l+r)/2;
        if(c*c > g) r = c;
        else l = c;
    }
    if(l*l == g){
        cout << "Odd" << endl;
    }else{
        cout << "Even" << endl;
    }
}