#include <iostream>
#include <numeric>

using lint = long long;

constexpr lint INF = 1 << 30;

void solve() {
    lint a, b;
    std::cin >> a >> b;
    auto g = std::gcd(a, b);

    lint ok = 0, ng = INF;
    while (ng - ok > 1) {
        auto mid = (ok + ng) / 2;
        if (mid * mid <= g) {
            ok = mid;
        } else {
            ng = mid;
        }
    }

    std::cout << (ok * ok == g ? "Odd" : "Even") << "\n";
}

int main() {
    std::cin.tie(nullptr);
    std::ios::sync_with_stdio(false);

    solve();

    return 0;
}