#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(ri,n) for(int ri = (int)(n-1); ri >= 0; ri--)
#define rep2(i,x,n) for(int i = (int)(x); i < (int)(n); i++)
#define rrep2(ri,x,n) for(int ri = (int)(n-1); ri >= (int)(x); ri--)
#define repit(itr,x) for(auto itr = x.begin(); itr != x.end(); itr++)
#define rrepit(ritr,x) for(auto ritr = x.rbegin(); ritr != x.rend(); ritr++)
#define ALL(x) x.begin(), x.end()
using ll = long long;
using namespace std;

map<ll, ll> prime_factorization(ll n){
  map<ll, ll> ans;
  ll a = 2;
  while(n >= a*a){
    if(n % a == 0){
      ans[a]++;
      n /= a;
    }else{
      a++;
    }
  }
  ans[n]++;

  return ans;
}

int main(){
  ll a, b;
  cin >> a >> b;
  auto ap = prime_factorization(a);
  auto bp = prime_factorization(b);
  for(auto p : ap){
    if(bp[p.first] == 0) continue;
    int mn = min(p.second, bp[p.first]);
    // cerr << p.second << " " << p.first << endl;
    if((mn+1) % 2 == 0){
      cout << "Even" << endl;
      return 0;
    }
  }
  cout << "Odd" << endl;
  return 0;
}