#include "bits/stdc++.h"
using namespace std;
#define int long long
#define FOR(i, a, b) for(int i=(a);i<(b);i++)
#define RFOR(i, a, b) for(int i=(b-1);i>=(a);i--)
#define REP(i, n) for(int i=0; i<(n); i++)
#define RREP(i, n) for(int i=(n-1); i>=0; i--)
#define REP1(i, n) for(int i=1; i<=(n); i++)
#define RREP1(i, n) for(int i=(n); i>=1; i--)
#define ALL(a) (a).begin(),(a).end()
#define UNIQUE_SORT(l) sort(ALL(l)); l.erase(unique(ALL(l)), l.end());
#define CONTAIN(a, b) find(ALL(a), (b)) != (a).end()
#define out(...) printf(__VA_ARGS__)
#if DEBUG
#define debug(...) printf(__VA_ARGS__)
#else
#define debug(...) /* ... */
#endif
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

void solve();
signed main()
{
#if DEBUG
    std::ifstream in("input.txt");
    std::cin.rdbuf(in.rdbuf());
#endif
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}

/*================================*/
#if DEBUG
#define SIZE 100
#else
#define SIZE 223450
#endif

int A,B;

/*
 
 1,3,3^2
 */

int gcd(int a, int b) { return b ? gcd(b, a%b) : a; }

void solve() {
    cin>>A>>B;
    int g = gcd(A,B);
    map<int, int> M;
    FOR(n,2,1e8) {
        if (n > g) break;
        while (g%n==0) {
            M[n]++;
            g /= n;
        }
    }
    int odd = true;
    if (g != 1) odd = false;
    for (auto p:M) {
        if (!odd) break;
        if (p.second > 0 && p.second%2) {
            odd = false;
        }
    }
    
    cout << (odd ? "Odd" : "Even") << endl;
}