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: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a=input()
b=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:
# -*- coding:utf-8 -*-

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

Submission status: Runtime Error

Solution code:
a = input()
s = input()
if s[0]>3199:
        print(s[1])
else:
        print ("red")

Submission status: Runtime Error

Solution code:
# -*- coding:utf-8 -*-
        s = [input() for i in range(3)]
        if s[0]>3199:
                print(s[1])
        else:
                print ("red")

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
from sys import stdin
from sys import setrecursionlimit as SRL; SRL(10**7)
rd = stdin.readline
rrd = lambda: map(int, rd().strip().split())

n, q = rrd()

v = [[] for _i in range(n + 10)]

for i in range(n - 1):
    x, y = rrd()
    v[x].append(y)
    v[y].append(x)

add = [0] * (n + 10)

for i in range(q):
    p, x = rrd()
    add[p] += x


def dfs(now, fa):
    add[now] += add[fa]
    for i in v[now]:
        if i == fa:
            continue
        dfs(i, now)


dfs(1, 0)

for i in range(1, n + 1):
    print(add[i], end=' ')

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(float, input().split()))

a.reverse()

answer = 0.0
for i in range(0, len(a)-1):
  a[i+1] = (a[i] + a[i+1]) / 2

print(a[len(a)-1])

Submission status: Runtime Error

Solution code:
import sys
a = input()[0]
s = input()[1]
if a < 3200:
  print("red")
else:
  print(s)

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:
num = int(input())
string = input()

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

Submission status: Runtime Error

Solution code:
from heapq import heappush, heappop
import queue
import re
import math
import functools
import numpy


def s_raw():
    return input().rstrip("\r")

def int_raw():
    return int(input())


def ss_raw():
    return input().split()


def ints_raw():
    return list(map(int, ss_raw()))


INF = 1 << 29


def make1d_arr(n, val=INF):
    return [val for i in range(n)]


def make2d_arr(h, w, val=INF):
    return [[val for i in range(w)]for i in range(h)]


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


def BFord(n,es):
    v_cost = [INF]*n
    v_cost[0] = 0
    for v in range(n*2):
        for e in es:
            frm = e[0]
            to = e[1]
            if v_cost[to] > v_cost[frm]+e[2]:
                v_cost[to] = v_cost[frm]+e[2]
                if v >= n:
                    v_cost[to] = -INF
        if v == n-1:
            prev = v_cost[:]
    v_cost = [-INF if prev[idx]!=v_cost[idx] else v_cost[idx] for idx in range(n)]
    return v_cost
    

def main():
    a = int_raw()
    s = s_raw()
    if a >=3200:
        return s
    else:
        return "red"

if __name__ == "__main__":
    print(main())

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

Submission status: Runtime Error

Solution code:
import collections
n, q = map(int, input().split())

tree = collections.defaultdict(list)
counter = {}
for _ in range(n-1):
    a, b = map(int, input().split())
    tree[a].append(b)
    counter[a] = 0
    counter[b] = 0

for _ in range(q):
    p, x = map(int, input().split())

    def add(p_, x_):
        counter[p_] += x_
        for v in tree[p_]:
            add(v, x_)

    add(p, x)

print(' '.join(str(v) for _, v in sorted(counter.items(), key=lambda x: x[0])))

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)
input = sys.stdin.readline

N,Q = map(int,input().split())
AB = [[x for x in map(int,input().split())] for _ in range(N-1)]
PX = [[x for x in map(int,input().split())] for _ in range(Q)]
 
graph = [[] for _ in range(N+1)]
for a,b in AB:
    graph[a].append(b)
    graph[b].append(a)
 
cnt = [0]*N
for p,x in PX:
    cnt[p-1] += x
 
def dfs(v):
    for w in graph[v]:
        cnt[w-1] += cnt[v-1]
        graph[w].remove(v)
        if len(graph[w]) > 0:
            dfs(w)
 
dfs(1)
 
print(*cnt)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10 ** 7)

N,Q = map(int,input().split())
AB = [[int(x) for x in input().split()] for _ in range(N-1)]
PX = [[int(x) for x in input().split()] for _ in range(Q)]

graph = [[] for _ in range(N+1)]
for a,b in AB:
    graph[a].append(b)
    graph[b].append(a)

value = [0] * (N+1)
for p,x in PX:
    value[p] += x

def dfs(v,parent,add):
    value[v] += add
    for x in graph[v]:
        if x == parent:
            continue
        dfs(x,v,value[v])

dfs(1,0,0)

answer = ' '.join(map(str,value[1:]))
print(answer)

Submission status: Runtime Error

Solution code:
a

Submission status: Runtime Error

Solution code:
N = int(input())
value_list = input().split()
value_list.sort()
i = 0

for i in range(N):
	if i == 0:
		new_value = int(value_list[i])
	else:
		new_value = (new_value + int(value_list[i])) / 2
    i += 1

print(new_value)

Submission status: Runtime Error

Solution code:
N = int(input())
v = list(map(int, input().split()))
vsort = sorted(v)
ans = (vsort[0]+vsort[1])/2

for i in range(N):
    if N <= 2:
        break
    else:
        ans = (ans + vsort[i])/2
        
print(ans)

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
N = int(input())
value_list = input().split()
value_list.sort()
i = 0
#value_list.reverse()
#print(value_list)
for i in range(N):
	if i == 0:
		new_value = int(value_list[i])
	else:
		new_value = (new_value + int(value_list[i])) / 2

print(new_value)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
N,Q=map(int,input().split())
a=[0]*(N-1)
b=[0]*(N-1)
p=[0]*Q
x=[0]*Q
for i in range(N-1):
  a[i],b[i]=map(int,input().split())
for i in range(Q):
  p[i],x[i]=map(int,input().split())
v=[0]*N
 
for i in range(Q):
  box=[]
  box.append(p[i])
  for k in range(N-1):
    if a[k] in box :
      box.append(b[k])
  for l in range(len(box)):
    num=box[l]-1
    v[num]+=x[i]
 
for h in range(N):
  print(v[h], end=" ")

Submission status: Runtime Error

Solution code:
import sys
import numpy as np
import bisect
s = input()
t = input()



count = 0
s_len = len(s)
s_list = np.zeros(len(s))
t_list = []*len(t)
indexes = []

for i in range(26):
  
  indexes.append([j for j, x in enumerate(s) if x == chr(i + ord('a')) ])
  

for i,k in enumerate(t):

  index = indexes[ord(k)-97]
  
  if len(indexes) == 0:
    print(-1)
    sys.exit(0)
  else:
    t_list.insert(i,index)
    


pre = -1
for i in range(len(t)):
  
  #high = [j  for j in t_list[i] if j > pre]
  high = bisect.bisect_left(t_list[i], pre) 

  if high >= len(t_list[i]):
    
    count += s_len - pre  + t_list[i][0]
    pre = t_list[i][0] 
  else:
    
    count += t_list[i][high] - pre 
    pre = t_list[i][high]

print(count)

Submission status: Runtime Error

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

if a>=3200:
    output=s
else :
    output="red"

print(output)

Submission status: Runtime Error

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

if (int(a) >= 3200)
b = 'red'

print(b)

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, Q = map(int, input().split(" "))
 
ns= [list(map(int, input().split(" ")))  for _ in range(N-1)]
 
flags = [False]*N
dic = [[] for _ in range(N)]
rlt = [0]*N
 
for i in range(N-1):
  dic[ns[i][1]-1] += [ns[i][0]-1]
  dic[ns[i][0]-1] += [ns[i][1]-1]
  
for p, x in (map(int, input().split()) for _ in range(Q)):
  rlt[p - 1] += x
 
que = [0]
while len(que):
  a = que.pop(0)
  flags[a] = True
  for e in dic[a]:
    if flags[e]:
      continue
    else:
      rlt[e] += rlt[a]
      que.append(e)
    
print(" ".join(map(str, rlt)))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
import sys
s = input()
t = input()
table = [[len(s) for i in range(len(s))] for j in range(26)]

for i in range(len(s)):
  table[ord(s[i])-97][i] = 0
for i in range(26):
  for j in range(len(s)):
    table[i][len(s)-j-2] = min(table[i][len(s)-j-1] +1, table[i][len(s)-j-2])
  for j in range(len(s)):
    table[i][len(s)-j-2] = min(table[i][len(s)-j-1] +1, table[i][len(s)-j-2])

for letter in t:
  if s.find(letter) == -1:
    print(-1)
    sys.exit()
    
place = 0
ans = 0
for i in range(len(t)):
  letter = t[i]
  move = table[ord(t[i])-97][place]
  ans += move + 1
  place = (place + move+1)%len(s)
print(ans)

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:
import sys
from heapq import *
sys.setrecursionlimit(10**8)

input = sys.stdin.readline

tree = [[] for _ in range(200001)]
res = [0]*200001

def dfs(p, pre):
    for child in tree[p]:
        if child == pre: continue
        res[child] += res[p]
        dfs(child, p)

def main():
    """ main """
    N, Q = map(int, input().split())
    for _ in range(N-1):
        a,b = map(int, input().split())
        tree[a].append(b)
        tree[b].append(a)
    for _ in range(Q):
        p,x = map(int, input().split())
        res[p] += x
    dfs(1, 0)

    print(*res[1:N+1])

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
import sys
from heapq import *
sys.setrecursionlimit(10**8)
 
input = sys.stdin.readline
tree = [[] for _ in range(200001)]
scores = [0 for _ in range(200001)]

def dfs(pre, p):
    for child in tree[p]:
        if child == pre: continue
        scores[child] += scores[p]
        dfs(p, child)

def main():
    N, Q = map(int, input().split())
    for _ in range(N-1):
        a, b = map(int, input().split())
        tree[a].append(b)
        tree[b].append(a)

    for _ in range(Q):
        p, x = map(int, input().split())
        scores[p] += x
    dfs(0, 1)
    print(' '.join(map(str, scores[1:N+1])))

if __name__ == '__main__':
    main()

Submission status: Runtime Error

Solution code:
N=int(input())
v=[int(i) for i in input().split()]
v.sort()
 
res = v[0]
for i in range(1,N):
    res = (res+v[i])/2
print(res)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n, q = map(int, input().split())
d = {}
v = {}
for _ in range(n - 1):
    a, b = input().split()
    if a not in d:
        d[a] = [b]
    else:
        d[a].append(b)
    if b not in d:
        d[b] = []

for key in d.keys():
    v[key] = 0

for _ in range(q):
    node, increment = input().split()
    queue = [node]
    all_childs = [node]
    while len(queue) > 0:
        el = queue.pop()
        if el not in all_childs:
            all_childs.append(el)
        childs = d[el]
        if len(childs) > 0:
            queue.extend(d[el])
    for child in all_childs:
        v[child] += int(increment)

for value in v.values():
    print(value, end=' ')
print('')

Submission status: Runtime Error

Solution code:
def main():
	inp = [int(input()) for i in range(2)]
	a = inp[0]
	s = inp[1]
	red = "red"

  if a < 3200:
    print red
  else:
    print s

Submission status: Runtime Error

Solution code:
inp = [int(input()) for i in range(2)]
a = inp[0]
s = inp[1]
red = "red"

if a < 3200:
  print red
else:
  print s

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
count = int(input())
numlist = list(map(int, sorted(input().split())))
result = 0

"""
for i in range(count-1):
  result = (numlist[i+1] + numlist[i]) / 2
"""

  #resultの結果をもう一回listに戻してsortする必要があるかも
  
while len(numlist) >= 2:
  sum = (numlist[1] + numlist[0]) / 2
  del numlist[0:2] #0,1番目の要素を削除
  numlist.append(sum)
  numlist = sorted(numlist)
  #print(sum)
  #print(numlist)
  
print(sum)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:


a = input()
s = input()

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>

using namespace std;

int main(){
  int a; 
  string s;
  cin >> a >> s;

  if (a < 3200) {
    cout << "red" << endl;
  } else {
    cout << s << endl;
  }
}

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))

ans = 1 / sum(1 / a for a in A)
print(ans)

Submission status: Runtime Error

Solution code:
N = int(input())
L = input().split()
L.sort()
c = 0
for a in range(N):
    if a == 0:
        c = c + float(L[0])*pow(0.5, N - 1)
    else:
        c = c + float(L[a])*pow(0.5, N - a)
print(c)

Submission status: Runtime Error

Solution code:
N = int(input())
L = input().split()
L.sort()
c = 0
for a in range(N):
    if a == 0:
        c = c + float(L[0])/pow(2, N - 1)
    else:
        c = c + float(L[a])/pow(2, N - a)
print(c)

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

N, Q = map(int,input().split())

# AB = [[int(x) for x in input().split()] for _ in range(N-1)]

# print(AB)

# 添字を1からにしたいのでN+1
graph = [[] for _ in range(N+1)]

# 各頂点に隣接する頂点
for _ in range(N-1):
    a, b = map(int, input().split())
    graph[a].append(b)
    graph[b].append(a)

# print(graph)
counter = [0] * (N+1)

# print(counter)

# PX = [[int(x) for x in input().split()] for _ in range(Q)]

# 各頂点に点数を足す
for _ in range(Q):
  p, x = map(int, input().split())
  counter[p] += x


def shori(pa,c,val):
  val += counter[c]
  counter[c] = val
  for i in graph[c]:
    if i == pa:
      continue
    shori(c,i,val)
  
shori(0,1,0)
  

print(" ".join(map(str, counter[1:])))

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
n = int(input())
v = sorted(list(map(int, input().split())), reverse = False)
for i in range(1, n):
    v[0] = (v[0] + v[i]) / 2
print(v[0])

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <string>

using namespace std;

int main(){
  int a;
  string s;
  cin >> a >> s;
  if(a < 3200){
    cout << "red" << endl;
  }else{
    cout << s << endl;
  }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding:utf-8

a = int(input())
n = list(map(int, input().split()))

ind = n.index(min(n))
POT = n.pop(ind)

for i in range(0, len(n)):
    ind = n.index(min(n))
    POT = (POT + n.pop(ind)) / 2

print(POT)

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

Submission status: Runtime Error

Solution code:
N, M = input().strip().split()
n = int(N)

if 3200 <= n:
    print(M)
else:
    print("red")

Submission status: Runtime Error

Solution code:
from collections import deque

n, q = map(int, input().split())
G = [[] for yy in range(n)]
count = [0]*n
flag=[False]*n
stack = deque([0])

for _ in range(n-1):
  a, b = map(int, input().split())
  G[a-1].append(b-1)
  G[b-1].append(a-1)
  
for _ in range(q):
  p, x = map(int, input().split())
  count[p-1] += x

stack.append(0)
while stack:
  v = stack.pop()
  flag[v] = True
  for e in G[v]:
    if flag[e]:
      continue
    count[e] += count[v]
    stack.append(e)

print(*count)

Submission status: Runtime Error

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

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

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

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

Submission status: Runtime Error

Solution code:
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:
n,m = map(int,input().split())
tree_list  = []
answer_list = [0]
for i in range(n-1):
    tree_list.append(list(map(int,input().split())))
    answer_list.append(0)
for i in range(m):
    num1,num2 = map(int,input().split())
    answer_list[num1-1] +=  num2
for i in range(n): 
    true = True
    while true:
        true = False
        print(i)
        for _ in tree_list:
            if i == _[0]-1:
                answer_list[_[1]-1] += answer_list[i]
                tree_list.remove(_)
                true = True
for i in answer_list:
    print(i)

Submission status: Runtime Error

Solution code:
num = input().split()

if int(num[0]) >= 3200:
  print(num[1])
else:
  print("red")

Submission status: Runtime Error

Solution code:
num = input().split()

print(num[1]) if int(num[0]) >= 3200 else print("red")

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
def get_answer(ki):
    n = int(ki[0].split(" ")[0])
    q = int(ki[0].split(" ")[1])
    n_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[1:-q]]]
    q_data = [[int(k[0]), int(k[1])] for k in [k.split(" ") for k in ki[-q:]]]
    tree = make_tree(n, n_data)

    score = [0] * n

    for qq in q_data:
        index = qq[0]
        add_score(tree, score, qq, n_data, index)

    #score = [str(s) for s in score]
    #s = " ".join(score)
    for s in score:
        print(s, end="")
        print(" ", end="")

    return None


def add_score(tree, score, qq, n_data, index):
    score[index - 1] += qq[1]
    next_index = tree[index -1]
    for n_i in next_index:
        add_score(tree, score, qq, n_data, n_i)


def make_tree(n, n_data):
    r = {}
    for i in range(n):
        r[i] = []
    for n in n_data:
        k = n[0] - 1
        if k in r.keys():
            r[k].append(n[1])
        else:
            r[k] = [n[1]]
    return r


def make_index(n, tree):
    index = {}
    r0 = [0] * n
    for i in range(n):
        r0[i] = i
    index[0] = r0

    for i in range(1, n):
        r = []
        add_index(tree, i, r)
        index[i] = r

    return index


def add_index(tree, index, r):
    r.append(index)
    next_index = tree[index]
    for n_i in next_index:
        add_index(tree, n_i - 1, r)


if __name__ == "__main__":
    input_ki = []
    while True:
        try:
            input1 = input()
            if not input1:
                break;
            if len(input1) == 0:
                break;
            input_ki.append(input1)
        except EOFError:
            break
    get_answer(input_ki)

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:

level = input()
color = input()

if level <= 3200:
    print('red')
elif level > 3200:
    print(color)

Submission status: Runtime Error

Solution code:
n, q = map(int, input().split())

tree = {i:[] for i in range(1, n + 1)}
for _ in range(1, n):
    a, b = map(int, input().split())
    tree[a].append(b)
    tree[b].append(a)

tmp = [1]
while len(tmp) != 0:
    tmp2 = tmp
    tmp = []
    for oya in tmp2:
        tmp.extend(tree[oya])
        for ko in tree[oya]:
            tree[ko].remove(oya)


cnt = [list(map(int, input().split())) for _ in range(q)]

ans = [0]*n
for p, x in cnt:
    tmp = [p]
    while len(tmp) != 0:
        for i in tmp:
            ans[i-1] += x
        tmp2 = tmp
        tmp = []
        for aaa in tmp2:
            tmp.extend(tree[aaa])


print(" ".join(map(str, 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:
if a >=3200
    print(s)
else 
    print("red")

Submission status: Runtime Error

Solution code:
if a ＞＝　3200
    print(s)
elif
    print("red")

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
import java.util.*;

public class Main{
  public static void main(String[] args){
    Scanner sc = new Scanner(System.in);
    int a = Integer.parseInt(sc.next());
    String s = sc.next();

    if(a>=3200){
      System.out.println(s);
    }
    else{
      System.out.println("red");
    }
  }
}

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
print(max([a+b, a-b, a*b]))

Submission status: Runtime Error

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

Submission status: Runtime Error

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
s = 'pink'
if a >= 3200:
    print(s)
elif a < 3200:
    print('red')

Submission status: Runtime Error

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

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:
import sys
import numpy as np
from functools import reduce
from operator import itemgetter

N, Q = map(int,input().split())
tree_list = [list(map(int, input().split())) for i in range(N-1)]
counter = [0] * N

for i in range(Q):
    node ,inc = input().split()
    node = int(node)
    counter[node-1] = int(inc)

#sort
tree_list.sort(key=itemgetter(0))
for pa, ch in tree_list:
    counter[ch-1] += counter[pa-1]

print(' '.join(map(str, counter)))

Submission status: Runtime Error

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

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

Submission status: Runtime Error

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

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

Submission status: Runtime Error

Solution code:
a,s = [input() for i in  range(2)]

a = int(a)

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

Submission status: Runtime Error

Solution code:
a = input("input number: ")

if a < 28000 or a >= 5000:
  return false
elif a >= 3200:
  return s
else:
  return "red"

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
def main():
    N = input()
    in_value = [float(i) for i in input().split(' ')]

    sort_value = sorted(in_value)

    if(N != 1):
        while(len(sort_value) != 1):
            sort_value = [(sort_value.pop(0) + sort_value.pop(0)) / 2] + sort_value
                       
    print(sort_value[0])


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
if int(input()) < 3200:
    return 'red'
else:
    return input()

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
# coding:utf8

N = int(input())
A = list(map(int, input().strip().split()))
s = 0
for i in range(N):
    s += 1.0/(A[i])
s = 1.0/s

print(s)

Submission status: Runtime Error

Solution code:
# coding:utf8

N = input()
A = list(map(int, input().strip().split()))
s = 0
for i in range(N):
    s += 1.0/(A[i])
s = 1.0/s

print(s)

Submission status: Runtime Error

Solution code:
# coding:utf8

N = input()
A = input().split()

s = 0
for i in range(N):
    s += 1.0/int(A[i])
s = 1.0/s

print(s)

Submission status: Runtime Error

Solution code:
# coding:utf-8

num = int(input())
chr = input()

if num=<3200:
  print(chr)
else:
  print("red")

Submission status: Runtime Error

Solution code:
color = input()



if color >= 3200:
  print(str(color))
else:
  print('red')

Submission status: Runtime Error

Solution code:
color = input()
if color > 3199:
  print(str(color))
else:
  print('red')

Submission status: Runtime Error

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

Submission status: Runtime Error

Solution code:
color = input()
if color >= 3200:
  print(color)
  else:
  print('red')

Submission status: Runtime Error

Solution code:
color = input()
if color >= 3200:
  print(color)
  else
  print('red')

Submission status: Runtime Error

Solution code:
def ifLessThanA(a, s):
	if a >= 3200:
    	print(s)
 	else:
      	print("red")

Submission status: Runtime Error

Solution code:
n = int(input())
v = [int(i) for i in input().split()]
v.sort()
ans = v[0]
for i in range(2, len(v)):
    ans = (ans + v[i]) / 2
print(ans)

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

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

Submission status: Runtime Error

Solution code:
あ

Submission status: Runtime Error

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

sum = 0.0
for x in a:
  sum = sum + 1 / x

print(1/sum)