#include <bits/stdc++.h>
#define all(x) (x).begin(), (x).end()
typedef long long ll;
#define MOD 1000000007
using namespace std;
ll gcd(ll a, ll b) {
    if(a < b)
        gcd(b, a);
    ll r = 1;
    while(r != 0) {
        r = a % b;
        a = b;
        b = r;
    }
    return a;
}
map<ll, ll> prime_factor(ll n) {
    map<ll, ll> ret;
    for(ll i = 2; i * i <= n; i++) {
        while(n % i == 0) {
            ret[i]++;
            n /= i;
        }
    }
    if(n != 1)
        ret[n] = 1;
    return ret;
}
int main() {
    ll a, b;
    cin >> a >> b;
    ll c = gcd(a, b);
    auto d = prime_factor(c);
    ll x = 1;
    for(auto e : d) {
        x *= (1 + e.second);
    }
    cout << (x % 2 ? "Odd" : "Even") << endl;
}