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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# ABC138
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!

import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline #文字列入力のときは注意



a = int(input())
#b = [int(i) for i in readline().split()]
s = input()

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, fractions, itertools, collections, copy, heapq


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


# Generated by 1.1.4 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    a = int(next(tokens))  # type: int
    s = next(tokens)  # type: str
    solve(a, s)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
a = int(input())
s = input()
print([s, 'red'][a < 3200])

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

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

## 数値
    = 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")

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    Solution().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")

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

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

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

Submission status: Accepted

Solution code:
import sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
mod = 10**9+7
Max = sys.maxsize
def l(): #intのlist
    return list(map(int,input().split()))
def m(): #複数文字
    return map(int,input().split())
def onem(): #Nとかの取得
    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): #listをスペースごとに分ける
    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")

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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


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

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 math
import copy
from operator import mul
from functools import reduce
from collections import defaultdict
from collections import Counter
from collections import deque
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
# 一次元累積和
from itertools import accumulate
from bisect import bisect_left, bisect_right
from heapq import heappush, heappop

import re
# import numpy as np
from scipy.misc import comb

# 再帰がやばいとき
# import sys
# sys.setrecursionlimit(10**9)

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 # 10^9 + 7

# field[H][W]
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()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
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 a>=3200 else print("red")

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)

else:
  print("red")

Submission status: Accepted

Solution code:
# お約束
INF = float("inf")
MOD = int(1e9 + 7)
def int1(n):
    return int(n) - 1
def parse(*args):
    # (tuple(map(int, input().split())) for _ in range(N))
    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)

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

print("red")

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

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

if __name__ == "__main__":
    resolve()

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

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())
ss = input()

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

Submission status: Accepted

Solution code:
#

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

Submission status: Accepted

Solution code:
import sys

input = sys.stdin.readline

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

# 改行区切りの入力をn行読み込んで数値リストにして返します。
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')

Submission status: Accepted

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

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

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8

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()
# N, M = map(int, input().split())
# 横
# L = [int(x) for x in input().split()]
# 縦
# AS = [int(input()) for _ in range(N)]
# 多次元
# L = [[int(x) for x in input().split()] for _ in range(N)]

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

Submission status: Accepted

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



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

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

Submission status: Accepted

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

# main()
print(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())
s=input()

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#### import ####
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')

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

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


sol()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#import numpy as np
#from numpy import*
#from scipy.sparse.csgraph import shortest_path #shortest_path(csgraph=graph) # dijkstra# floyd_warshall
#from scipy.sparse import csr_matrix

from collections import* #defaultdict Counter deque appendleft
from fractions import gcd
from functools import* #reduce
from itertools import* #permutations("AB",repeat=2) combinations("AB",2) product("AB",2) groupby accumulate
from operator import mul,itemgetter
from bisect import* #bisect_left bisect_right
from heapq import* #heapify heappop heappushpop
from math import factorial,pi
from copy import deepcopy
import sys
sys.setrecursionlimit(10**8)
#input=sys.stdin.readline  #危険！基本オフにしろ！
 
def main():
    s=int(input())
    t=input()
    if s>=3200:
        print(t)
    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:
import sys
input = sys.stdin.readline

def main():
    a = int(input())
    # N, K = map(int, input().split())
    # a = list(map(int, input().split()))
    s = input().strip()
    
    if a >= 3200:
        print(s)
    else:
        print("red")

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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))  # type: int
    s = next(tokens)  # type: str
    solve(a, s)

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

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

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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))  # type: int
    s = next(tokens)  # type: str
    solve(a, s)


if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
def ron():
    a=[input('a number between 2800~5000 and color ') for i in range(0,2) ]
    k=int(a[0])
    if k>=2800:
        if k<=5000:
            pass
        else:
          print('Wrong input.Please input again.')
          ron()
         
    else:
        print('Wrong input.Please input again.')
        ron()
        
   

    if a[1]=='pink':
        s='red'
    elif a[1]=='red':
        s='pink'
    else:
        print('Wrong input.Please input again.')
        ron()
    if k>=3200:
        print(a[1])
    else:
        print(s)


ron()

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10 ** 6)
def input():
    return sys.stdin.readline()[:-1]

def dfs(v,prev = -1):
    for u in graph[v]:
        if u == prev:
            continue
        point[u] += point[v]
        dfs(u,v)

N, Q = list(map(int,input().split()))
graph = [[] for _ in range(N)]
point = [0]*N

for i in range(N-1):
    a,b = list(map(int,input().split()))
    graph[a-1].append(b-1)
    graph[b-1].append(a-1)

for i in range(Q):
    p,x = list(map(int,input().split()))
    p -= 1
    point[p] += x

dfs(0)
print(*point)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int,input().split()))
b = []

for x in a :
  b.append(1/x)
  
c = sum(b)
ans = 1/c
print(ans)

Submission status: Runtime Error

Solution code:
n = int(input())

s = list(map(int, input().split()))
t = []
v = 0

for i in range(n):
  c = 1/s[i]
  t.append(c)
  
for j in range(n):
  v += t[j]
  
ans = 1/v

print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n=int(input())
A=list(map(int,input().split()))
s=0
for i in range(n):
  s+=1/A[i]
print(1/s)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

if 3200 <= a <= 5000:
    print(input(s))
if 2800 <= a <3200:
    print("red")

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())

S = input()

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

Submission status: Runtime Error

Solution code:
a = int(input())

S = input()

if a >= 3200:
    print(s)

elif a < 3200:
    print('red')

Submission status: Runtime Error

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

if a >= 3200:
    answer = (s)
elif a < 3200:
    answer = ('red')

print(answer)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a, s, = map(input().split())

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

Submission status: Runtime Error

Solution code:
a,s = map (int,input().split())
a = int(input())
s = input()

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = input()

if a >= 3200:
    print('pink')

elif a < 3200:
    print('red')

Submission status: Runtime Error

Solution code:
a = int(input())

S = input()

if a >= 3200:
    print(s)

elif a < 3200:
    print('red')

Submission status: Runtime Error

Solution code:
# 数値と色の取得
a = int(input())
s = input()
 
# 数値で判断して文字列を出力
if a >= 3200:
    print(s)
elif:
    print("red")

Submission status: Runtime Error

Solution code:
# 数値と色の取得
a = int(input())
s = input()

# 数値で判断して文字列を出力
if a >=3200:
    print(S)
elif:
    print("red")

Submission status: Runtime Error

Solution code:
n,q=map(int,input().split())
ans=[0]*(n+1)
score=[0]*(n+1)
g=[[] for _ in range(n+1)]
for i in range(n-1):
    a,b=map(int,input().split())
    g[a].append(b)
for j in range(q):
    p,x=map(int,input().split())
    score[p]+=x
visited=set()
visited.add(1)
def dfs(v):
    global ans
    global score
    ans[v]+=score[v]
    for i in range(len(g[v])):
        if not g[v][i] in visited:
            ans[g[v][i]]+=ans[v]
            dfs(g[v][i])
dfs(1)
ans_chr=""
for i in range(1,n+1):
    ans_chr=ans_chr+str(ans[i])+" "
print(ans_chr)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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