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.



Sample input:
3200
pink


Sample output:
pink

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
def input():
    return sys.stdin.readline()[:-1]
from bisect import *
from collections import *
from heapq import *
from math import *
from itertools import *

N = int(input())
s = input()
ans = 'red' if N < 3200 else s
print(ans)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
from sys import stdin

n = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()

ans = s

if n < 3200:
  ans = "red"

print(ans)

Submission status: Accepted

Solution code:
import sys
from collections import Counter
input = sys.stdin.readline

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin,stdout
I = lambda : map(stdin.readline().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力
a = int(input())
# 文字列の入力
s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a>3199:
	print(s)
else:
	print('red')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
mod = 1000000007
def get_array(): return list(map(int, sys.stdin.readline().split()))
def get_ints(): return map(int, sys.stdin.readline().split())
def input(): return sys.stdin.readline()
def main():
    a = int(input())
    s = input()
    print(s if a >= 3200 else 'red')
if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a=int(input())
s=input()
if(a>=3200):
    print("{}".format(s))
else:
    print("{}".format("red"))

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
s = raw_input()
t = raw_input()

x = int(s)
if x < 3200:
	print 'red'
else:
	print t

Submission status: Accepted

Solution code:
a = int(input())
S = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3


# 'pink', 'red'

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


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

    ans = solve(a, s)

    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# 整数の入力


def main():
    # a, b
    a = int(input())
    s = input()
    print(process(a, s))


def process(a, s):
    if a >= 3200:
        return s
    else:
        return 'red'


if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
n1 = int(input())
s1 = input()

if n1 < 3200:
    s1 = "red"

print(s1)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:

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

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

Submission status: Accepted

Solution code:
import logging

logging.basicConfig(level=logging.INFO, format="%(message)s")
#logging.disable(logging.CRITICAL)

def main():
    a = int(input())
    S = input()

    if a >= 3200:
        print(S)
    else:
        print("red")
    
if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

if a<3200:
    print('red')

else:
    print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
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 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

a = INT()
s = input()

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

Submission status: Accepted

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


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#coding:utf-8
a = int(input())
s = input()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    a = int(input())
    s = input()

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
from sys import stdin
import math
import fractions
from collections import deque
from collections import Counter
import itertools

INF = 10 ** 10

a = int(stdin.readline().rstrip())
s = stdin.readline().rstrip()

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

Submission status: Accepted

Solution code:
''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''
#codeforces1203A_live
gi = lambda : list(map(int,input().split()))
n, = gi()
s = input()
if n >= 3200:
	print(s)
else:
	print("red")

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
a = int(input()) # 数字を変数に格納
s = input() # 文字列を変数に格納

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

Submission status: Accepted

Solution code:
a = int(input().split()[0])
s = input().split()[0]

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#  --*-coding:utf-8-*--

def main():
    A = int(input())
    S = input()

    print("red" if A < 3200 else S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
a = input()
s = raw_input()

print s if a>=3200 else "red"

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=int(input())
s=input()
ans="red"
if a>=3200:
  ans=s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
v=int(input())
s=input()
if v < 3200 :
  print('red')
else :
  print(s)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N = int(input())
x = input()
if N <3200:
  print("red")
else:
  print(x)

Submission status: Accepted

Solution code:
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

"""
# 0埋め, 小数点出力桁指定時のときの出力
a = 100
b = 0.987654321
print("{0:06d}-{1:6f}".format(a,b))
000100-0.987654

# 文字列をリストに格納
char_list = list("abcd") # ["a","b","c","d"]

# 標準入力取得
## 文字列
    = sys.stdin.readline().rstrip()
    = list(sys.stdin.readline().rstrip())
    = [list(list(sys.stdin.readline().rstrip())) for i in range(h)]

## 数値
    = 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__":
    a= int(sys.stdin.readline())
    s= sys.stdin.readline().rstrip()
    if a >=3200:
        print(s)
    else:
        print("red")

Submission status: Accepted

Solution code:
rate = int(input())
s = input()
if rate < 3200:
    print("red")
else:
    print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math;

def swap(a,b):
    return (b,a)

def gcd(a,b):
    if (a<b):
        a,b = swap(a,b)
    if (b==0):
        return a
    else:
        return gcd(b,a%b)

xm = [1,0,-1,0]
ym = [0,1,0,-1]

def bfs(y,x):
    if (y==gy and x==gx):
        return
    for i in range(4):
        for j in range(4):
            if (c[y+ym[i]][x+xm[j]]=='#'):
                continue
            if (aom[y+ym[i]][x+xm[j]]!=-1):
                continue
            aom[y+ym[i]][x+xm[j]] = aom[y][x] + 1

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

    print('red')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a = int(input())
s = input()
if a >= 3200:
    print(s)
else:
    print("red")

Submission status: Accepted

Solution code:
# coding: UTF-8
import sys
#sys.setrecursionlimit(n)
import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A = int(input())
S = input()
if A>=3200:
    print(S)
else:
    print("red")

Submission status: Accepted

Solution code:
'''
allinputs = iter(input().splitlines())
input = lambda : next(allinputs)
#'''
a = int(input())
s = input()

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

Submission status: Accepted

Solution code:
# A
a = int(input())
s = str(input())

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

Submission status: Accepted

Solution code:
import collections


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

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



if __name__== "__main__":
    main()

Submission status: Accepted

Solution code:
a = int(input())

s = str(input())

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

Submission status: Accepted

Solution code:
num = int(input())
string = input()

if(num >= 3200):
  print(string)
else:
  print('red')

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

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

main()

Submission status: Accepted

Solution code:
import sys
def input(): return sys.stdin.readline().strip()

i  = lambda: int(input())
s  = lambda: input()

A = i()
S = s()

if A >= 3200:
  print(S)
else:
  print('red')

Submission status: Accepted

Solution code:
#!/usr/bin/env python
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip


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

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


# region fastio

BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        while True:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            if not b:
                break
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines = 0
        return self.buffer.read()

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


class IOWrapper(IOBase):
    def __init__(self, file):
        self.buffer = FastIO(file)
        self.flush = self.buffer.flush
        self.writable = self.buffer.writable
        self.write = lambda s: self.buffer.write(s.encode("ascii"))
        self.read = lambda: self.buffer.read().decode("ascii")
        self.readline = lambda: self.buffer.readline().decode("ascii")


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", " "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", "\n"))
    if kwargs.pop("flush", False):
        file.flush()


if sys.version_info[0] < 3:
    sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
else:
    sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)

input = lambda: sys.stdin.readline().rstrip("\r\n")

# endregion

if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:

N = int(input())
s = input()

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

Submission status: Accepted

Solution code:
a = int(input())
s = input()
if a >= 3200:
  print(s)
if a < 3200:
  print("red")

Submission status: Accepted

Solution code:
a = int(input())
b  = input()

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

Submission status: Accepted

Solution code:
a = int(input())
# n, *a = map(int, open(0))
# abs = map(int, input().split())
s = input()
if a < 3200:
    s = "red"
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from fractions import gcd
import math

mod = 1000000007


def inverse(a):
    return pow(a, mod - 2, mod)


def usearch(x, a):
    lft = 0
    rgt = len(a) + 1
    while rgt - lft > 1:
        mid = (rgt + lft) // 2
        if a[mid] <= x:
            lft = mid
        else:
            rgt = mid
    return lft


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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline

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

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

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
a = int(input())
s = input()
if a < 3200:
    print("red")
else:
    print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
def get_array(): return list(map(int , sys.stdin.readline().strip().split()))
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def input(): return sys.stdin.readline().strip()

a=int(input())
string=input()
if a<3200:
  print('red')
else:
  print(string)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
# coding: utf-8

def ri():
    return int(input())

def rl():
    return list(input().split())

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
c=int(input())
s=input()
if c < 3200:
    s="red"
print(s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def resolve():
    a = int(input())
    s = input()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import decimal,math
from collections import Counter,defaultdict
from fractions import gcd
from bisect import bisect_right,bisect_left
decimal.getcontext().prec = 10
N=int(raw_input())
s=raw_input()
if(N<3200):
	print "red"
else:
	print s	
# f=map(int,raw_input().split())

Submission status: Accepted

Solution code:
import numpy as np
import math
import sys
sys.setrecursionlimit(10000000)

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	a = inputInt()
	s = input()
	s = s[:-1]

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


if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A=int(input())
S=input()

if A>=3200:
    print(S)
else:
    print('red')