#include<iostream>
#include<cmath>
#include<algorithm>
#include<vector>
#include<numeric>
#include<set>
using namespace std;
using ll = long long;
vector<pair<ll, ll>> factrize(ll n)
{
    vector<pair<ll, ll>> res;
    for (ll i = 2; i <= sqrtl(n); i++)
    {
        ll k = i;
        ll cnt = 0;
        while (n % k == 0)
        {
            n /= k;
            cnt++;
        }
        res.emplace_back(k, cnt);
    }
    if (n != 1)
    {
        res.emplace_back(n, 1);
    }
    return res;
}
int main(){
    ll a,b;
    cin >> a >> b;
    ll g = gcd(a,b);
    vector<pair<ll,ll>> res = factrize(g);
    ll ans = 1;
    for(auto v:res){
        ans *= (v.second+1);
    }
    cout <<(ans % 2 == 0 ? "Even" : "Odd") << endl;
}