#include <bits/stdc++.h>
using namespace std;
inline long long int in() {
  long long int x;
  cin >> x;
  return x;
}
template <typename tuple<int, int, int> >
inline istream& operator>>(istream& i, vector<tuple<int, int, int> >& v) {
  for (int j = 0; j < ((int)(v).size()); ++j) i >> v[j];
  return i;
}
template <typename tuple<int, int, int> >
string join(const vector<tuple<int, int, int> >& v) {
  stringstream s;
  for (int i = 0; i < ((int)(v).size()); ++i) s << ' ' << v[i];
  return s.str().substr(1);
}
template <typename tuple<int, int, int> >
inline ostream& operator<<(ostream& o, const vector<tuple<int, int, int> >& v) {
  if ((int)(v).size()) o << join(v);
  return o;
}
template <typename T1, typename T2>
inline istream& operator>>(istream& i, pair<T1, T2>& v) {
  return i >> v.first >> v.second;
}
template <typename T1, typename T2>
inline ostream& operator<<(ostream& o, const pair<T1, T2>& v) {
  return o << v.first << "," << v.second;
}
template <typename tuple<int, int, int> >
inline long long int suma(const vector<tuple<int, int, int> >& a) {
  long long int res(0);
  for (auto&& x : a) res += x;
  return res;
}
const double eps = 1e-10;
const long long int LINF = 1001002003004005006ll;
const int INF = 1001001001;
const int MX = 200005;
vector<int> to[2505];
vector<int> rto[2505];
bool reachablefrom1[2505];
bool reachableToN[2505];
bool ok[2505];
void dfs(int v) {
  if (reachablefrom1[v]) return;
  reachablefrom1[v] = true;
  for (int u : to[v]) {
    dfs(u);
  }
}
void rdfs(int v) {
  if (reachableToN[v]) return;
  reachableToN[v] = true;
  for (int u : rto[v]) {
    rdfs(u);
  }
}
int main() {
  int a = in();
  string s;
  cin >> s;
  if (a < 3200) {
    cout << s << endl;
  } else {
    cout << "red" << endl;
  }
  return 0;
}
