#include <bits/stdc++.h>

using ll = long long;

using namespace std;

ll gcd(ll a, ll b)
{
    if (a == 1 || b == 1)
        return 1;

    ll m{ a }, n{ b };

    while (m != n)
        m > n ? m -= n : n -= m;

    return m;
}

vector<pair<ll, ll> > primeFactorize(ll n)
{
    vector<pair<ll, ll> > res;
    for (ll a = 2; a * a <= n; ++a)
    {
        if (n % a != 0)
            continue;
        ll ex = 0;

        while (n % a == 0)
        {
            ++ex;
            n /= a;
        }

        res.push_back({ a, ex });
    }

    if (n != 1)
        res.push_back({ n, 1 });

    return res;
}

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

    ll a, b;

    scanf("%lld%lld", &a, &b);

    ll g = gcd(a, b);

    vector<pair<ll, ll> > p = primeFactorize(g);

    ll res{ 1 };

    for (const auto& ip : p)
        res *= (ip.second + 1);

    printf("%s", res & 1 ? "Odd\n": "Even\n");

    return 0;
}