#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<long long> vl;

int main() {
    ll A, B;
    cin >> A >> B;

    vl va;
    for (int i = 1; i <= sqrt(A); i++) {
        if (A % i == 0) {
            va.push_back(i);
            va.push_back(A / i);
        }
    }

    vl vb;
    for (int i = 1; i <= sqrt(B); i++) {
        if (B % i == 0) {
            vb.push_back(i);
            vb.push_back(B / i);
        }
    }

    set<ll> s;
    rep(i, va.size()) {
        rep(j, vb.size()) {
            if (va[i] == vb[j]) {
                s.insert(va[i]);
            }
        }
    }

    if (s.size() % 2 == 0) {
        cout << "Even" << endl;
    } else {
        cout << "Odd" << endl;
    }
}