#include <bits/stdc++.h>
using namespace std;
const long long MOD = 1000000007;
const long long INF = 1010000000;
const double EPS = 1e-10;
const pair<long long, long long> fd[] = {make_pair(1, 0), make_pair(-1, 0),
                                         make_pair(0, 1), make_pair(0, -1)};
vector<long long> init(long long size) {
  vector<long long> par(size, -1);
  return par;
}
long long root(long long x, vector<long long>& par) {
  if (par[x] < 0) {
    return x;
  } else {
    return par[x] = root(par[x], par);
  }
}
bool same(long long x, long long y, vector<long long>& par) {
  return root(x, par) == root(y, par);
}
void unite(long long x, long long y, vector<long long>& par) {
  x = root(x, par), y = root(y, par);
  if (same(x, y, par)) return;
  par[x] += par[y];
  par[y] = x;
}
long long size(long long x, vector<long long>& par) {
  return -par[root(x, par)];
}
long long pow(long long x, long long n) {
  if (n == 0) return 1;
  if (n % 2 == 0)
    return pow(x * x % MOD, n / 2);
  else
    return x * pow(x, n - 1) % MOD;
}
vector<long long> divisor(long long n) {
  vector<long long> ret;
  for (long long i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      ret.push_back(i);
      if (i * i != n) ret.push_back(n / i);
    }
  }
  sort(begin(ret), end(ret), greater<long long>());
  return (ret);
}
signed main() {
  long long a;
  string s;
  cin >> a >> s;
  if (a >= 3200)
    cout << s << endl;
  else
    cout << "red" << endl;
}
