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):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,queue,copy

sys.setrecursionlimit(10**7)
inf=10**20
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 I(): return int(sys.stdin.readline())
def LS(): return sys.stdin.readline().split()
def S(): return input()

def main():
  a=I()
  s=S()

  if 3200<=a:
    return s
  return 'red'


print(main())

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


def main():
    a = int(input())
    s = str(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()
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 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 sys
import math
from collections import defaultdict


sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]


mod = 10**9 + 7


def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N):
    read_all = [tuple(map(int, input().split())) for _ in range(N)]
    return map(list,zip(*read_all))



a = I()
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):
import sys, re
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 LIST(): return list(map(int, 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):
a = int(input())
s = input()

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

print(ans)

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

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


sol()

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

Solution (Python):



import array
from bisect import *
from collections import *
import fractions
import heapq
from itertools import *
import math
import random
import re
import string
import sys


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

Solution (Python):





from collections import* 
from fractions import gcd
from functools import* 
from itertools import* 
from operator import mul,itemgetter
from bisect import* 
from heapq import* 
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import bisect
import heapq
import itertools
import math
import operator
import os
import re
import string
import sys
from collections import Counter, deque, defaultdict
from copy import deepcopy
from decimal import Decimal
from fractions import gcd
from functools import lru_cache, reduce
from operator import itemgetter, mul, add, xor

import numpy as np

if os.getenv("LOCAL"):
    sys.stdin = open("_in.txt", "r")

sys.setrecursionlimit(2147483647)
INF = float("inf")
IINF = 10 ** 18
MOD = 10 ** 9 + 7

a =int(sys.stdin.readline())
S = sys.stdin.readline().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()

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

Solution (Python):

import sys
sys.setrecursionlimit(300000)


def solve(a: int, s: str):
    ret = s
    if a < 3200:
        ret = 'red'
    print(ret)
    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):
s = int(input())
print(input() if s >= 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("red" if a<3200 else 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):
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()
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()

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 sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a = ni()
s = ns()
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
INF = float("inf")


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(s)
else:
	print("red")