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):

from collections import defaultdict,deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def I(): return int(sys.stdin.readline())
def LS():return [list(x) for x in sys.stdin.readline().split()]
def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res
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)]

sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    a = I()
    s = input()
    if a >= 3200:
        print(s)
    else:
        print("red")
    return


def B():
    n = I()
    a = LI()
    ans = 0
    for i in a:
        ans += 1/i
    print(1/ans)
    return


def C():

    return


def D():

    return


def E():

    return


def F():

    return


if __name__ == "__main__":
    A()

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 = 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):
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 = 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")

Solution (Python):
a = int(input())
if a >= 3200:
  print(input())
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(s)
else:
    print("red")

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

Solution (Python):
num = int(input())
s = input()
if num >= 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):
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):
import math
import fractions
import copy
import numpy as np
import heapq
def j(q):
    if q==1: print("Yes")
    elif q == 0:print("No")
    exit(0)
rem = pow(10,9)+7
"""
def ct(x,y):
    if (x>y):print("+")
    elif (x<y): print("-")
    else: print("?")
"""

def ip():
    return int(input())
def iprow():
    return [int(i) for i in input().split()]
def ips():
    return (int(i) for i in input().split())
def printrow(a):
    for i in a:
        print(i)
"""

def combinations(n,r):
    if n<r:return 0
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
def permutations(n,r):
    if n<r:return 0
    return math.factorial(n) // math.factorial(n - r)
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)
"""
if ip() >= 3200:
    print(input())
else:
    a = input()
    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(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):
rating = int(input())
s = input()

print(s if rating >= 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()
print(s if a >= 3200 else 'red')

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

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

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 sys
input=sys.stdin.readline
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):
a = int(input())
s = 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):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))

sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

a = INT()
s = input()

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

Solution (Python):
import sys
input = sys.stdin.readline


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

    ans = s if a >= 3200 else 'red'

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
a = int(input())
s = input()
print(s if a>=3200 else '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):


from collections import deque, defaultdict
import itertools as ite
import sys
import math

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

a = input()
s = raw_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):

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):



import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline 



a = int(input())

s = input()

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

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

if a < 3200:
    ans = 'red'
else:
    ans = s

print(ans)

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

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

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
from collections import deque

sys.setrecursionlimit(10**7)
inf = 10**20
mod = 10**9 + 7

DR = [1, -1, 0, 0]
DC = [0, 0, 1, -1]

def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
     
def main():
    a = I()
    s = S()
    if a >= 3200:
        print(s)
    else:
        print("red")

main()

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

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

Solution (Python):

import sys, math, fractions, itertools, collections, copy, heapq


def solve(a: int, s: str):
    if a >= 3200:
        print(s)
    else:
        print('red')
    return



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  
    s = next(tokens)  
    solve(a, s)

if __name__ == '__main__':
    main()

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()
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()
print([s, 'red'][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(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 = s if a >= 3200 else 'red'
print(ans)

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):
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):
import math
import sys
import queue
from collections import Counter
from itertools import accumulate
from fractions import gcd
from functools import reduce


def lcm(a, b):
    return a * b // gcd(a, b)

def combination_count(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))

def permutations_count(n, r):
    return math.factorial(n) // math.factorial(n - r)

sys.setrecursionlimit(10000)

mod = 1000000007

"""

a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654


char_list = list("abcd") 



    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())


    = int(sys.stdin.readline())
    = map(int, sys.stdin.readline().split())
    = list(map(int, sys.stdin.readline().split()))
    = [list(map(int,list(sys.stdin.readline().split()))) for i in range(N)]
"""

if __name__ == "__main__":
    N = int(sys.stdin.readline())
    S = sys.stdin.readline().rstrip()
    if N >= 3200:
        print(S)
    else:
        print("red")

Solution (Python):



import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

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

Solution (Python):
import sys
stdin = sys.stdin

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

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

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

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


if __name__ == '__main__':
    Solution().main()

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()

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):
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):
import sys

def input(): return sys.stdin.readline()[:-1]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def MATINT(h): return [list(map(int, input().split())) for _ in range(h)]
def MATSTR(h): return [input() for _ in range(h)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
inf = float('inf')
mod = 10 ** 9 + 7

def main():
    a = INT()
    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()

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())
P = input()
if A >= 3200:
    print(P)
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()
print("red" if a < 3200 else s)

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

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

Solution (Python):
import sys

def input():
    return sys.stdin.readline().rstrip()

if __name__ == "__main__":
    a = int(input())
    s = input()

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

Solution (Python):
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))

n = onem()

a = input()

if n >= 3200:
    print(a)
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 = 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')

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):
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())
b = input()
if a >= 3200:
    print(b)
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):


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 __name__ == '__main__':
    if a >= 3200:
        print(s)
    else:
        print('red')
    pass

Solution (Python):
import sys
input = sys.stdin.readline


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

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())
b = input()
if a >= 3200:
  print(b)
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):
import math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque

from itertools import product

from itertools import permutations

from itertools import combinations

from itertools import accumulate
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop

import re

from scipy.misc import comb





def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]
 
def i_inpl(): return int(input())
def l_inpl(): return list(map(int, input().split()))
def line_inpl(x): return [i_inpl() for _ in range(x)]

INF = int(1e30)
MOD = int(1e9)+7 


def create_grid(H, W, value = 0):
    return [[ value for _ in range(W)] for _ in range(H)]



def main():
    a = i_inpl()
    s = input()

    if 3200 <= a:
        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())
b=input()
if a<3200:
 print("red")
else:
 print(b)

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):
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()

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()
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):
a = int(input())
s = input()

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

Solution (Python):
a = int(input())
s = str(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):
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):

INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
    return int(n) - 1
def parse(*args):
    
    return tuple(p(v) for p, v in zip(args, input().split()))

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()
print(s 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()
if 3200<=a:
    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(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)
  exit()

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

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

if __name__ == "__main__":
    resolve()

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):
def main():
    a=int(input())
    s=input()
    if a>=3200:
        print(s)
    else:
        print("red")

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):
import math, string, itertools, fractions, heapq, collections, re,  array, bisect, sys, random, time, copy, functools, os
sys.setrecursionlimit(10**7)
inf = 10 ** 20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1, 0), (0, 1), (1, 0), (0, -1)]
ddn = [(-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1)]
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def _I(): return int(sys.stdin.readline())
def _F(): return float(sys.stdin.readline())
def _pf(s): return print(s, flush=True)
def perr(s): return print(s, file=sys.stderr)

a = _I()
s = 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(s)
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()

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()
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):


import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop

def main():
    a = int(input())
    s = input()
    print(s if a >= 3200 else '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):
import sys

input = sys.stdin.readline

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

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

Solution (Python):


def readInts():
  return [int(s) for s in input().split(" ")]

def main():
  a = readInts()[0]
  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 math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

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):
import sys
input = sys.stdin.readline

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):
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())
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())
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):


import sys
import math
import collections
import itertools
def input(): return sys.stdin.readline().strip()
def gcd(x, y): return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y): return (x * y) // gcd(x, y)
MOD = 10 **9 + 7

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()
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")