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