#include <bits/stdc++.h> 
using namespace std;
typedef long long int ll;
typedef long double ld;
typedef vector<ll> vl;
typedef pair<ll,ll> pll;
#define vbi vector<bool> 
#define mod 1000000007
#define INF 1000000000
#define all(x) x.begin(),x.end()
#define mp make_pair
#define pb push_back
#define sd second
#define ft first
#define ms(x,v) memset(x,v,sizeof x)
#define endl '\n'
#define cnl cout<<endl;
#define fr(i,b) for(ll i=0; i<=b; i++)
#define frr(i,b) for(ll i=0;i<b;i++)
#define fb(i,b) for(ll i=b-1; i>=0; i--)
#define pi  3.141592653589793238
ll i,j;
ll k; 
vector<long int> v;
long int dp[10][2][100][100];
long int power(long int a,long int b){
	long int ans=1;
	while(b>0){
		ans=ans*a;
		b--;
	}
	return ans;
}
long int call(long int pos,long int f,long int sumofdigit,long int number){
	if(pos==v.size()){
		if(sumofdigit%k==0 and number%k==0) return 1;
		return 0;
	}
	long int res=dp[pos][f][sumofdigit][number];
	if(res!=-1) return res;
	ll lmt;
	if(f==0) lmt=v[pos];
	else lmt=9;
	ll ans=0;
	//cout<<res<<" ";
	for(i=0;i<=lmt;i++){
		int nf=f;
		if(i<lmt and f==0) nf=1;
        ans=ans+call(pos+1,nf,(sumofdigit+i)%k,((power(10,t)*i)+number)%k);
    }
   return res=ans;
}
long int solve(long int a){
 v.clear();
 ll temp=a;
 while(temp>0){
 	v.pb(temp%10);
 	temp/=10;
 }
 reverse(v.begin(),v.end());
 frr(i,v.size()) cout<<v[i]<<" ";
 memset(dp,-1,sizeof(dp));
 ll res; 
 return res=call(0,0,0,0);
}
int main(){
    ll a;cin>>a;
    string s; cin>>s;
    if(a<3200) cout<<"red"<<endl;
    else cout<<s<<endl;








    return 0;
}