Problem:
 Score : 100 points    Problem Statement You will be given an integer a and a string s consisting of lowercase English letters as input.  Write a program that prints s if a is not less than 3200 and prints red if a is less than 3200 .      Constraints  2800 \leq a < 5000  s is a string of length between 1 and 10 (inclusive).  Each character of s is a lowercase English letter.         Input Input is given from Standard Input in the following format:  a  s       Output If a is not less than 3200 , print s ; if a is less than 3200 , print red .        Sample Input 1 3200
pink      Sample Output 1 pink  a = 3200 is not less than 3200 , so we print s =  pink .       Sample Input 2 3199
pink      Sample Output 2 red  a = 3199 is less than 3200 , so we print red .       Sample Input 3 4049
red      Sample Output 3 red  a = 4049 is not less than 3200 , so we print s =  red .

Solution (Python):
a=int(input())
s=input()
if a<3200:
    print('red')
else:
    print(s)

Solution (Python):
a = int(input())
s = input()

print('red' if a < 3200 else s)

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
from sys import stdin, setrecursionlimit


def main():
    input = stdin.buffer.readline
    a = int(input())
    s = input()[:-1].decode()

    if a >= 3200:
        print(s)
    else:
        print('red')


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):


a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
def main():
  num = int(input())
  s=input()
  
  if num>=3200:
      print(s)
  else:
      print("red")
main()

Solution (Python):
N = int(input())
S = input()
if(N>=3200):
  print(S)
else:
  print('red')

Solution (Python):

n = int(input())
s = input()
if n >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):

import sys
input = sys.stdin.readline









A = int(input())
S = input().rstrip()
 
print(S if A>=3200 else "red")

Solution (Python):
A = int(input())
S = input()
if A >= 3200:
    print(S)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if(a >= 3200):
    print(s)
else:
    print('red')

Solution (Python):
from collections import defaultdict, deque
import sys


def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def I(): return int(sys.stdin.buffer.readline())
def LS(): return sys.stdin.buffer.readline().rstrip().decode('utf-8').split()
def S(): return sys.stdin.buffer.readline().rstrip().decode('utf-8')
def IR(n): return [I() for i in range(n)]
def LIR(n): return [LI() for i in range(n)]
def SR(n): return [S() for i in range(n)]
def LSR(n): return [LS() for i in range(n)]
def SRL(n): return [list(S()) for i in range(n)]
def MSRL(n): return [[int(j) for j in list(S())] for i in range(n)]


a = I()
s = S()

print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()
print (s) if 3200 <= a else print ("red")

Solution (Python):
a = input()
s = input()

if int(a) >= 3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()

if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

if a>= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
print( input() ) if a >= 3200 else print( 'red' )

Solution (Python):
a = int(input())
s = input()

if 3200 <= a:
    print(s)
else:
    print("red")

Solution (Python):

import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


def main():
    a = int(readline())
    s = readline().rstrip().decode()

    if a >= 3200:
        print(s)
    else:
        print('red')


if __name__ == '__main__':
    main()

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else 'red')

Solution (Python):
import math
a= input()
s= input()
if int(a)  >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a = I()
s = S()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
def main():
    a = int(input())
    s = input()
    print('red') if a < 3200 else print(s)

if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
s = input()
print('red') if a < 3200 else print(s)

Solution (Python):
s = int(input())
t = input()

print(t if 3200<= s else "red")

Solution (Python):
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=input()
b=input()
if int(a)>=3200:
	print(b)
elif int(a)<3200:
    print("red")

Solution (Python):



s = int(input())
C = input()

if s >= 3200:
    print(C)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else "red")

Solution (Python):
a=int(input())
s=input()
if a >= 3200 :
    print(s)
else :
    print('red')

Solution (Python):
x = int(input())
y = input()
if x >= 3200:
    print(y)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a < 3200:
    print("red")
else:
    print(s)

Solution (Python):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()

if a>=3200:
  print(s)
  
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
print('red' if a < 3200 else s)

Solution (Python):
a = int( input() )
s = input()
if a >= 3200:
  print( s )
else:
  print( "red" )

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = str(input())
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):
a=int(input())
s=str(input())
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
print(input() if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()
if a < 3200:
  print("red")
else:
  print(s)

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
if a >= 3200:
  print(input())
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
print('red' if int(input())<3200 else input())

Solution (Python):
a = int(input())
s = input()

if(a>=3200):
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
	print(s)
else:
	print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a=input()
s=raw_input()
print s if 3200<=a else "red"

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
S=input()
print(S if a>=3200 else "red")

Solution (Python):
a = int(input())
s = input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10 ** 9)

def main():
    a = int(input())
    s = input()[:-1]
    if a >= 3200:
        print(s)
    else:
        print('red')

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
s = input()

if n < 3200 :
  print('red')
else :
  print(s)

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a=int(input())
s=input()

if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):

a = int(input())
s = input()


if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = str(input())

if a >=3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()
if a<3200:
  print("red")
else:
  print(s)

Solution (Python):
a = int(input().rstrip())
s = input().rstrip()
r = s if a >= 3200 else 'red'
print(r)

Solution (Python):

a=int(input())
s=input()

if a >=3200:
    print(s)
else:
    print("red")

Solution (Python):
import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

def main():
    a = int(readline())
    s = readline().strip()

    if a >= 3200:
        print(s)
    else:
        print("red")


if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a>= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = str(input())
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()

if(a >= 3200):
  print(s)
else:
  print('red')

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else "red")

Solution (Python):
a=int(input())
s=str(input())
if a>=3200:
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()
if a>=3200: print(s)
else: print("red")

Solution (Python):
a = int(input())
s =input()
print(s if 3200<= a else "red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):
import sys
import math
import bisect

def main():
    a = int(input())
    s = input()
    if a >= 3200:
        print(s)
    else:
        print('red')

if __name__ == "__main__":
    main()

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else "red")

Solution (Python):
if int(input())< 3200:
  print("red")
else:
  print(input())

Solution (Python):
a = int(input())
if a >= 3200:
    print(input())
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a>= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
ss = input().rstrip()

if a >= 3200:
    print(ss)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):


a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s =input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
s=str(input())
if a<3200:
	print('red')
else:
	print(s)

Solution (Python):
a = int(input())
s = input()
if a >=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())


s= input()
print(s if a >= 3200 else "red")

Solution (Python):
def main():
    n = int(input())
    s = input()

    if n >= 3200:
        print(s)
    else:
        print("red")


if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
def ABC_138_A():
    a = int(input())
    s = input()
    if a >= 3200:
        print(s)
    else:
        print('red')

if __name__ == '__main__':

    ABC_138_A()

Solution (Python):
a = int(input())
s = input()
print(s if a>=3200 else "red")

Solution (Python):
a=int(input())
s=input()

if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a,s=int(input()),input()
print('red' if a<3200 else s)

Solution (Python):
a = int(input())
s = str(input())
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = str(input())
if a<3200:
    s = 'red'
print(s)

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce


import sys
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = float('inf')


a = I()
s = S()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
n= int(input()) ; c = input()
print('red' if n < 3200 else c)

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()
print(s) if a>=3200 else print("red")

Solution (Python):
a = int(input())
s = input()
print(s if a >=3200 else 'red')

Solution (Python):
a = int(input())
s = input()
if a < 3200:
    print('red')
else:
    print(s)

Solution (Python):
a = int(input())
s = input()

print("red" if a < 3200 else s)

Solution (Python):


a = int(input())
s = str(input())
print(s if 3200 <= a else 'red')

Solution (Python):
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime



def input1():
	return int(input())


def input2():
	return map(int,input().split())


def input_array():
	return list(map(int,input().split()))

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
			


a=input1()
s=str(input())

if a>=3200:
	print(s)
else:
	print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
p=input()
print(["red",p][a>=3200])

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a < 3200:
    print('red')
else:
    print(s)

Solution (Python):
a=int(input())
s=input()

if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):

N = int(input())
S = input()


if N >= 3200:
    print(S)
else:
    print("red")

Solution (Python):
import sys, heapq

a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if  a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):

a = int(input())
s = input()

print(s if a >= 3200 else "red")

Solution (Python):
a = int(input())
print(input() if a >= 3200 else 'red')

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else 'red')

Solution (Python):
a = int(input())
s = input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else 'red')

Solution (Python):
a = int(input())
s = input()

ans = 0
if a >= 3200:
    ans = s
else:
    ans = "red"
print(ans)

Solution (Python):
def main():
    a = int(input())
    s = input()

    if a >= 3200:
        print(s)
    else:
        print("red")


if __name__ == "__main__":
    main()

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):




import sys
from io import StringIO
import unittest

def yn(b):
    print("Yes" if b==1 else "No")
    return

def resolve():
    readline=sys.stdin.readline

    
    
    a=int(readline())
    ss=readline().rstrip()
    if a<3200:
        ss="red"
    print(ss)
    

    return

if 'doTest' not in globals():
    resolve()
    sys.exit()

Solution (Python):
a=int(input())
s=input()

if a >= 3200:
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a < 3200:
    print('red')
else:
    print(s)

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
print(input()if input()>="3200"else"red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200 :
    print(s)
else :
    print("red")

Solution (Python):
a = int(input())
s = str(input())
print(s) if a >= 3200 else print('red')

Solution (Python):
a=int(input())
s=input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
import sys
input=sys.stdin.readline
sys.setrecursionlimit(10 ** 6)





















a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if(a >= 3200):
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200 :
    print( s )
elif a < 3200 :
    print( 'red' )

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else 'red')

Solution (Python):
a=int(input())
s=input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
	print(s)
else:
	print("red")

Solution (Python):
a=int(input())
s=input()
if a<3200:
    print("red")
else:
    print(s)

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = INT()
s = input()

print("red" if a<3200 else s)

Solution (Python):
a = int(input())
s = input()

if(a < 3200):
    print('red')
else:
    print(s)

Solution (Python):
a = int(input())

print(input()) if a >= 3200 else print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()

print(s if a >= 3200 else 'red')

Solution (Python):
a=int(input())
b=input()
if a>=3200:
  print(b)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a < 3200:
    print('red')
else:
    print(s)

Solution (Python):
a,s=[(input()) for i in range(2)]
if int(a)>=3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())>=3200
if a:
    print(input()) 
else:
    print('red')

Solution (Python):


def main():
    a = int(input())
    s = str(input())

    if a >= 3200:
        print(s)
    else:
        print('red')


main()

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else "red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s= input()

if a>=3200:
	print(s)
else:
	print('red')

Solution (Python):

a=int(input())
s=str(input())
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
print(s) if a>=3200 else print("red")

Solution (Python):

a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = str(input())
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a=int(input())
s=str(input())

if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = str(input())
print(s if a>=3200 else "red")

Solution (Python):
a = int(input())
s = input()

if a < 3200:
  print('red')
else:
  print(s)

Solution (Python):
if int(input()) >= 3200:
  print(input())
else:
  print("red")

Solution (Python):
a=int(input().strip('\n'))
s=input().strip('\n')
print('red' if a<3200 else s)

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):


a = int(input())
s = str(input())

if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
print(input()) if a >= 3200 else print('red')

Solution (Python):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
print(s if a>=3200 else 'red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = str(input())

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):
if int(input()) < 3200:
    print("red")
else:
    print(input())

Solution (Python):
def main():
    a = int(input())
    s = input()
    if a >= 3200:
        print(s)
    else:
        print("red")
if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

print(s if a >= 3200 else "red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
print('red' if int(input())<3200 else input())

Solution (Python):
a = int(input())
s = input()
if a>=3200:
  print(s)
else:
  print('red')

Solution (Python):

a = int(input())
s =input()


if a<3200:
    print("red")
else:
    print(s)

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
a=input()
b=input()
if int(a)>=3200:
	print(b)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()
if a>3199:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()

ans = s if a >= 3200 else "red"
print(ans)

Solution (Python):
N=int(input())
S=input()


if N>=3200:
  print(S)
else:
  print("red")

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print("red")

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby, product
    from bisect import bisect_left,bisect_right
    from heapq import heapify, heappop, heappush
    from math import floor, ceil
    

    
    

    a = int(input())
    s = input().rstrip()
    if a>=3200:
        print(s)
    else:
        print('red')

if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
s=input()

if a >=3200:
    print(s)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

ans = 'red'
if a < 3200:
    print(ans)
else:
    print(s)

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print('red')

Solution (Python):
a=int(input())
s=str(input())

if a<3200:
  print("red")
else:
  print(s)

Solution (Python):
a = input()
s = input()

if int(a) >= 3200:
    print(s)

else:
    print("red")

Solution (Python):


a = int(input())
s = input()

if (a >= 3200):
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()

if a>=3200:
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input().rstrip()
if a >= 3200:
    print(s)
else:
    print("red")

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = INT()
s = input()

print(s if a >= 3200 else "red")

Solution (Python):
a=int(input())
s=input()
if 3200<=a:
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
  print(s)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()

if 3200 <= a:
    print(s)
else:
    print('red')

Solution (Python):
A = int(input())
S = input()
if A < 3200:
	print("red")
else:
	print(S)

Solution (Python):
a = int(input())
s = input()
if a < 3200:
    print("red")
else:
    print(s)

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1


a = int(input())
s = input().rstrip()
print(s if a >= 3200 else 'red')

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 9)
input = sys.stdin.readline
from itertools import permutations,  combinations, accumulate
from functools import *
from collections import deque, defaultdict, Counter
from heapq import heapify, heappop, heappush, heappushpop

INF = float('inf')
NIL = - 1

""" Input
N, A, B = map(int, input().split())
A = list(map(int, input().split()))
D = [int(input()) for _ in range(N)]
"""

a = int(input())
s = input().rstrip()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()

if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
def main():
    a = int(input())
    s = input()
    if a >= 3200:
        print(s)
    else:print("red")

if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
s = str(input())

print('red') if a<3200 else print(s)

Solution (Python):
x=int(input())
ch=input()
if (x>=3200):
    print(ch)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
b = input()
if a >= 3200:
    print(b)
else:
    print("red")

Solution (Python):
a = int(input())
s = input()
print('red' if a<3200 else s)

Solution (Python):
N = int(input())
S = input()
if N >= 3200:
  print(S)
else:
  print('red')

Solution (Python):
a = int(input())
s = input()
if a >= 3200: print(s)
else: print('red')

Solution (Python):
a = int(input())
s = input()
if (a >= 3200):
  print(s)
else:
  print("red")

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
a = int(input())
s = input()
print(s if a >= 3200 else 'red')

Solution (Python):
import os, sys, re, math

a = int(input())
s = input()

print(s if a >= 3200 else 'red')

Solution (Python):

a = int(input())
print(input()) if a >= 3200 else print('red')

Solution (Python):
a = int(input())
s = input()
print (s if a >= 3200 else 'red')

Solution (Python):
icase=0
if icase==0:
    a=int(input())
    s=input()
    if a<3200:
        print("red")
    else:
        print(s)

Solution (Python):
n = int(input())
s = input()
print(s if n >= 3200 else 'red')

Solution (Python):
a = int(input())
s = str(input())
if a >= 3200:
    print(s)
else:
    print('red')

Solution (Python):
a = int(input())
s = input()
if a>=3200: print(s)
else: print('red')

Solution (Python):
a=int(input())
s=input()
if a>=3200:
    print(s)
else:
    print('red')