#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;

// 最大公約数
ll gcd(ll a, ll b) {
    if (b == 0) return a;
    else return gcd(b, a % b);
}

// 最小公倍数
ll lcm(ll a, ll b) {
    ll x = a / gcd(a, b);
    return x * b;
}

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

    ll x = gcd(A, B);

    int cnt = 0;
    if (x == 1) {
        cnt++;
    } else {
        cnt += 2;
    }

    for (int i = 2; i <= sqrt(x); i++) {
        if (x % i == 0) {
            cnt += 2;
        }
    }

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