#include using namespace std; using ll = long long; #define rep(i,m,n) for(int i=m; i> A >> B; ll g = gcd(A, B); ll ng = 0LL, ok = ll(1e9 + 100); while(abs(ok - ng) > 1LL){ ll mid = (ok + ng)/2LL; if(mid * mid >= g) ok = mid; else ng = mid; } if(ok*ok == g){ cout << "Odd" << endl; }else{ cout << "Even" << endl; } return 0; }