#include <string>
#include <iostream>
#include <algorithm>
#include <math.h>
#include <set>
using namespace std;


int gcd(long long a, long long b){
   if (a%b == 0)
       return(b);
   else
       return(gcd(b, a%b));
}

void solve(long n) {
  int max = sqrt(n)+1;
  set<int> s;
  for(int i=1; i<=max; i++) {
        if(n%i==0) {
          s.insert(i);
          s.insert(n/i);
        }
  }
  if(s.size()%2==0) 
        cout << "Even" << endl;
  else
        cout << "Odd" << endl;
}

int main() {
  long long  a, b;
  cin >> a; cin >> b;
  //cout << gcd(a,b) << endl;
  solve(gcd(a,b));
  return 0;
}