#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max()/32*15+208;

int main() {
    ll a, b;
    cin >> a >> b;
    ll g = __gcd(a, b);
    ll ok = 0, ng = INF<int>;
    while(ng-ok>1){
        ll mid = (ok+ng)/2;
        if(mid*mid <= g) ok = mid;
        else ng = mid;
    }
    if(ok*ok == g) puts("Odd");
    else puts("Even");
    return 0;
}