#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<(int)(n); i++)
using namespace std;
using ll = long long;
using P = pair<int, int>;

// a と b の最大公約数を返す関数
long long GCD(long long a, long long b) {
    if (b == 0) return a;
    else return GCD(b, a % b);
}

int main(){
    ll a, b;
    cin >> a >> b;
    ll x = 0;
    ll c = GCD(a,b);
    for(ll i = 1; i * i <= c; i++){
        if(c % i ==0){
            x++;
            if(c/i != i) x++;
        }
    }
    string ans;
    if(x % 2 == 0) ans = "Even";
    else ans = "Odd";
    cout << ans << endl;
    return 0;
}