#include <bits/stdc++.h>
using namespace std;
vector<pair<int, int> > adj[100010];
bool visit[100010];
int dis[100010];
bool dfs(int v) {
  visit[v] = 1;
  bool ret = 1;
  for (int i = 0; i < adj[v].size(); i++) {
    int u = adj[v][i].first;
    if (!visit[u]) {
      dis[u] = dis[v] + adj[v][i].second;
      ret &= dfs(u);
      if (!ret) return 0;
    } else if (dis[u] != dis[v] + adj[v][i].second)
      return 0;
  }
  return ret;
}
int main() {
  int a, b;
  cin >> a >> b;
  if ((a * b) % 2)
    cout << "Even";
  else
    cout << "No";
}
