
#include <iostream>
//#include<iomanip>
//#include <iomanip>

//#include <math.h>

using namespace std;

void D();
void ARC001B(), ABC138A(), ABC138B(), ABC138C();

int main()
{
	ABC138A();
}

void ABC138A() {
	int a;
	string c;
	cin >> a;
	cin >> c;

	if (a >= 3200) cout << "red" << endl;
	else cout << c << endl;

}

void ARC001B() {
	int A, B;
	cin >> A >> B;

	int count10 = 0;
	int count5 = 0;
	int count1 = 0;
	count10 += round((double)(B - A) / 10);
	A += count10 * 10;
	count5 += round((double)(B - A) / 5);
	A += count5 * 5;
	count1 = B - A;

	int sum = abs(count10) + abs(count5 )+ abs(count1);
	//sum = abs(sum);
	cout << sum;

}

void D() {
	int N, Q;
	cin >> N >> Q;
	int* a, * b, *x, *p;
	int* nn;// iを頂点とする部分木のノードの数
	//N ノードの数 Q 操作の数
	//a[i] -> b[i] 結ばれてる
	// p[j]を頂点とする部分木の全ノードにx[j]を足す
	a = new int[Q];
	b = new int[Q];
	x = new int[N];
	p = new int[N];
	nn = new int[N];

	for (int i = 0; i < N; i++) cin >> a[i] >> b[i];
	for (int i = 0; i < Q; i++) cin >> p[i] >> x[i];

	for (int i = 0; i < N; i++) {
		int tempSubTree = p[i];
		for (int j = 0; j < N; j++) {


		}
	}

}