#include using namespace std; #define ll long long #define REP(i,m,n) for(int i=(int)(m); i<(int)(n); i++) #define rep(i,n) REP(i,0,n) #define RREP(i,m,n) for(int i=(int)(m); i>=(int)(n); i--) #define rrep(i,n) RREP(i,n-1,0) #define all(v) v.begin(), v.end() const int inf = 1e9+7; const ll longinf = 1LL<<60; const ll mod = 1e9+7; void prime_factorization(ll N, map& res) { if(N == 1 || N == 0) return; ll n = N; ll i = 2; while(n >= i * i) { while(n % i == 0) { if(res.count(i)) res[i]++; else res[i] = 1; n /= i; } if(i == 2) i++; else i += 2; } if(n != 1) res[n] = 1; } ll gcd(ll x, ll y) { if(x > y) return gcd(y, x); else if(x == 0) return y; else return gcd(y % x, x); } int main() { cin.tie(0); ios::sync_with_stdio(false); ll a, b; cin >> a >> b; ll g = gcd(a, b); map res; prime_factorization(g, res); for(auto ele: res) { if(ele.second % 2) { cout << "Even" << "\n"; return 0; } } cout << "Odd" << "\n"; return 0; }