qyliang/CodeNanoFix huggingface dataset:
# Buggy code:
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans1 = []
ans2 = []

for x in range(N):
    if x == 0:
        ans1.append(A1[x])
        ans2.append(A1[x] + A2[x])
    else:
        ans1.append(ans1[x - 1] + A1[x - 1])
        ans2.append(max(ans1[x], ans2[x - 1]) + A2[x])
print(ans2[N - 1])


# Fixed code:
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))
ans1 = []
ans2 = []

for x in range(N):
    if x == 0:
        ans1.append(A1[x])
        ans2.append(A1[x] + A2[x])
    else:
        ans1.append(ans1[x - 1] + A1[x])
        ans2.append(max(ans1[x], ans2[x - 1]) + A2[x])
print(ans2[N - 1])
# Buggy code:
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
count = 0
max1 = 0
for i in range(n):
    for j in range(n):
        if j < i:
            count += a1[j]
            print (i,j,count)
        elif j==i:
            count += (a1[j] + a2[j])
            print (i,j,count)
        else:
            count += a2[j]
            print (i,j,count)
    if max1 < count:
        max1 = count
    print (count,max1)
    count = 0
print (max1)

# Fixed code:
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
count = 0
max1 = 0
for i in range(n):
    for j in range(n):
        if j < i:
            count += a1[j]
        elif j==i:
            count += (a1[j] + a2[j])
        else:
            count += a2[j]
    if max1 < count:
        max1 = count
    count = 0
print (max1)
# Buggy code:
N = int(input())
A = [list(map(int,input().split())) for _ in range(2)]

ma = 0
for i in range(1,N):
  ma = max(ma, sum(A[0][:i+1])+sum(A[1][i:N]))
print(ma)

# Fixed code:
N = int(input())
A = [list(map(int,input().split())) for _ in range(2)]

ma = 0
for i in range(N):
  ma = max(ma, sum(A[0][0:i+1])+sum(A[1][i:]))
print(ma)
# Buggy code:
N = int(input())
x_list = list(map(int, input().split()))
y_list = list(map(int, input().split()))
ans = 0
if N == 1:
	print(x_list[0] + y_list[0])
else:
	for i in range(1, N+1):
		a = sum(x_list[0:i]) + sum(y_list[i:N+1])
		if ans < a:
			ans = a
	print(ans)

# Fixed code:
N = int(input())
x_list = list(map(int, input().split()))
y_list = list(map(int, input().split()))
ans = 0
if N == 1:
	print(x_list[0] + y_list[0])
else:
	for i in range(N):
		a = sum(x_list[0:i+1]) + sum(y_list[i:N])
		if ans < a:
			ans = a
	print(ans)
# Buggy code:
n=int(input())
line1=list(map(int,input().split()))
line2=list(map(int,input().split()))
line=[line1,line2]
point=0
place=0
def judge(i):
  status1=0
  status2=0
  possible=1
  for k in range(n-i-1):
    status1+=line[0][i+k+1]
    status2+=line[1][i+k]
    if status1>=status2:
      possible=0
      break
  return possible
for i in range(n):
  point+=line[place][i]
  if judge(i)==1:
    place=1
    point+=[place][i]
print(point)

# Fixed code:
n=int(input())
line1=list(map(int,input().split()))
line2=list(map(int,input().split()))
line=[line1,line2]
point=0
place=0
def judge(i):
  status1=0
  status2=0
  possible=1
  for k in range(n-i-1):
    status1+=line[0][i+k+1]
    status2+=line[1][i+k]
    if status1>=status2:
      possible=0
      break
  return possible
for i in range(n):
  point+=line[place][i]
  if place==0 and judge(i)==1:
    place=1
    point+=line[place][i]
print(point)
# Buggy code:
N = int(input())

a = [list(map(int,input().split())) for i in range(2)]
saidaiti = []
for i in range(N):
     saidaiti.append(sum(a[0][:i+1]+a[1][i:]))
     print(a[0][:i+1])
     print(a[1][i:])
print(max(saidaiti))

# Fixed code:
N = int(input())

a = [list(map(int,input().split())) for i in range(2)]
saidaiti = []
for i in range(N):
     saidaiti.append(sum(a[0][:i+1]+a[1][i:]))
print(max(saidaiti))
# Buggy code:
N=int(input())
li = []

for n in range(2):
  li.append(list(map(int,input().split())))

max = 0

for x in range(N):
  now = 0
  for y in range(x):
    now += li[0][y]

  for y in range(N - x):
    now += li[0][y]
    
  now += li[1][N-1]

  if max < now:
    max = now

print(max)

# Fixed code:
N=int(input())
li = []

for n in range(2):
  li.append(list(map(int,input().split())))

max = 0

for x in range(N):
  now = 0
  
  for y in range(x + 1):
    now += li[0][y]

  for y in range(N):
    if y < x:
      continue
    now += li[1][y]

  if max < now:
    max = now

print(max)
# Buggy code:
# -*- coding:utf-8 -*-
import sys
N=int(input())
List_1=[map(int,input()split())]
List_2=[map(int,input()split())]

answer=[]
for i in range(N):
  score+=sum(List_1[:i])
  score+=sum(List_2[i:])
  answer.append(score)
  score=0

print(max(answer))

# Fixed code:
# -*- coding:utf-8 -*-
import sys
N=int(input())
List_1=list(map(int,input().split()))
List_2=list(map(int,input().split()))

answer=[]
score=0
for i in range(N):
  score+=sum(List_1[:i+1])
  score+=sum(List_2[i:])
  answer.append(score)
  score=0

print(max(answer))
# Buggy code:
n, *a = map(int, open(0).read().split())
m = 0
for i in range(n+1):
  m = max(m, sum(a[:i] + a[n+i:]))
print(m)

# Fixed code:
n, *a = map(int, open(0).read().split())
m = 0
for i in range(n): m = max(m, sum(a[:i+1] + a[n+i:]))
print(m)
# Buggy code:
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))

maxn=0
for i in range(n):
  maxn=max(maxn,sum(a[:i+1],b[i:]))
print(maxn)

# Fixed code:
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
maxn=0
for i in range(n):
    maxn=max(maxn,sum(a[:i+1])+sum(b[i:]))
print(maxn)
# Buggy code:
N = int(input())
A = [[int(i) for i in input().split()] for j in range(2)]
count = 0
Max = 0

for i in range(N):
    for j in range(i+1):
        count += A[0][j]
    for j in range(N-i-1):
        count += A[1][i+j]
    Max = max(Max, count)

print(Max)


# Fixed code:
N = int(input())
A = [[int(i) for i in input().split()] for j in range(2)]
count = 0
Max = 0

for i in range(N):
    for j in range(i+1):
        count += A[0][j]
    for j in range(N-i):
        count += A[1][i+j]
    Max = max(Max, count)
    count = 0

print(Max)
# Buggy code:
n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))

ttl = 0
li1 = []
for i in range(n):
    ttl += a1[i]
    li1.append(ttl)

ttl = 0
li2 = []
for i in range(1,n+1):
    ttl += a2[i*(-1)]
    li2.append(ttl)

ans = 0
for i in range(n):
    ans = max(ans,li1[i]+li2[i])

# Fixed code:
n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))

ttl = 0
li1 = []
for i in range(n):
    ttl += a1[i]
    li1.append(ttl)

ttl = 0
li2 = []
for i in range(1,n+1):
    ttl += a2[i*(-1)]
    li2.append(ttl)

ans = 0
for i in range(n):
    #print(li1[i]+li2[i])
    ans = max(ans,li1[i]+li2[(i+1)*(-1)])

print(ans)
# Buggy code:
n = int(input())
a = [[int(i) for i in input().split()] for i in range(2)]   

print(a)
    
ans = 0
for i in range(n):
    ans = max(ans,(sum(a[0][0:i+1])+sum(a[1][i:n])))

print(ans)

# Fixed code:
n = int(input())
a = [[int(i) for i in input().split()] for i in range(2)]   
    
ans = 0
for i in range(n):
    ans = max(ans,(sum(a[0][0:i+1])+sum(a[1][i:n])))

print(ans)
# Buggy code:
n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
s1 = [a1[0]]
s2 = [a2[-1]]
for i in range(n-1):
  s1 += [s1[i]+a1[i+1]]
  s2 += [s2[i]+a2[n-i-2]]

ans = 0
for i in range(n):
  ans += max(ans, s1[i] + s2[n-1-i])
print(ans)

# Fixed code:
n = int(input())
a1 = list(map(int,input().split()))
a2 = list(map(int,input().split()))
s1 = [a1[0]]
s2 = [a2[-1]]
for i in range(n-1):
  s1 += [s1[i]+a1[i+1]]
  s2 += [s2[i]+a2[n-i-2]]
 
ans = 0
for i in range(n):
  ans = max(ans, s1[i] + s2[n-1-i])
print(ans)
# Buggy code:
import numpy as np

N = int(input())
a1 = list(map(int, input().split(' ')))
a2 = list(map(int, input().split(' ')))
count = np.zeros(N)
a = np.array([a1,a2])
for i in range(N):
    count[i] += a.T[i].sum()
    count[i] += a[0][:i-1].sum() if i-1 >=0 else 0
    count[i] += a[1][i:].sum()
print(int(count.max()))

# Fixed code:
import numpy as np

N = int(input())
a1 = list(map(int, input().split(' ')))
a2 = list(map(int, input().split(' ')))
count = np.zeros(N)
a = np.array([a1,a2])
for i in range(N):
    count[i] += a.T[i].sum()
    count[i] += a[0][:i].sum()
    count[i] += a[1][i+1:].sum() if i+1 < N else 0
print(int(count.max()))
# Buggy code:
N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))
A3=[]
A4=[0]
for i in range(N):
  A3.append(sum(A1[0:i]))
for i in range(N):
  A4.append(sum(A2[0:i]))
ans=0
for i in range(N):
  ans = max(ans, A3[:i]+A4[i:])
print(ans)


# Fixed code:
N = int(input())
A1 = list(map(int,input().split()))
A2 = list(map(int,input().split()))

A3=[sum(A1[0:i+1]) for i in range(N)]
A4=[0] + [sum(A2[0:i+1]) for i in range(N)]
ans=0
for i in range(N):
  ans = max(ans, A3[i]+A4[N]-A4[i])
print(ans)
# Buggy code:
N=int(input())
row_1=list(map(lambda x:int(x),input().split()))
row_2=list(map(lambda x:int(x),input().split()))

max_value=0

for i in range(1,N):
    sum_row_1=sum(row_1[0:i])
    sum_row_2=sum(row_2[i-1:N])
    print(row_1[0:i],row_2[i-1:N],sum_row_1,sum_row_2)
    if max_value<sum_row_1+sum_row_2:max_value=sum_row_1+sum_row_2

print(max_value)


# Fixed code:
N=int(input())
row_1=list(map(lambda x:int(x),input().split()))
row_2=list(map(lambda x:int(x),input().split()))

max_value=0

for i in range(N):
    sum_row_1=sum(row_1[0:i+1])
    sum_row_2=sum(row_2[i:N])
    if max_value<sum_row_1+sum_row_2:max_value=sum_row_1+sum_row_2

print(max_value)
# Buggy code:
n = int(input())
a1list = list(map(int, input().split()))
a2list = list(map(int, input().split()))

countlist = []
for i in range(n):
  p = sum(a1list[0:i]) + sum(a2list[i:n-1])
  countlist.append(p)
  
print(max(countlist))

# Fixed code:
n = int(input())
a1list = list(map(int, input().split()))
a2list = list(map(int, input().split()))

countlist = []
for i in range(n):
  p = sum(a1list[0:i+1]) + sum(a2list[i:n])
  countlist.append(p)
  
print(max(countlist))
# Buggy code:
n=int(input())
a=[list(map(int,input().split())) for i in range(2)]
ans=0
for i in range(n):
  cnt=0
  for j in range(i+1):
    cnt+=a[j][0]
  for j in range(i,n):
    cnt+=a[j][1]
  ans=max(ans,cnt)
print(ans)

# Fixed code:
n=int(input())
a=[list(map(int,input().split())) for i in range(2)]
ans=0
for i in range(n):
  cnt=0
  for j in range(i+1):
    cnt+=a[0][j]
  for j in range(i,n):
    cnt+=a[1][j]
  ans=max(ans,cnt)
print(ans)
# Buggy code:
N = int(input())
A1 = [[int(i) for i in input().split(" ")], [int(i) for i in input().split(" ")]]

sum_point = 0
tmp =0
for i in range(N - 1):
    tmp = max(tmp, sum(A1[0][i + 1:]) + sum(A1[1][i:]))

print(tmp)


# Fixed code:
N = int(input())
A1 = [[int(i) for i in input().split(" ")], [int(i) for i in input().split(" ")]]

sum_point = 0
tmp =0
for i in range(N):
    tmp = max(tmp, sum(A1[0][:i + 1]) + sum(A1[1][i:]))

print(tmp)
# Buggy code:
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
sum1 = 0
sum2 = 0
ans_list = []
for i in range(n):
    sum2 += a2[i]
for i in range(n-1):
    sum1 += a1[i]
    sum2 -= a2[i]
    ans1 = sum1 + sum2 + a1[i+1]
    ans2 = sum1 + sum2 + a2[i]
    ans_list.append(ans1)
    ans_list.append(ans2)       
print(max(ans_list))    

# Fixed code:
n = int(input())
a1 = list(map(int, input().split()))
a2 = list(map(int, input().split()))
sum1 = 0
sum2 = 0
ans_list = []
for i in range(n):
    sum2 += a2[i]
if n != 1:    
    for i in range(n-1):
        sum1 += a1[i]
        sum2 -= a2[i]
        ans1 = sum1 + sum2 + a1[i+1]
        ans2 = sum1 + sum2 + a2[i]
        ans_list.append(ans1)
        ans_list.append(ans2)   
else:
    ans_list.append(a1[0]+a2[0])
print(max(ans_list))
# Buggy code:
N = int(input())
A1 =list(map(int, input().split()))
A2 =list(map(int, input().split()))

candy = []

def sum_A1(x):
  cnt = 0
  for i in range(x):
    cnt += A1[i]
  return cnt

def sum_A2(x):
  cnt = 0
  for i in range(x-1,N):
    cnt += A2[i]
  return cnt

for i in range(N):
  candy.append(sum_A1(i) + sum_A2(i))
  
print(candy)


# Fixed code:
N = int(input())
A1 =list(map(int, input().split()))
A2 =list(map(int, input().split()))
 
candy = []
 
def sum_A1(x):
  cnt = 0
  for i in range(x+1):
    cnt += A1[i]
  return cnt
 
def sum_A2(x):
  cnt = 0
  for i in range(x,N):
    cnt += A2[i]
  return cnt
 
for i in range(N):
  candy.append(sum_A1(i) + sum_A2(i))
  
print(max(candy))
# Buggy code:
n = int(input())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
res = 0
for i in range(n):
  c = 0
  for j in range(n):
    if j <= i:
      c += a[j]
    else:
      c += b[j]
  res = max(res,c)
print(res)

# Fixed code:
n = int(input())
a = [int(x) for x in input().split()]
b = [int(x) for x in input().split()]
res = 0
for i in range(n):
  c = 0
  for j in range(n):
    if j < i:
      c += a[j]
    elif j == i:
      c += a[j]
      c += b[j]
    else:
      c += b[j]
  res = max(res,c)
print(res)
# Buggy code:
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))

res = 0

for i in range(N,0,-1):
    print(A1[1:i])
    print(A2[i-1:])
    res = max(res, A1[0] + sum(A1[1:i]) + sum(A2[i-1:]))

print(res)

# Fixed code:
N = int(input())
A1 = list(map(int, input().split()))
A2 = list(map(int, input().split()))

res = 0

for i in range(N,0,-1):
    res = max(res, A1[0] + sum(A1[1:i]) + sum(A2[i-1:]))

print(res)
# Buggy code:
a, b = map(int, input().split())

if a*b % 2 == 0
print('Odd')
else:
  print('Even')

# Fixed code:
a,b=map(int,input().split())
ab=(a*b)%2
if ab==0:
    print("Even")
else:
    print("Odd")
# Buggy code:
a,b = map(int,input().split())
if a*b%2=0:
  print('Even')
else:
  print('Odd')

# Fixed code:
a, b = map(int, input().split())

if (a * b) % 2 == 0:
	print('Even')
else:
	print('Odd')
# Buggy code:
a,b = map(int,input().split())
  if (a*b % 2):
    print("Even") 
  else:
    print("Odd")                                                             
 

# Fixed code:
a,b = map(int,input().split())
if (a*b % 2 == 0):
  print("Even") 
else:
  print("Odd")
# Buggy code:
a, b = map(int, input().split())

moda = a % 2
modb = b % 2

if moda == 0:
    if modb == 0:
        print("Even")
    else:
        print("Odd")
else:
    print("Odd")


# Fixed code:
a, b = map(int, input().split())

moda = a % 2
modb = b % 2

if moda == 0:
    print("Even")
else:
        if modb == 0:
            print("Even")
        else:
            print("Odd")
# Buggy code:
N = 1
data = []
for i in range(N):
    data_input = list(map(int,input().split()))
    data.append(data_input)
M = 1
print(data)
if data[0][0]//2 == 0:
    print('Even')
else:
    if data[0][1]//2 ==0:
        print('Even')
    else:
        print('Odd')

# Fixed code:
N = 1
data = []
for i in range(N):
    data_input = list(map(int,input().split()))
    data.append(data_input)
M = 1
if data[0][0]%2 == 0:
    print('Even')
else:
    if data[0][1]%2 ==0:
        print('Even')
    else:
        print('Odd')
# Buggy code:
a,b = map(int(), input().split())
c=a*b
if c%2==0:
  print("Odd")
else:
  print("Even")

# Fixed code:
a,b = map(int, input().split())
c=a*b
if c%2==0:
  print("Even")
else:
  print("Odd")
# Buggy code:
a,b = map(int, input())
if a * b % 2 == 0:
  print("Even")
else:
  print("Odd")

# Fixed code:
a,b=map(int, input().split())

if a*b%2==0:
    print('Even')
else:
    print('Odd')
# Buggy code:
a,b = map(int,input().split())

print("Even" if (a * b) % 2 else "Odd" )

# Fixed code:
a,b = map(int,input().split())

print("Even" if (a * b) % 2 == 0 else "Odd" )
# Buggy code:
a, b = map(int(), input().split()))
if (a*b % 2) == 0:
    print("Even")
else:
    print("Odd")

# Fixed code:
a, b=list(map(int,input().split()))
if a*b %2 == 0:
    print('Even')
else:
    print('Odd')
# Buggy code:
a, b = map(int,input().split())
if (a*b)%2 == 0:
  print("Odd")
 else:
  print("Even")

# Fixed code:
a,b=list(map(int,input().split()))
if a*b%2==0:
    print('Even')
else:
    print("Odd")
# Buggy code:
a,b=map(int, input()., split())
if a*b/2==0:
  print("Even")
else:
  print("Odd")

# Fixed code:
a,b=map(int, input().split())

if a*b%2==0:
  print("Even")
else:
  print("Odd")
# Buggy code:
a = input()
b = a.split(' ')

nummm = 1

for l in b:
    nummm = int(nummm) * int(l)

if int(nummm) % 2 == 0:
    print('Even')
else:
    print('Odd')

print(nummm)


# Fixed code:
a = input()
b = a.split(' ')
 
nummm = 1
 
for l in b:
    nummm = int(nummm) * int(l)
 
if int(nummm) % 2 == 0:
    print('Even')
else:
    print('Odd')
# Buggy code:
a,b = map(int, input().split())

ab = a*b

if ab % 2 == 0:
    print('Odd')
else:
    print(Even)

# Fixed code:
a, b = map(int, input().split())
print("Even" if a*b%2 == 0 else "Odd")
# Buggy code:
list = input().split()
a = list[0]
b = list[1]

if a * b % 2 == 0:
  print(Even)
else:
  print(Odd)

# Fixed code:
list = input().split()
a = int(list[0])
b = int(list[1])

if a * b % 2 == 0:
  print("Even")
else:
  print("Odd")
# Buggy code:
data = input()
data_list = data.split(" ")
if ((data_list[0]*data_list[1])%2 == 0):
  print("Odd")
else:
  print("Even")

# Fixed code:
data = input()
data_list = data.split(" ")
if ((int(data_list[0])*int(data_list[1]))%2 == 0):
  print("Even")
else:
  print("Odd")
# Buggy code:
a,b = [int(x) for x in input().split()]

if a*b//2==0:
    print("Even")
else:
    print("Odd")

# Fixed code:
a,b = [int(x) for x in input().split()]

if (a*b)%2==0:
    print("Even")
else:
    print("Odd")
# Buggy code:
a , b = map(int,input(),split())
if (a*b)%2 == 1:
  print('Odd')
else:
  print('Even')

# Fixed code:
a,b= map(int,input().split())
if (a*b)%2:
    print("Odd")
else:
    print("Even")
# Buggy code:
data = list(map(lambda x :int(x), input().strip().split())
res = data[0]*data[1]%2
if res ==0:
	print("Even")
else:
   print("Odd")

# Fixed code:
data = list(map(lambda x:int(x),input().strip().split()))
res = data[0]*data[1]%2
if res ==0:
  print("Even")
else:
  print("Odd")
# Buggy code:
print(list(map(int, input().split())))
if a*b % 2 == 0:
  print("Even")
else:
  print("Odd")

# Fixed code:
a,b = map(int,input().split(" "))
if (a*b%2 == 0):
    print("Even")
else:
    print("Odd")
# Buggy code:

int_list = list(map(int, input().split()))
if (((int_list[0] + int_list[1]) % 2) == 0):
	print('Even')
else: 
	print('Odd')

# Fixed code:

int_list = list(map(int, input().split()))
if (((int_list[0]*int_list[1]) % 2) == 0):
	print('Even')
else: 
	print('Odd')
# Buggy code:
a = map(int,input().split())

if a*b % 2 == 1:
    print("Odd")
else:
    print("Even")



# Fixed code:
a,b = map(int,input().split())
c = a*b
print("Odd" if c%2==1 else "Even")
# Buggy code:
a, b = input().split()
if a*b % 2 ==0:
  print("Even")
else:
  print("Odd")


# Fixed code:
a, b = map(int, input().split())

if a*b % 2 ==0:
  print("Even")
else:
  print("Odd")
# Buggy code:
a, b = map.(int, input().split())
print("Even" if a * b % 2 == 0 else "Odd")

# Fixed code:
a,b = map(int,input().split())

if a*b % 2 != 0:
    print('Odd')
else:
    print('Even')
# Buggy code:
a,b=input.split()

if a*b%2==1:
    print("Odd")
else:
    print("Even")

# Fixed code:
a,b=map(int,input().split())

if a*b%2==1:
    print("Odd")
else:
    print("Even")
# Buggy code:
a, b = int(input().split())
if a*b % 2 == 0:
    print("Even")
else:
    print("Odd")

# Fixed code:
a, b = map(int, input().split())
c = a*b
if c%2==0:
  print('Even')
else:
  print('Odd')
# Buggy code:
a, b= map(int, input().split())
if a*b/2 % 0:
    print("Even")
else:
    print("Odd")
    



# Fixed code:
a,b= map(int,input().split())

if (a*b)%2==0:
    print("Even")
else:
    print("Odd")
# Buggy code:
a,b=map(int(),input().split())
Hantei=(a * b) % 2
if Hantei == 1:
    print("Odd")
else:
    print("Even")


# Fixed code:
a,b=input().split()
a=int(a)
b=int(b)
Hantei=(a * b) % 2
if Hantei == 1:
    print("Odd")
else:
    print("Even")
# Buggy code:
a, b = map(int, input().split())
if (a % 2 == 0 || b % 2 == 0):
  print('Even')
else:
  print('Odd')

# Fixed code:
(a,b)=map(int,input().split())
if a*b%2==0:
  print("Even")
else:
  print("Odd")
# Buggy code:
a = map(int, input().split())
if a % 2 is 1 and b % 2 is 1:
  print('Odd')
else:
  print('Even')

# Fixed code:
a, b = map(int, input().split())
if a % 2 is 1 and b % 2 is 1:
  print('Odd')
else:
  print('Even')
# Buggy code:
a,b = map(int,input().split())
ab=a*b

if ab//2 == 1:
  print("Odd")
else:
  print("Even")

# Fixed code:
a,b = map(int,input().split())
ab=a*b
 
if ab%2 == 1:
  print("Odd")
else:
  print("Even")
# Buggy code:
length_list = []
for _ in range(n):
    x = int(input().split()[0])
    length_list.append(x)

print(len(list(set(length_list))))


# Fixed code:
n = int(input().split()[0])
length_list = []
for _ in range(n):
    x = int(input().split()[0])
    length_list.append(x)

print(len(list(set(length_list))))
# Buggy code:
N = int(input())
d = [int(input()) for i in N]
print(len(set(d)))


# Fixed code:
N = int(input())
d = [input() for i in range(N)]

print(len(set(d)))
# Buggy code:
n = int(input())
d = sorted([int(input()) for _ in range(n)])
cnt = 1
for a, b in zip(cnt[1:], cnt):
    if a > b:
        cnt += 1
print(cnt)


# Fixed code:
n = int(input())
d = sorted([int(input()) for _ in range(n)])
cnt = 1
for a, b in zip(d[1:], d):
    if a > b:
        cnt += 1
print(cnt)
# Buggy code:
N = int(input())
for i in range(N):
  l = [input()]
print(len(set(l)))

# Fixed code:
N = int(input())
l = [input() for i in range(N)]
print(len(set(l)))
# Buggy code:
N=int(input())
d = [int(input()) for i in range(n)]

print(len(set(d)))

# Fixed code:
N= int(input()) 
d = set([int(input()) for i in range(N)])
print(len(d))
# Buggy code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]!=d[i+1]:
    c=c+1
    if i==n-2:
      c=c+1
      
print(c)      
    

# Fixed code:
n = int(input()) 
d = [int(input()) for i in range(n)] 
k=0
c=0
for i in range(n):
  for j in range(n-i-1):
    if d[j] > d[j+1]:
      k = d[j]
      d[j] = d[j+1]
      d[j+1] = k
      
for i in range(n-1):
  if d[i]==d[i+1]:
    c=c+1
      
print(n-c)
# Buggy code:
n = int(input())
cake = [input() for i range(n)]
    
print(len(set(cake)))


# Fixed code:
n = int(input())
cake = [input() for i in range(n)]
print(len(set(cake)))
# Buggy code:
print(set([int(input()) for i in range(int(input())) ]))

# Fixed code:
print(len(set([int(input()) for i in range(int(input())) ])))
# Buggy code:
N = int(input())
rice_cakes = [int(input()) for _ in range(N)]
print(len(set(rice_cakes))
  

# Fixed code:
N = int(input())
rice_cakes = [int(input()) for _ in range(N)]
print(len(set(rice_cakes)))
# Buggy code:
import numpy as np

n = int(input())
d = [int(i) for i in input().split()] 


print(len(np.unique(d)))

# Fixed code:
import numpy as np

n = int(input())
d = [int(input()) for i in range(n)]
    
print(len(np.unique(d)))
# Buggy code:
S = int(input())
list=[]
for i in range(N):
    list.append(input())
print(len(set(list)))

# Fixed code:
N = int(input())
list=[]
for i in range(N):
    list.append(int(input()))
print(len(set(list)))
# Buggy code:
n = input()
S = set([int(input()) for in range(n)])
print(len(S))

# Fixed code:
n = int(input())
S = set([int(input()) for i in range(n)])
print(len(S))
# Buggy code:
def main():
  array = []
  
  size = input()
  for i in range(size):
    array.append(int(input()))
    
  array.sort(reverse=True)
  
  result = 1
  for i in range(len(array)-1):
    if array[i] != array[i+1]:
      result+=1
  
  print(result)
    
    
main()
  

# Fixed code:
def main():
  array = []
  
  size = int(input())
  for i in range(size):
    array.append(int(input()))
    
  array.sort(reverse=True)
  
  result = 1
  for i in range(len(array)-1):
    if array[i] != array[i+1]:
      result+=1
  
  print(result)
    
    
main()