#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;
using ll = long long;

int main() {
    ll a, b;
    cin >> a >> b;
    ll x = __gcd(a, b);

    ll mi = 0, ma = 2e9;
    while (ma - mi > 1) {
        ll mid = (ma + mi) / 2;
        if (mid * mid < x)mi = mid;
        else ma = mid;
    }

    cout << (ma * ma == x ? "Odd" : "Even") << endl;
    return 0;
}