// yukicoder No.1113
#include <bits/stdc++.h>
using namespace std;

typedef long long ll;

int main()
{
    ll A, B;
    cin >> A >> B;
    
    vector<ll> v;
    ll mini = min(A, B);
    ll maxi = max(A, B);
    for (ll i = 1; i*i <= maxi; ++i) {
        if (mini % i == 0 && maxi % i == 0) {
            v.push_back(i);
            if (maxi % (mini / i) == 0) v.push_back(mini / i);
            else continue;
        }
    }
    
    //set<ll> s(v.begin(), v.end());
    
    cout << v.size() << "\n";
    
    if (v.size() % 2 == 0) cout << "Even" << "\n";
    else cout << "Odd" << "\n";
    
    return 0;
    
}