import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.PrintWriter;
import java.math.BigInteger;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.BitSet;
import java.util.Collection;
import java.util.Collections;
import java.util.Comparator;
import java.util.Deque;
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
import java.util.LinkedHashMap;
import java.util.LinkedList;
import java.util.List;
import java.util.Map;
import java.util.PriorityQueue;
import java.util.Queue;
import java.util.Random;
import java.util.Scanner;
import java.util.Stack;
import java.util.StringTokenizer;
import java.util.TreeMap;
import java.util.TreeSet;
import java.util.IdentityHashMap;
			
			
/**
 * for competitive programming
 * @author BrolyCode
 * @version 1.0.0
 */
			
			public class Main {
				static Random random;
				private static void mySort(int[] s) {
			        for (int i = 0; i < s.length; ++i) {
			            int j = random.nextInt(i + 1);
			            int t = s[i];
			            s[i] = s[j];
			            s[j] = t;
			        }
			        Arrays.sort(s);
			    }
				
				static class Pair{
					int x;
					int y;
					
					public Pair(int x, int y) {
						this.x=x;
						this.y=y;
					}
				}
				
				public static void sortPairX(Pair[] p) {
					Arrays.sort(p, new Comparator<Pair>() {
						public int compare(Pair o1, Pair o2) {
							return o1.x-o2.x;
						}			
					});
				}
				
				public static void sortPairY(Pair[] p) {
					Arrays.sort(p, new Comparator<Pair>() {
						public int compare(Pair o1, Pair o2) {
							return o1.y-o2.y;
						}			
					});
				}
				
				
			
				public static void main(String[] args) {
					random = new Random(543534151132L + System.currentTimeMillis());
					InputStream inputStream = System.in;
			        OutputStream outputStream = System.out;
			        InputReader in = new InputReader(inputStream);
			        PrintWriter out = new PrintWriter(outputStream);
			        
			        task(in,out);
			        
					out.close();
					
				}
			
				private static void task(InputReader in, PrintWriter out) {
					
					int a=in.nextInt();
					String s=in.next();
					
					if(a>=3200)out.println(s);
					else out.println("red");
					
				}	
				

				public static int gcd(int a, int b)  
			    { 
			        BigInteger b1 = BigInteger.valueOf(a); 
			        BigInteger b2 = BigInteger.valueOf(b); 
			        BigInteger gcd = b1.gcd(b2); 
			            return gcd.intValue(); 
			    } 
			      
			    public static long gcd(long a, long b)  
			    { 
			        BigInteger b1 = BigInteger.valueOf(a); 
			        BigInteger b2 = BigInteger.valueOf(b); 
			        BigInteger gcd = b1.gcd(b2); 
			            return gcd.longValue(); 
			    } 
				
				static class InputReader {
			        public BufferedReader reader;
			        public StringTokenizer tokenizer;
			
			        public InputReader(InputStream stream) {
			            reader = new BufferedReader(new InputStreamReader(stream), 32768);
			            tokenizer = null;
			        }
			
			        public String next() {
			            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			                try {
			                    tokenizer = new StringTokenizer(reader.readLine());
			                } catch (IOException e) {
			                    throw new RuntimeException(e);
			                }
			            }
			            return tokenizer.nextToken();
			        }
			
			        public int nextInt() {
			            return Integer.parseInt(next());
			        }
			        
			        public long nextLong() {
			            return Long.parseLong(next());
			        }
			        
			        public double nextDouble() {
			            return Double.parseDouble(next());
			        }
			        
			        public float nextFloat() {
			            return Float.parseFloat(next());
			        }
			        
			    }
			
			}
			
			
		  class Node{
			  public String name;
			  public ArrayList<Node> child=new ArrayList<Node>();
			  
			  public Node(String name) {
				  this.name=name;
			  }
			  
			  public boolean contains(String name) {
				  for(Node n: child) {
					  if(n.name.equals(name))return true;
				  }
				  return false;
			  }
			  
			  public Node getNode(String name) {
				  for(Node n: child) {
					  if(n.name.equals(name))return n;
				  }
				  return null;
			  }
		  }
		  
		  
		  

Measured memory_bytes: 22740