Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
if len(set(a)) == 1:
    if list(set(a)[0]) != 1:
        print(-1)
        exit()
    else:
        print(0)
        exit()

x = 1
count = 0
for i in a:
    if i == x:
        x+=1
    else:
        count+=1
if count == n:
    print(-1)
else:
    print(count)


Fixed submission:
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	if a[0] == 1:
		print (0)
		exit()
	else:
		print (-1)
		exit()
if len(set(a)) == 1 and a[0] != 1:
	print (-1)
	exit()
 
x = 1
cnt = 0
for i in a:
	if i == x:
		x += 1
	else:
		cnt += 1
if cnt == n:
	print (-1)
else:
	print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
if len(set(a)) == 1:
    if set(a)[0] != 1:
        print(-1)
        exit()
    else:
        print(0)
        exit()

x = 1
count = 0
for i in a:
    if i == x:
        x+=1
    else:
        count+=1
if count == n:
    print(-1)
else:
    print(count)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	if a[0] == 1:
		print (0)
		exit()
	else:
		print (-1)
		exit()
if len(set(a)) == 1 and a[0] != 1:
	print (-1)
	exit()
 
x = 1
cnt = 0
for i in a:
	if i == x:
		x += 1
	else:
		cnt += 1
if cnt == n:
	print (-1)
else:
	print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

if len(set(a)) == 1:
    if set(a)[0] != 1:
        print(-1)
        exit()
    else:
        print(0)
        exit()

x = 1
count = 0

for i in a:
    if i == x:
        x+=1
    else:
        count+=1

print(count)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	if a[0] == 1:
		print (0)
		exit()
	else:
		print (-1)
		exit()
if len(set(a)) == 1 and a[0] != 1:
	print (-1)
	exit()
 
x = 1
cnt = 0
for i in a:
	if i == x:
		x += 1
	else:
		cnt += 1
if cnt == n:
	print (-1)
else:
	print(cnt)

Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))

if len(set(a)) == 1:
    if set(a)[0] != 1:
        print(-1)
        exit()
    else:
        print(0)
        exit()

x = 1
count = 0

for i in a:
    if i == x:
        x+=1
    else:
        count+=1

print(count)

Fixed submission:
n = int(input())
a = list(map(int, input().split()))
if n == 1:
	if a[0] == 1:
		print (0)
		exit()
	else:
		print (-1)
		exit()
if len(set(a)) == 1 and a[0] != 1:
	print (-1)
	exit()
 
x = 1
cnt = 0
for i in a:
	if i == x:
		x += 1
	else:
		cnt += 1
if cnt == n:
	print (-1)
else:
	print(cnt)
Buggy python submission (verdict: Runtime Error):
S = input()
if len(S) == 3 and S.count('A')==2 or S.count('B')==2:
  print('Yes')
  else:
    print('No')

Fixed submission:
S = input()

if len(S)==3 and S.count('A')==2 or S.count('B')==2:
    print('Yes')

else:
    print('No')
Buggy python submission (verdict: Runtime Error):
n = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
    if x % 3 == 0 or x % 5 == 0:
        answer.append(True)
if len(even) ==len(answer):
    print("APPROVED")
else:
    print("DENIED")

Fixed submission:
print("Yes") if len(set(list(map(int, input().split(" ")))))==2 else print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
    if x % 3 == 0 or x % 5 == 0:
        answer.append(True)
if len(even) ==len(answer):
    print("APPROVED")
else:
    print("DENIED")

Fixed submission:
print("Yes") if len(set(list(map(int, input().split(" ")))))==2 else print("No")

Buggy python submission (verdict: Runtime Error):
n = input()
_list = input().split(" ")
_list = [int(x) for x in _list]
even = [x for x in _list if x % 2==0]
answer = []
for x in even:
    if x % 3 == 0 or x % 5 == 0:
        answer.append(True)
if len(even) ==len(answer):
    print("APPROVED")
else:
    print("DENIED")

Fixed submission:
print("Yes") if len(set(list(map(int, input().split(" ")))))==2 else print("No")
Buggy python submission (verdict: Runtime Error):
def main():
    n = int(input())
    s = {}
    for _ in range(n):
        string = input()
        if string in s:
            s[string] += 1
        else:
            s[string] = 1
    s = sorted(list(s.items()), key=lambda x: (x[1], x[0]), reverse=True)
    lst = []
    max_num = s[0][1]
    if n == len(s):
        print(s.items()[0])
        return
    for string, num in s:
        if num != max_num:
            break
        lst.append(string)
    for l in reversed(lst):
        print(l)


if __name__ == "__main__":
    main()


Fixed submission:
def main():
    n = int(input())
    s = {}
    for _ in range(n):
        string = input()
        if string in s:
            s[string] += 1
        else:
            s[string] = 1
    s = sorted(list(s.items()), key=lambda x: (x[1], x[0]), reverse=True)
    lst = []
    max_num = s[0][1]
    if n == len(s):
        for string, num in reversed(s):
            print(string)
    else:
        for string, num in s:
            if num != max_num:
                break
            lst.append(string)
    for l in reversed(lst):
        print(l)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    s = {}
    for _ in range(n):
        string = input()
        if string in s:
            s[string] += 1
        else:
            s[string] = 1
    s = sorted(list(s.items()), key=lambda x: (x[1], x[0]), reverse=True)
    lst = []
    max_num = s[0][1]
    for string, num in s:
        if num != max_num:
            break
        lst.append(string)
    for l in reversed(lst):
        print(l)


if __name__ == "__main__":
    main()


Fixed submission:
def main():
    n = int(input())
    s = {}
    for _ in range(n):
        string = input()
        if string in s:
            s[string] += 1
        else:
            s[string] = 1
    s = sorted(list(s.items()), key=lambda x: (x[1], x[0]), reverse=True)
    lst = []
    max_num = s[0][1]
    if n == len(s):
        for string, num in reversed(s):
            print(string)
    else:
        for string, num in s:
            if num != max_num:
                break
            lst.append(string)
    for l in reversed(lst):
        print(l)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def calc_exp(p):
    result = 0
    for n in p:
        result += expectation(n)
    return result


def expectation(p):
    n = sum(p)
    return 0.5 * n + 0.5 * len(p)


def main():
    n, k = map(int, input().split())
    p = list(map(int, input().split()))
    max_num = 0
    max_idx = -1
    for i in range(n-k+1):
        num = sum(p[i:i+k])
        if num >= max_num:
            max_num = num
            max_idx = i
    print(expectation(p[max_idx:max_idx+k]))


if __name__ == "__main__":
    main()


Fixed submission:
def expectation(p):
    return 0.5 * sum(p) + 0.5 * len(p)


def main():
    n, k = map(int, input().split())
    p = list(map(int, input().split()))
    max_num = sum(p[0:k])
    max_idx = 0
    lst = [max_num]
    for i in range(1, n-k+1):
        num = lst[i-1] + p[i+k-1] - p[i-1]
        lst.append(num)

        if num >= max_num:
            max_num = num
            max_idx = i
    print(expectation(p[max_idx:max_idx+k]))


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def calc_exp(p):
    result = 0
    for n in p:
        result += expectation(n)
    return result


def expectation(n):
    return 0.5 * n + 0.5


def main():
    n, k = map(int, input().split())
    p = list(map(int, input().split()))
    max_num = 0
    max_idx = -1
    for i in range(n-k+1):
        num = sum(p[i:i+k])
        if num >= max_num:
            max_num = num
            max_idx = i
    print(calc_exp(p[max_idx:max_idx+k]))


if __name__ == "__main__":
    main()


Fixed submission:
def expectation(p):
    return 0.5 * sum(p) + 0.5 * len(p)


def main():
    n, k = map(int, input().split())
    p = list(map(int, input().split()))
    max_num = sum(p[0:k])
    max_idx = 0
    lst = [max_num]
    for i in range(1, n-k+1):
        num = lst[i-1] + p[i+k-1] - p[i-1]
        lst.append(num)

        if num >= max_num:
            max_num = num
            max_idx = i
    print(expectation(p[max_idx:max_idx+k]))


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 1
    for i in range(1, n):
        min_i = min(p[:i+1])
        if p[i] == min_i:
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Fixed submission:
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    min_num = n+1
    for i in p:
        if i < min_num:
            min_num = i
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    for i in range(n):
        min_i = min(p[:i+1])
        if p[i] == min_i:
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Fixed submission:
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    min_num = n+1
    for i in p:
        if i < min_num:
            min_num = i
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    for i in range(n):
        for j in range(i):
            if p[i] > p[j]:
                count += 1
                break

    print(n - count)


if __name__ == "__main__":
    main()

Fixed submission:
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    min_num = n+1
    for i in p:
        if i < min_num:
            min_num = i
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    for i in range(n):
        flg = True
        for j in range(i):
            if p[i] > p[j]:
                flg = False
        if flg:
            count += 1

    print(count)


if __name__ == "__main__":
    main()

Fixed submission:
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    min_num = n+1
    for i in p:
        if i < min_num:
            min_num = i
            count += 1
    print(count)


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n = int(input())
    p = list(map(int, input().split()))
    lst = []
    for i in range(n):
        flg = True
        for j in range(i):
            if p[i] > p[j]:
                flg = False
        if flg:
            lst.append(i)

    print(len(lst))


if __name__ == "__main__":
    main()

Fixed submission:
def main():
    n = int(input())
    p = list(map(int, input().split()))
    count = 0
    min_num = n+1
    for i in p:
        if i < min_num:
            min_num = i
            count += 1
    print(count)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from typing import List, Tuple
import sys
input = sys.stdin.readline


class Human:

    def __init__(self, statements: List[Tuple[int, int]]):
        self.statements = statements

    def is_honest(self, honest_list: List[int]):
        for x, y in self.statements:
            if y:
                if x not in honest_list:
                    return False
            else:
                if x in honest_list:
                    return False
        return True


class Humans:

    def __init__(self):
        self.humans = [None]

    def add(self, human: Human):
        self.humans.append(human)

    def is_all_honest(self, honest_list: List[int]):
        for i in honest_list:
            if not self.humans[i].is_honest(honest_list):
                return False
        return True


def main():
    n = int(input())
    humans = Humans()
    for _ in range(n):
        a = int(input())
        xy = [tuple(map(int, input().split())) for _ in range(a)]
        humans.add(Human(xy))
    max_honest = 0
    for bit in range(2**n):
        honest_list = []
        for i in range(n):
            if (bit >> i) & 1:
                honest_list.append(i+1)  # 1ずれるため補正
        if humans.is_all_honest(honest_list):
            max_honest = max(max_honest, len(honest_list))
    print(max_honest)


if __name__ == "__main__":
    main()


Fixed submission:
import sys
input = sys.stdin.readline


class Human:

    def __init__(self, statements):
        self.statements = statements

    def is_honest(self, honest_list):
        for x, y in self.statements:
            if y:
                if x not in honest_list:
                    return False
            else:
                if x in honest_list:
                    return False
        return True


class Humans:

    def __init__(self):
        self.humans = [None]

    def add(self, human: Human):
        self.humans.append(human)

    def is_all_honest(self, honest_list):
        for i in honest_list:
            if not self.humans[i].is_honest(honest_list):
                return False
        return True


def main():
    n = int(input())
    humans = Humans()
    for _ in range(n):
        a = int(input())
        xy = [tuple(map(int, input().split())) for _ in range(a)]
        humans.add(Human(xy))
    max_honest = 0
    for bit in range(2**n):
        honest_list = []
        for i in range(n):
            if (bit >> i) & 1:
                honest_list.append(i+1)  # 1ずれるため補正
        if humans.is_all_honest(honest_list):
            max_honest = max(max_honest, len(honest_list))
    print(max_honest)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    c = [0] + [abs(h[1] - h[0])]
    for i in range(2, n):
        min_step = 10 ** 4
        num = i if i <= k else k
        for j in range(num):
            step = abs(h[i] - h[i-j]) + c[i-j]
            if step < min_step:
                min_step = step
        c.append(min_step)
    print(c.pop())


if __name__ == "__main__":
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    dp = [0] + [float("inf")] * (n-1)
    for i in range(1, n):
        for j in range(max(0, i-k), i):
            dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
    
    print(dp[-1])


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    c = [0] + [abs(h[1] - h[0])]
    for i in range(2, n):
        min_step = 10 ** 4
        for j in reversed(range(i)):
            if i - j > k:
                continue
            step = abs(h[i] - h[j]) + c[j]
            if step < min_step:
                min_step = step
        c.append(min_step)
    print(c.pop())


if __name__ == "__main__":
    main()


Fixed submission:
import sys
input = sys.stdin.readline


def main():
    n, k = map(int, input().split())
    h = list(map(int, input().split()))
    dp = [0] + [float("inf")] * (n-1)
    for i in range(1, n):
        for j in range(max(0, i-k), i):
            dp[i] = min(dp[i], dp[j] + abs(h[i] - h[j]))
    
    print(dp[-1])


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
H = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] =< 0:
    print('Yes')
else:
    print('No')

Fixed submission:
H = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] <= 0:
    print('Yes')
else:
    print('No')

Buggy python submission (verdict: Runtime Error):
H, N = map(int, input().split())
A = list(map(int, input().split()))
for i in range(N):
    H = H -A[i]
if H =< 0:
    print('Yes')
else:
    print('No')

Fixed submission:
H = list(map(int, input().split()))
A = list(map(int, input().split()))
for i in range(H[1]):
    H[0]= H[0] -A[i]
if H[0] <= 0:
    print('Yes')
else:
    print('No')
Buggy python submission (verdict: Runtime Error):
M = input().split()
i = 0
a = None
b = None
for i in range(int(M[0])):
    a += str(M[1])
alfa = int(a)
for i in range(M[1]):
    b += str(M[0])
beta = int(b)
delta = min(a,b)
print(delta)

Fixed submission:
M = input().split()
i = 0
a = ''
b = ''
c = [0,0]
for i in range(int(M[0])):
    a += str(M[1])
for i in range(int(M[1])):
    b += str(M[0])
c[0] = int(a)
c[1] = int(b)  
c.sort()
print(str(c[1]))
Buggy python submission (verdict: Runtime Error):
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    

Fixed submission:
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    print("")

Buggy python submission (verdict: Runtime Error):
huga = list(map(int, input().split()))
if huga[0]*500 - huga[1] >= 0:
    print(Yes)
elif huga[0]*500 - huga[1] > 0:
    print(No)
else:
    

Fixed submission:
Ken, New = map(int, input().split())
if (Ken * 500) - New >= 0:
    print("Yes")
elif (Ken * 500) - New < 0:
    print("No")
else:
    print("")
Buggy python submission (verdict: Runtime Error):
ST = split.input()
print(ST[1] + ST[0], sep = "")

Fixed submission:
ST = input().split()
print(ST[1] + ST[0], sep = "")
Buggy python submission (verdict: Runtime Error):
A = int(input())
B = int(input())
A&B = [A,B]
a&b&c = [1, 2, 3]
C = set(A&B) ^ set(a&b&c)
print(C)

Fixed submission:
A = int(input())
B = int(input())
C = 6 - A - B
print(C)
Buggy python submission (verdict: Runtime Error):
N = int(input())
S,T = input().split()
A = []
B = []
A = list(S)
B = list(T)
for i in range(N)
	print(A[i],B[i], end='')
	

Fixed submission:
N = int(input())
Slist = input().split()
A = Slist[0]
B = Slist[1]

for i in range (N):
	print(A[i],B[i], end='',sep='')
Buggy python submission (verdict: Runtime Error):
S = input()
if S = ' SUN ':
	print(7)
elif S = ' MON ':
	print(6)
elif S = ' TUE ':
	print(5)
elif S = ' WED ':
	print(4)
elif S = ' THU ':
	print(3)
elif S = ' FRI ':
	print(2)
elif S = ' SAT ':
	print(1)
else:
  print(-1)

Fixed submission:
S = input()
if S == 'SUN':
	print(7)
elif S == 'MON':
	print(6)
elif S == 'TUE':
	print(5)
elif S == 'WED':
	print(4)
elif S == 'THU':
	print(3)
elif S == 'FRI':
	print(2)
elif S == 'SAT':
	print(1)
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
# 数字
N = int(input())

# 文字
S = input()

AAA = ""

for char in list(S):
    hoge = ord(char)
    huga = hoge - 97
    huga = (huga + N) % 26
    hoge = num + 97
    AAA += chr(hoge)

print()

Fixed submission:
N = int(input())
S = input()


def encrypt(S, N):
    X = ""

    for ch in list(S):
        if 'A' <= ch <= 'Z':
            X += chr((ord(ch) - ord('A') + int(N)) % 26 + ord('A'))
        elif 'a' <= ch <= 'z':
            X += chr((ord(ch) - ord('a') + int(N)) % 26 + ord('a'))
        else:
            X += ch

    return X

# 暗号化
X = encrypt(S, N)
print(X)

Buggy python submission (verdict: Runtime Error):
# 数字
N = map(int, input().split()

# 文字
S = input()

AAA = ""

for char in list(S):
    hoge = ord(char)
    huga = hoge - 97
    huga = (huga + S) % 26
    hoge = num + 97
    AAA += chr(hoge)

print()

Fixed submission:
N = int(input())
S = input()


def encrypt(S, N):
    X = ""

    for ch in list(S):
        if 'A' <= ch <= 'Z':
            X += chr((ord(ch) - ord('A') + int(N)) % 26 + ord('A'))
        elif 'a' <= ch <= 'z':
            X += chr((ord(ch) - ord('a') + int(N)) % 26 + ord('a'))
        else:
            X += ch

    return X

# 暗号化
X = encrypt(S, N)
print(X)
Buggy python submission (verdict: Runtime Error):
# To add a new cell, type '# %%'
# To add a new markdown cell, type '# %% [markdown]'

# %%
one = lst[0][0]
two = lst[0][1]
three = lst[0][2]


# %%
one_two = one == two
two_three = two == three
three_one = three == one




# %%
if any([one_two, two_three, three_one]):
    print('Yes')
else:
    print('No')


# %%




Fixed submission:
# To add a new cell, type '# %%'
# To add a new markdown cell, type '# %% [markdown]'

# %%
lst = input().split()

# %%
one = lst[0][0]
two = lst[0][1]
three = lst[0][2]


# %%
one_two = one != two
two_three = two != three
three_one = three != one


# %%
any([one_two, two_three, three_one])


# %%
if any([one_two, two_three, three_one]):
    print('Yes')
else:
    print('No')


# %%

Buggy python submission (verdict: Runtime Error):
# To add a new cell, type '# %%'
# To add a new markdown cell, type '# %% [markdown]'

# %%
one = lst[0][0]
two = lst[0][1]
three = lst[0][2]


# %%
one_two = one == two
two_three = two == three
three_one = three == one


# %%
any([one_two, two_three, three_one])


# %%
if any([one_two, two_three, three_one]):
    print('Yes')
else:
    print('No')


# %%




Fixed submission:
# To add a new cell, type '# %%'
# To add a new markdown cell, type '# %% [markdown]'

# %%
lst = input().split()

# %%
one = lst[0][0]
two = lst[0][1]
three = lst[0][2]


# %%
one_two = one != two
two_three = two != three
three_one = three != one


# %%
any([one_two, two_three, three_one])


# %%
if any([one_two, two_three, three_one]):
    print('Yes')
else:
    print('No')


# %%
Buggy python submission (verdict: Time Limit Exceeded):
lst = [int(i) for i in input().split()]

ball = lst[0]
blue = lst[1]
red = lst[2]
blue_red = int(ball / (red + blue)) + 1

blue_str = ''
for i in range(blue): blue_str += 'b'
red_str = ''
for i in range(red): red_str += 'r'

mojiretu = ''
for i in range(blue_red): mojiretu += (blue_str + red_str)
print(mojiretu[:ball].count('b'))

Fixed submission:
lst = [int(i) for i in input().split()]
ball = lst[0]
blue = lst[1]
red = lst[2]

red_blue = int(ball / (red + blue))
shokichi = red_blue * blue
amari = ball - (red_blue * (red + blue))

if amari < blue:
    nokori = amari
elif amari > blue:
    nokori = blue
else:
    nokori = 0

if blue == 0:
    print(0)
else:
    print(shokichi + nokori)

Buggy python submission (verdict: Runtime Error):
ball = lst[0]
blue = lst[1]
red = lst[2]
blue_red = int(ball / (red + blue)) + 1

blue_str = ''
for i in range(blue): blue_str += 'b'
red_str = ''
for i in range(red): red_str += 'r'

mojiretu = ''
for i in range(blue_red): mojiretu += (blue_str + red_str)
print(mojiretu[:ball].count('b'))

Fixed submission:
lst = [int(i) for i in input().split()]
ball = lst[0]
blue = lst[1]
red = lst[2]

red_blue = int(ball / (red + blue))
shokichi = red_blue * blue
amari = ball - (red_blue * (red + blue))

if amari < blue:
    nokori = amari
elif amari > blue:
    nokori = blue
else:
    nokori = 0

if blue == 0:
    print(0)
else:
    print(shokichi + nokori)