#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using vin=vector<int>;
using vll=vector<long long>;
using vvin=vector<vector<int>>;
using vvll=vector<vector<long long>>;
using vstr=vector<string>;
using vvstr=vector<vector<string>>;
using vch=vector<char>;
using vvch=vector<vector<char>>;
using vbo=vector<bool>;
using vvbo=vector<vector<bool>>;
using vpii=vector<pair<int,int>>;
using pqsin=priority_queue<int,vector<int>,greater<int>>;
#define mp make_pair
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define rep2(i,s,n) for(int i=(s);i<(int)(n);i++)
#define all(v) v.begin(),v.end()
#define decp(n) cout<<fixed<<setprecision((int)n)
const int inf=1e9+7;
const ll INF=1e18;

map<ll,ll> prime;

void factorization(ll x){
    for(ll i=2;i*i<=x;i++){
        while(x%i==0){
            prime[i]++;
            x/=i;
        }
    }
    if(x!=1)prime[x]++;
    return;
}

int main(){
    ll a,b;cin>>a>>b;
    ll c=__gcd(a,b);
    factorization(c);
    for(auto p=prime.begin();p!=prime.end();p++){
        if(p->second%2){
            cout<<"Even"<<endl;
            return 0;
        }
    }
    cout<<"Odd"<<endl;
}