#include <bits/stdc++.h>
using namespace std;
#define reps(i,s,n) for(int i = s; i < n; i++)
#define rep(i,n) reps(i,0,n)
#define Rreps(i,n,e) for(int i = n - 1; i >= e; --i)
#define Rrep(i,n) Rreps(i,n,0)
#define ALL(a) a.begin(), a.end()
#define fi first
#define se second
typedef long long ll;
typedef vector<ll> vec;
typedef vector<vec> mat;

ll N,M,H,W,Q,K,A,B;
string S;
//const ll MOD = 998244353;
const ll MOD = (1e+9) + 7;
typedef pair<ll, ll> P;
const ll INF = (1LL<<58);

ll extgcd(ll a, ll b, ll &x, ll &y){
    ll d = a;
    if(b != 0){
        d = extgcd(b, a%b, y, x);
        y -= (a/b) * x;
    }else{
        x=1;
        y=0;
    }
    return d;
}


int main() {
    cin>>A>>B;
    ll x, y;
    if(B > A) swap(A, B);
    ll g = extgcd(A, B, x, y);
    ll lb = 1, ub = ll(2e+9);
    while(ub - lb > 1){
        ll cen = (ub + lb) / 2;
        (cen * cen <= g ? lb : ub) = cen;
    }
    cout<<(lb * lb == g ? "Odd" : "Even")<<endl;
}