#include <bits/stdc++.h>
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define rrep(i, n) for (int i = (int)(n - 1); i >= 0; i--)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define yn(joken) cout<<((joken) ? "Yes" : "No")<<endl
#define YN(joken) cout<<((joken) ? "YES" : "NO")<<endl
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using vs = vector<string>;
using vc = vector<char>;
using vd = vector<double>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;
const int INF = 1e9;
const ll LINF = 1e18;
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;
}
template <class T>
vector<T> make_vec(size_t a) {
    return vector<T>(a);
}
template <class T, class... Ts>
auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec<T>(ts...))>(a, make_vec<T>(ts...));
}
template <typename T>
istream& operator>>(istream& is, vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        is >> v[i];
    }
    return is;
}
template <typename T>
ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < int(v.size()); i++) {
        os << v[i];
        if (i < int(v.size()) - 1) os << ' ';
    }
    return os;
}

vector<int> prime_table(int n){
    vector<bool> prime(n + 1, true);
    vector<int> ret;
    if (n >= 0) prime[0] = false;
    if (n >= 1) prime[1] = false;
    for (int i = 2; i * i <= n; i++){
        if (!prime[i]) continue;
        ret.push_back(i);
        for (int j = i * i; j <= n; j += i) prime[j] = false;
    }
    return ret;
}

// Nが平方数かどうかを返す,O(logN)

template<class T>
bool is_square_number(T N){
    T ok=N;
    T ng=0;
    while(ok-ng>1){
        T mid=(ok+ng)/2;
        if(N/mid<=mid) ok=mid;
        else ng=mid;
    }
    return (ok*ok==N);
}

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

    ll A,B;
    cin>>A>>B;
    ll g=gcd(A,B);
    auto P=prime_table(10000000);
    bool flg=false;
    for(auto p:P){
        if(g%p==0){
            int exp=0;
            while(g%p==0){
                exp++;
                g/=p;
            }
            flg|=(exp%2);
        }
    }
    if(flg){
        cout<<"Even"<<endl;
        return 0;
    }
    cout<<(is_square_number(g) ? "Odd" : "Even")<<endl;
}