Problem: <image>

You have one chip and one chance to play roulette. Are you feeling lucky?

Output

Print your bet. Your chip must be placed entirely within some square (not on an edge or a corner shared by adjacent squares).

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
template <typename T>
bool uax(T& a, T b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <typename T>
bool uin(T& a, T b) {
  if (b < a) {
    a = b;
    return true;
  }
  return false;
}
using namespace std;
constexpr int power(int x, int n) { return n > 0 ? power(x, n - 1) * x : 1; }
void solve_a() {
  int x;
  cin >> x;
  cout << !(x < 128 && isdigit(x)) << endl;
}
void solve_d() { cout << "even" << endl; }
void solve_b() {
  bool ok = true;
  for (int i = (int)(0); i < (int)(10); ++i) {
    cout << i << endl << flush;
    string s;
    getline(cin, s);
    if (s == "terrible") ok = false;
  }
  cout << (ok ? "normal" : "grummy") << endl;
}
void solve_c() {
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = (int)(0); i < (int)(n); ++i) cin >> a[i];
  while (n > 1) {
    for (int i = (int)(0); i < (int)(n - 1); ++i)
      if (abs(a[i] - a[i + 1]) > 1) {
        cout << "NO" << endl;
        return;
      }
    a.erase(max_element((a).begin(), (a).end()));
    n -= 1;
  }
  cout << "YES" << endl;
}
void solve_g() {
  string s;
  getline(cin, s);
  int n = s.length();
  int m = 600;
  vector<string> a(5 * n, string(m, '.'));
  int z = 0;
  for (int i = (int)(0); i < (int)(n); ++i) {
    int x = (int)(s[i]);
    x &= 255;
    a[i * 5 + 1][0] = 'X';
    int j = 1;
    while (x != z) {
      if (i == 0) {
        z = (z + 1) % 256;
      } else {
        z = (z + 255) % 256;
      }
      a[i * 5 + 0][j] = 'X';
      a[i * 5 + 1][j] = 'X';
      ++j;
      a[i * 5 + 1][j] = 'X';
      ++j;
    }
    assert(j < m);
    a[i * 5 + 1][j] = 'X';
    a[i * 5 + 3][0] = 'X';
    a[i * 5 + 3][m - 1] = 'X';
    a[i * 5 + 4][0] = 'X';
  }
  for (int i = (int)(0); i < (int)(a.size()); ++i) cout << a[i] << endl;
}
int main() {
  solve_d();
  return 0;
}