TnT/CodeNet4Repair huggingface dataset:
Problem:
Takahashi is participating in a programming contest called AXC002, and he has just submitted his code to Problem A.  The problem has N test cases.  For each test case i (1\leq i \leq N), you are given a string S_i representing the verdict for that test case. Find the numbers of test cases for which the verdict is `AC`, `WA`, `TLE`, and `RE`, respectively.  See the Output section for the output format.

Incorrect submission (verdict: Wrong Answer):
score = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
N = int(input())
for _ in range(N):
    result = input()
    if result == 'AC':
        score[result] += 1
    elif result == 'WA':
        score[result] += 1
    elif result == 'TLE':
        score[result] += 1
    elif result == 'RE':
        score[result] += 1
for i in score.keys():
    print(i, '×', score[i])




Fixed, accepted submission:
score = {'AC': 0, 'WA': 0, 'TLE': 0, 'RE': 0}
N = int(input())
for _ in range(N):
    result = input()
    if result == 'AC':
        score[result] += 1
    elif result == 'WA':
        score[result] += 1
    elif result == 'TLE':
        score[result] += 1
    elif result == 'RE':
        score[result] += 1
for i in score.keys():
    print(i, 'x', score[i])
Problem:
Snuke signed up for a new website which holds programming competitions. He worried that he might forget his password, and he took notes of it. Since directly recording his password would cause him trouble if stolen, he took two notes: one contains the characters at the odd-numbered positions, and the other contains the characters at the even-numbered positions.  You are given two strings O and E. O contains the characters at the odd- numbered positions retaining their relative order, and E contains the characters at the even-numbered positions retaining their relative order. Restore the original password.

Incorrect submission (verdict: Wrong Answer):
s=input()
t=input()

l=""
i=0
j=0
while i < len(s):
  l+=s[i]
  i+=1
while j < len(t):
  l+=t[j]
  j+=1
print(l)


Fixed, accepted submission:
s=input()
t=input()

l=""
i=0
j=0
while True:
  if i < len(s):
    l+=s[i]
    i+=1
  if j < len(t):
    l+=t[j]
    j+=1
  if len(l) == len(s)+len(t):
    break
print(l)
Problem:
Write a program which reads three integers a, b and c, and prints "Yes" if a < b < c, otherwise "No".

Incorrect submission (verdict: Wrong Answer):
a,b,c=map(int,input().split())
if a < b and b < c:
    print('YES')
else:
    print('NO')

Fixed, accepted submission:
a,b,c=map(int,input().split())
if a < b and b < c:
    print('Yes')
else:
    print('No')
Problem:
You have written N problems to hold programming contests. The i-th problem will have a score of P_i points if used in a contest.  With these problems, you would like to hold as many contests as possible under the following condition:    * A contest has three problems. The first problem has a score not greater than A points, the second has a score between A + 1 and B points (inclusive), and the third has a score not less than B + 1 points.  The same problem should not be used in multiple contests. At most how many contests can be held?

Incorrect submission (verdict: Wrong Answer):
import bisect
N = int(input())
A,B = map(int, input().split())
P = list(map(int, input().split()))
P.sort()
ans = N
id = bisect.bisect_right(P,A)
ans = min(ans,id)
prev = id
id = bisect.bisect_right(P,B)
ans = min(ans,id - prev)
ans = min(ans,N-1 - id)

print(ans)

Fixed, accepted submission:
import bisect
N = int(input())
A,B = map(int, input().split())
P = list(map(int, input().split()))
P.sort()
ans = N
id = bisect.bisect_right(P,A)
ans = min(ans,id)
prev = id
id = bisect.bisect_right(P,B)
ans = min(ans,id - prev)
ans = min(ans,N - id)
print(ans)
Problem:
There is a tree with N vertices, numbered 1, 2, \ldots, N. For each i (1 \leq i \leq N - 1), the i-th edge connects Vertex x_i and y_i.  Taro has decided to paint each vertex in white or black, so that any black vertex can be reached from any other black vertex by passing through only black vertices.  You are given a positive integer M. For each v (1 \leq v \leq N), answer the following question:    * Assuming that Vertex v has to be black, find the number of ways in which the vertices can be painted, modulo M.

Incorrect submission (verdict: Wrong Answer):
n,m,*t=map(int,open(0).read().split())
e=[[]for _ in range(n)]
for a,b in zip(*[iter(t)]*2):
  e[a-1]+=b-1,
  e[b-1]+=a-1,
o=[]
s=[0]
f=[1]*n
for v in s:
  o+=v,
  f[v]=0
  t=[]
  for w in e[v]:
    if f[w]:
      s+=w,
      t+=w,
  e[v]=t
dp1=[0]*n
for v in o[::-1]:
  t=1
  for w in e[v]:
    t=t*(dp1[w]+1)%m
  dp1[v]=t
dp2=[0]*n
dp2[0]=1
for v in o:
  t=dp2[v]*dp1[v]%m
  for w in e[v]:
    dp2[w]=t*pow(dp1[w]+1,m-2,m)+1
for dp1,dp2 in zip(dp1,dp2):
  print(dp1*dp2%m)

Fixed, accepted submission:
n,m,*t=map(int,open(0).read().split())
e=[[]for _ in range(n)]
for a,b in zip(*[iter(t)]*2):
  e[a-1]+=b-1,
  e[b-1]+=a-1,
o=[]
s=[0]
f=[1]*n
for v in s:
  o+=v,
  f[v]=0
  t=[]
  for w in e[v]:
    if f[w]:
      s+=w,
      t+=w,
  e[v]=t
dp1=[0]*n
c=[[]for _ in range(n)]
for v in o[::-1]:
  c1,c2=[1],[1]
  for w in e[v]:
    c1+=c1[-1]*(dp1[w]+1)%m,
  for w in e[v][::-1]:
    c2+=c2[-1]*(dp1[w]+1)%m,
  dp1[v]=c1[-1]
  c[v]=c1,c2[-2::-1]
dp2=[0]*n
dp2[0]=1
for v in o:
  t=dp2[v]
  for w,c1,c2 in zip(e[v],*c[v]):
    dp2[w]=(t*c1*c2+1)%m
for dp1,dp2 in zip(dp1,dp2):
  print(dp1*dp2%m)
Problem:
On some day in January 2018, Takaki is writing a document. The document has a column where the current date is written in `yyyy/mm/dd` format. For example, January 23, 2018 should be written as `2018/01/23`.  After finishing the document, she noticed that she had mistakenly wrote `2017` at the beginning of the date column. Write a program that, when the string that Takaki wrote in the date column, S, is given as input, modifies the first four characters in S to `2018` and prints it.

Incorrect submission (verdict: Wrong Answer):
n = input()
n.replace("2017","2018")
print(n)

Fixed, accepted submission:
s = input()
s = s.replace("2017","2018")
print(s)
Problem:
It is September 9 in Japan now.  You are given a two-digit integer N. Answer the question: Is 9 contained in the decimal notation of N?

Incorrect submission (verdict: Wrong Answer):
n=input()
if n in "9":
    print("Yes")
else:
    print("No")

Fixed, accepted submission:
n=input()
if "9" in n:
    print("Yes")
else:
    print("No")
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a,b = map(int, input().split())
if (a % 2 == 0) and (b % 2 ==0):
    print ('Even')
else:
    print('Odd')

Fixed, accepted submission:
##AtCoder Beginners Selection 	Product

a,b = map(int, input().split())
if (a % 2 == 0) or (b % 2 ==0):
    print ('Even')
else:
    print('Odd')
Problem:
It has been decided that a programming contest sponsored by company A will be held, so we will post the notice on a bulletin board.  The bulletin board is in the form of a grid with N rows and N columns, and the notice will occupy a rectangular region with H rows and W columns.  How many ways are there to choose where to put the notice so that it completely covers exactly HW squares?

Incorrect submission (verdict: Wrong Answer):
N = int(input())
H = int(input())
W = int(input())

print((W-N+1)*(H-N+1))

Fixed, accepted submission:
N = int(input())
H = int(input())
W = int(input())

print((N-W+1)*(N-H+1))
Problem:
Snuke received a positive integer N from Takahashi. A positive integer m is called a _favorite number_ when the following condition is satisfied:    * The quotient and remainder of N divided by m are equal, that is, \lfloor \frac{N}{m} \rfloor = N \bmod m holds.  Find all favorite numbers and print the sum of those.

Incorrect submission (verdict: Wrong Answer):
import numpy as np
N = int(input())

divisor_lst = []
for i in range(1, int(np.sqrt(N))+1):
    if N % i == 0:
        divisor_lst.append(i)
        divisor_lst.append(N//i)
        print(i)

arr = np.array(divisor_lst)
print(arr)
arr -= 1
print(int(np.sum(arr)) - 1)





Fixed, accepted submission:
import numpy as np
N = int(input())

divisor_lst = []
i = 1
while i+2 <= N//i:
    if N % i == 0:
        divisor_lst.append(N//i)
    i += 1    

arr = np.array(divisor_lst)
arr -= 1
print(int(np.sum(arr)))
Problem:
There are N children in AtCoder Kindergarten. Mr. Evi will arrange the children in a line, then give 1 candy to the first child in the line, 2 candies to the second child, ..., N candies to the N-th child. How many candies will be necessary in total?

Incorrect submission (verdict: Wrong Answer):
N = int(input())
print(N * (N + 1) / 2)

Fixed, accepted submission:
N = int(input())
print(N * (N + 1) // 2)
Problem:
Snuke is making sugar water in a beaker. Initially, the beaker is empty. Snuke can perform the following four types of operations any number of times. He may choose not to perform some types of operations.    * Operation 1: Pour 100A grams of water into the beaker.   * Operation 2: Pour 100B grams of water into the beaker.   * Operation 3: Put C grams of sugar into the beaker.   * Operation 4: Put D grams of sugar into the beaker.  In our experimental environment, E grams of sugar can dissolve into 100 grams of water.  Snuke will make sugar water with the highest possible density.  The beaker can contain at most F grams of substances (water and sugar combined), and there must not be any undissolved sugar in the beaker. Find the mass of the sugar water Snuke will make, and the mass of sugar dissolved in it. If there is more than one candidate, any of them will be accepted.  We remind you that the sugar water that contains a grams of water and b grams of sugar is \frac{100b}{a + b} percent. Also, in this problem, pure water that does not contain any sugar is regarded as 0 percent density sugar water.

Incorrect submission (verdict: Time Limit Exceeded):

A, B, C, D, E, F = map(int, input().split())

density = 0
ans = (0, 0)

for a in range(31):
  for b in range(31):
    for c in range(100):
      for d in range(100):
        water = 100*a*A + 100*b*B
        suger = c*C + d*D
         
        if water + suger > F or water == 0:
          continue

        if suger > 0 and (suger / water * 100)  > E:
          continue
        
        tmp = (100 * suger)  / (water + suger)

        if tmp >= density:
          density = tmp
          ans = (water+suger, suger)

print(*ans)

Fixed, accepted submission:

A, B, C, D, E, F = map(int, input().split())

density = -1
ans = (0, 0)

for a in range(31):
  for b in range(31):
    for c in range(101):
      for d in range(101):
        water = 100*a*A + 100*b*B
        suger = c*C + d*D
         
        if water + suger > F or water == 0:
          break

        if (water / 100) * E >= suger:
        
          tmp = (100 * suger)  / (water + suger)

          if tmp > density:
            density = tmp
            ans = (water+suger, suger)

print(*ans)
Problem:
  The International Clown and Pierrot Competition (ICPC), is one of the most distinguished and also the most popular events on earth in the show business.  One of the unique features of this contest is the great number of judges that sometimes counts up to one hundred. The number of judges may differ from one contestant to another, because judges with any relationship whatsoever with a specific contestant are temporarily excluded for scoring his/her performance.  Basically, scores given to a contestant's performance by the judges are averaged to decide his/her score. To avoid letting judges with eccentric viewpoints too much influence the score, the highest and the lowest scores are set aside in this calculation. If the same highest score is marked by two or more judges, only one of them is ignored. The same is with the lowest score. The average, which may contain fractions, are truncated down to obtain final score as an integer.  You are asked to write a program that computes the scores of performances, given the scores of all the judges, to speed up the event to be suited for a TV program.

Incorrect submission (verdict: Wrong Answer):
import sys

while True:
    n = int(sys.stdin.readline().rstrip())
    
    if n == 0:
        break
        
    scores = [int(sys.stdin.readline().rstrip()) for i in range(n)]
    result = (sum(scores) - (min(scores) + max(scores)) // n - 2)
    
    print(result)

Fixed, accepted submission:
import sys

while True:
    n = int(sys.stdin.readline().rstrip())

    if n == 0:
        break

    scores = [int(sys.stdin.readline().rstrip()) for i in range(n)]
    result = (sum(scores) - (max(scores) + min(scores))) // (n - 2)

    print(result)
Problem:
Find the sum of the integers between 1 and N (inclusive), whose sum of digits written in base 10 is between A and B (inclusive).

Incorrect submission (verdict: Wrong Answer):
n,a,b = list(map(int, input().split()))
isum = 0
for i in range(1,n+1):
    tmp = [int(j) for j in list(str(i))]
    if a <= sum(tmp) <= b:
        isum += sum(tmp)
print(isum)

Fixed, accepted submission:
n,a,b = list(map(int, input().split()))
isum = 0
for i in range(1,n+1):
    tmp = [int(j) for j in list(str(i))]
    #print(tmp,sum(tmp))
    if a <= sum(tmp) <= b:
        isum += i
print(isum)
Problem:
Write a program which identifies the number of combinations of three integers which satisfy the following conditions:    * You should select three distinct integers from 1 to n.   * A total sum of the three integers is x.  For example, there are two combinations for n = 5 and x = 9.    * 1 + 3 + 5 = 9   * 2 + 3 + 4 = 9

Incorrect submission (verdict: Wrong Answer):
a=[]
w=""
while(w!="0 0"):
    w=input()
    a.append(w)
a.pop()
for st in a:
    s=st.split()
    n=int(s[0])
    x=int(s[1])
    count=0
    for a in range(1,x//3+1):
        for b in range(a+1,(x-a)//2+1):
            if (x-a-b)<=n and b<(x-a-b):
                count+=1
                print("{0} {1} {2}".format(a,b,x-a-b))
    print("{0}".format(count))

Fixed, accepted submission:
a=[]
w=""
while(w!="0 0"):
    w=input()
    a.append(w)
a.pop()
for st in a:
    s=st.split()
    n=int(s[0])
    x=int(s[1])
    count=0
    for a in range(1,x//3+1):
        for b in range(a+1,(x-a)//2+1):
            if (x-a-b)<=n and b<(x-a-b):
                count+=1
    print("{0}".format(count))
Problem:
AtCoDeer the deer found two positive integers, a and b. Determine whether the product of a and b is even or odd.

Incorrect submission (verdict: Wrong Answer):
a, b = map(int, input().split())

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

Fixed, accepted submission:
a, b = map(int, input().split())

if (a*b) %2 == 0:
    print ('Even')
else:
    print ('Odd')
Problem:
A balance scale tips to the left if L>R, where L is the total weight of the masses on the left pan and R is the total weight of the masses on the right pan. Similarly, it balances if L=R, and tips to the right if L<R.  Takahashi placed a mass of weight A and a mass of weight B on the left pan of a balance scale, and placed a mass of weight C and a mass of weight D on the right pan.  Print `Left` if the balance scale tips to the left; print `Balanced` if it balances; print `Right` if it tips to the right.

Incorrect submission (verdict: Wrong Answer):
a, b, c, d = map(int, input().split())
if a+b < c+d:
  print("Left")
elif a+b == c+d:
  print("Balanced")
else:
  print("Right")

Fixed, accepted submission:
a, b, c, d = map(int, input().split())
if a+b > c+d:
  print("Left")
elif a+b == c+d:
  print("Balanced")
else:
  print("Right")
Problem:
There are N people standing in a row from west to east. Each person is facing east or west. The directions of the people is given as a string S of length N. The i-th person from the west is facing east if S_i = `E`, and west if S_i = `W`.  You will appoint one of the N people as the leader, then command the rest of them to face in the direction of the leader. Here, we do not care which direction the leader is facing.  The people in the row hate to change their directions, so you would like to select the leader so that the number of people who have to change their directions is minimized. Find the minimum number of people who have to change their directions.

Incorrect submission (verdict: Wrong Answer):
S = list(input())
e = S.count('E')
w = S.count('W')
if e > w:
  print(w)
else:
  print(e)

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

E_count = S.count('E')
W_count = 0
mini_count = E_count

for i in S:
  if i == 'E':
    
    E_count -= 1
  else:
    
    W_count += 1
  if mini_count > E_count + W_count:
    mini_count = E_count + W_count
print(mini_count)
Problem:
We will buy a product for N yen (the currency of Japan) at a shop.  If we use only 1000-yen bills to pay the price, how much change will we receive?  Assume we use the minimum number of bills required.

Incorrect submission (verdict: Wrong Answer):
n=int(input())
if n%1000==0:
  print(0)
else:
  print(n-n%1000)

Fixed, accepted submission:
n=int(input())
if n%1000==0:
  print(0)
else:
  print(((n//1000)+1)*1000-n)
Problem:
You can obtain profits from foreign exchange margin transactions. For example, if you buy 1000 dollar at a rate of 100 yen per dollar, and sell them at a rate of 108 yen per dollar, you can obtain (108 - 100) × 1000 = 8000 yen.  Write a program which reads values of a currency $R_t$ at a certain time $t$ ($t = 0, 1, 2, ... n-1$), and reports the maximum value of $R_j - R_i$ where $j > i$ .

Incorrect submission (verdict: Wrong Answer):
N = int(input('R ?????????: '))
R = [int(input('R[%s]: ' % (str(i)))) for i in range(N)]

maxv = -20000000000
minv = R[0]

for i in range(1, N):
    if R[i] - minv > maxv:
        maxv = R[i] - minv
    if minv > R[i]:
        minv = R[i]

print('?????§??????: ' + str(maxv))

Fixed, accepted submission:
N = int(input())
R = [int(input()) for i in range(N)]

maxv = -20000000000
minv = R[0]

for i in range(1, N):
    maxv = max(R[i] - minv, maxv)
    minv = min(R[i], minv)

print(maxv)
Problem:
Write a program which reads two integers x and y, and prints them in ascending order.

Incorrect submission (verdict: Wrong Answer):
#!usr/bin/env python3

def string_two_numbers_spliter():
    x, y = [int(i) for i in input().split()]
    return x, y


def swap_two_numbers_asc(x, y):
    if x > y:
        x, y = y, x
    return x, y


def main():
    while True:
        x, y = string_two_numbers_spliter()
        swap_two_numbers_asc(x, y)
        if x == 0 and y == 0:
            break
        print('%d %d' % (x, y))


if __name__ == '__main__':
    main()

Fixed, accepted submission:
#!usr/bin/env python3

def string_two_numbers_spliter():
    x, y = [int(i) for i in input().split()]
    return x, y


def swap_two_numbers_asc(x, y):
    x, y = y, x
    return x, y


def main():
    while True:
        x, y = string_two_numbers_spliter()
        if x == 0 and y == 0:
            break
        if x > y:
            x, y = swap_two_numbers_asc(x, y)
        print('%d %d' % (x, y))


if __name__ == '__main__':
    main()
Problem:
Let {\rm comb}(n,r) be the number of ways to choose r objects from among n objects, disregarding order. From n non-negative integers a_1, a_2, ..., a_n, select two numbers a_i > a_j so that {\rm comb}(a_i,a_j) is maximized. If there are multiple pairs that maximize the value, any of them is accepted.

Incorrect submission (verdict: Wrong Answer):
import math
import itertools
def comb(n, r):
    return math.factorial(n) // (math.factorial(n - r) * math.factorial(r))
N = int(input())
lst = list(map(int, input().split()))
ans = set(itertools.combinations(lst, 2))
max = 0
for i in ans:
    if i[0] > i[1]:
        n = i[0]
        r = i[1]
    else:
        n = i[1]
        r = i[0]
    x = comb(n, r)
    if x >= max:
        pair = [n, r]
print(*pair)

Fixed, accepted submission:
import bisect
import math
N = int(input())
lst = list(map(int, input().split()))
lst.sort()
n = max(lst)
a = bisect.bisect_right(lst, n//2)
if abs(math.ceil(n/2)-lst[a]) >= abs(math.ceil(n/2)-lst[a-1]):
    print(n, lst[a-1])
else:
    print(n, lst[a])
Problem:
Our world is one-dimensional, and ruled by two empires called Empire A and Empire B.  The capital of Empire A is located at coordinate X, and that of Empire B is located at coordinate Y.  One day, Empire A becomes inclined to put the cities at coordinates x_1, x_2, ..., x_N under its control, and Empire B becomes inclined to put the cities at coordinates y_1, y_2, ..., y_M under its control.  If there exists an integer Z that satisfies all of the following three conditions, they will come to an agreement, but otherwise war will break out.    * X < Z \leq Y   * x_1, x_2, ..., x_N < Z   * y_1, y_2, ..., y_M \geq Z  Determine if war will break out.

Incorrect submission (verdict: Wrong Answer):
N, M, X, Y = map(int, input().split())
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]
print(x, y)
if X < Y:
    max_x = max(x)
    min_y = min(y)
    if max_x+1 < min_y:
        print("No War")
    else:
        print("War")
else:
    min_x = min(x)
    max_y = max(y)
    if min_x > max_y+1:
        print("No War")
    else:
        print("War")


Fixed, accepted submission:
N, M, X, Y = map(int, input().split())
x = [int(i) for i in input().split()]
y = [int(i) for i in input().split()]

max_x = max(x)
min_y = min(y)
if max_x < min_y and max_x < Y and min_y > X:
    print("No War")
else:
    print("War")
Problem:
Write a program which judges wheather given length of three side form a right triangle. Print "YES" if the given sides (integers) form a right triangle, "NO" if not so.

Incorrect submission (verdict: Wrong Answer):
tri_list = []
N =  int(input())

for i in range(N):
    tri = input()
    tri_list.append(tri.split())
    
for i in range(N):
    tri_list[i].sort()
    print(tri_list[i])
    if int(tri_list[i][2])^2 == int(tri_list[i][0])^2 + int(tri_list[i][1])^2 :
        print("YES")
    else :
        print("NO")


Fixed, accepted submission:
n =  int(input())
for i in range(n):
    tri_list = list(map(int,input().split(" ")))
    tri_list.sort()
    a = int(tri_list[2]) ** 2
    b = int(tri_list[0]) ** 2 + int(tri_list[1]) ** 2
    if a == b:
        print("YES")
    else:
        print("NO")
Problem:
Two students of AtCoder Kindergarten are fighting over candy packs.  There are three candy packs, each of which contains a, b, and c candies, respectively.  Teacher Evi is trying to distribute the packs between the two students so that each student gets the same number of candies. Determine whether it is possible.  Note that Evi cannot take candies out of the packs, and the whole contents of each pack must be given to one of the students.

Incorrect submission (verdict: Wrong Answer):
a = list(map(int,input().split()))
b = a.pop(a.index(max(a)))
if b == sum(a):
  print("YES")
else:
  print("NO")

Fixed, accepted submission:
a = list(map(int,input().split()))
b = a.pop(a.index(max(a)))
if b == sum(a):
  print("Yes")
else:
  print("No")
Problem:
Sitting in a station waiting room, Joisino is gazing at her train ticket.  The ticket is numbered with four digits A, B, C and D in this order, each between 0 and 9 (inclusive).  In the formula A op1 B op2 C op3 D = 7, replace each of the symbols op1, op2 and op3 with `+` or `-` so that the formula holds.  The given input guarantees that there is a solution. If there are multiple solutions, any of them will be accepted.

Incorrect submission (verdict: Wrong Answer):
s = input()

n = 3
for i in range(2**n):
    ans = s[0]
    sum = int(s[0])
    for j in range(3):
        if 1 & (i >> j):
            ans += f'+{s[j+1]}'
            sum += int(s[j+1])
        else:
            ans += f'-{s[j+1]}'
            sum -= int(s[j+1])
    if sum == 7:
        print(f'{ans}+7')
        exit()


Fixed, accepted submission:
s = input()

n = 3
for i in range(2**n):
    ans = s[0]
    sum = int(s[0])
    for j in range(3):
        if 1 & (i >> j):
            ans += f'+{s[j+1]}'
            sum += int(s[j+1])
        else:
            ans += f'-{s[j+1]}'
            sum -= int(s[j+1])
    if sum == 7:
        print(f'{ans}=7')
        exit()