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>
using namespace std;
const string alphabetLower = "abcdefghijklmnopqrstuvwxyz";
const string alphabetHigher = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const string digits = "0123456789";
const long double pi = 3.141592653589793, e = 2.718281828459045;
void read() {}
void print() {}
void debug() { cerr << endl; }
long long gcd(long long a, long long b) {
  if (a < 0) a = abs(a);
  if (b < 0) b = abs(b);
  if (a > b) swap(a, b);
  if (a) return gcd(a, b % a);
  return b;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
struct vt {
  long long x, y;
  vt operator-() { return vt(-this->x, -this->y); }
  vt operator+(vt b) { return {this->x + b.x, this->y + b.y}; }
  vt operator-(vt b) { return *this + (-b); }
  vt operator*(long long b) { return vt(this->x * b, this->y * b); }
  long long operator*(vt b) { return this->x * b.x + this->y * b.y; }
  vt operator/(long long b) { return vt(this->x / b, this->y / b); }
  long long operator%(vt b) { return this->x * b.y - b.x * this->y; }
  bool operator==(vt b) { return this->x == b.x && this->y == b.y; }
  bool operator!=(vt b) { return !((*this) == b); }
  bool collinear(vt b) { return (*this) % b == 0; }
  bool opposite(vt b) { return this->collinear(b) && (*this) * b < 0; }
  double length() { return sqrt(this->x * this->x + this->y * this->y); }
  vt() {}
  vt(long long x, long long y) : x(x), y(y) {}
  vt(long long x1, long long y1, long long x2, long long y2)
      : x(x2 - x1), y(y2 - y1) {}
};
long long fact(long long a) {
  if (a == 1)
    return 1;
  else
    return a * fact(a - 1);
}
long long sign(long long a) {
  if (a > 0) return 1;
  if (a == 0) return 0;
  return -1;
}
bool prime(long long a) {
  if (a < 2) return 0;
  if (a == 2) return 1;
  for (long long b = 2; b <= ceil(sqrt(a)); b++)
    if (a % b == 0) return 0;
  return 1;
}
long long hashStr(string& s) {
  long long base = 26;
  long long res = 0;
  for (long long i = 0; i < ((long long)(s).length()); i++)
    res =
        ((res * base) % 36028797018963913 + s[i] - 'a' + 1) % 36028797018963913;
  return (res + 36028797018963913) % 36028797018963913;
}
long long hashStr(long long prevHash, char curChar) {
  return ((prevHash * 26) % 36028797018963913 + curChar - 'a' + 1) %
         36028797018963913;
}
ifstream fin("input.txt");
ofstream fout("output.txt");
template <typename Arg, typename... Args>
void read(Arg& arg, Args&... args) {
  cin >> arg;
  read(args...);
}
template <typename Arg, typename... Args>
void print(Arg arg, Args... args) {
  cout << setprecision(100) << (arg) << " ";
  print(args...);
}
template <typename Arg, typename... Args>
void debug(Arg arg, Args... args) {
  cerr << (arg) << " ";
  debug(args...);
}
struct node {
  node *left = nullptr, *right = nullptr;
  long long w, val, sz = 1;
  node(long long val) : w((rand() << 16) + rand()), val(val) {}
};
long long siz(node* a) {
  if (a == nullptr)
    return 0;
  else
    return a->sz;
}
node* treap;
node* merge1(node* v1, node* v2) {
  if (v1 == nullptr) return v2;
  if (v2 == nullptr) return v1;
  if (v1->w > v2->w) {
    v1->right = merge1(v1->right, v2);
    v1->sz = siz(v1->left) + siz(v1->right) + 1;
    return v1;
  } else {
    v2->left = merge1(v1, v2->left);
    v2->sz = siz(v2->left) + siz(v2->right) + 1;
    return v2;
  }
}
pair<node*, node*> split(node* w, long long k) {
  if (w == nullptr) return {nullptr, nullptr};
  if (siz(w->left) >= k) {
    auto tmp = split(w->left, k);
    w->left = tmp.second;
    w->sz = siz(w->left) + siz(w->right) + 1;
    return {tmp.first, w};
  } else {
    auto tmp = split(w->right, k - siz(w->left) - 1);
    w->right = tmp.first;
    w->sz = siz(w->left) + siz(w->right) + 1;
    return {w, tmp.second};
  }
}
void prnt(node* a) {
  if (a == nullptr) return;
  prnt(a->left);
  print(a->val);
  prnt(a->right);
}
void run() {
  srand(time(NULL));
  if (rand() % 2)
    cout << "odd";
  else
    cout << "even";
}
int32_t main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  run();
  return 0;
}