#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define rep(i, n) for (int i = 0; i < n; i++)
#define rrep(i, n) for (int i = 1; i <= n; i++)
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { return (a * b) / gcd(a,b); }
using P = pair <int, int>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }

ll MOD = 1000000007;
ll INF =1<<30;

ll yaku(ll n){
    if (n==1) return 1;
    vector<ll> c;
    for(ll i = 2;i*i<=n;++i){
        if(n%i==0) c.push_back(i);
        if(n/i!=i) c.push_back(n/i);
    }
    return c.size();
}

int main(){
    ll a,b;
    cin >> a>>b;
    ll c = gcd(a,b);
    ll ans = yaku(c);
    if(ans%2==0) cout << "Even" <<endl;
    else cout << "Odd" <<endl;
}