#include #define rep(i, n) for (int i = 0; i < (int)(n); i++) using namespace std; typedef long long ll; typedef vector vi; typedef vector vl; // 最大公約数 ll gcd(ll a, ll b) { if (b == 0) return a; else return gcd(b, a % b); } int main() { ll A, B; cin >> A >> B; ll x = gcd(A, B); ll cnt = 1; for (int i = 2; i <= sqrt(x); i++) { if (x == 1) break; ll ext = 0; while (x % i == 0) { ext++; x /= i; } cnt += (ext + 1); } if (x != 1) cnt *= 2; if (cnt % 2 == 0) { cout << "Even" << endl; } else { cout << "Odd" << endl; } } // 1000000000000000000 1000000000000000000