#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<numeric>
#include<set>
using namespace std;
using ll = long long;
set<ll> enum_divisors(ll n){
    set<ll> res;
    for(ll i = 1; i <= sqrt(n); i++){
        if(n % i == 0){
            res.insert(i);
            if(n / i != i)
                res.insert(n / i);
        }
    }
    return res;
}
int main(){
    ll a,b;
    cin >> a >> b;
    ll g = gcd(a,b);
    set<ll> k = enum_divisors(g);
    cout << (k.size() % 2 == 0 ? "Even" : "Odd") << endl;
}