Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
a, b, c, x = [int(input()) for i in range(4)]
counter = 0

for rep1 in range(a + 1):
    for rep2 in range(b + 1):
        for rep3 in range(c + 1):
            if rep1 * 500 + rep2 * 100 + rep3 * 50 == x:
                counter += 1

print(counter)


Fixed submission:
x, a, b = [int(input()) for i in range(3)]

print((x - a) % b)

Buggy python submission (verdict: Runtime Error):
a = int(input())
b = int(input())
c = int(input())
x = int(input())
ans = 0

for re1 in range(a +1):
    for re2 in range(b + 1):
        for re3 in range(c + 1):
            if re1*500 + re2*100 + re3*50 == x:
                ans += 1

Fixed submission:
x, a, b = [int(input()) for i in range(3)]

print((x - a) % b)
Buggy python submission (verdict: Runtime Error):
n = int(input())
for i in range(n):
    t, x, y = map(int, input().split())

    if (t + x + y) % 2 == 1 or (x + y) > t:
        print("No")
        exit()

print("Yes")

Fixed submission:
a, b = map(int, input().split())
print("Odd") if (a * b) % 2 == 1 else print("Even")
Buggy python submission (verdict: Runtime Error):
n, y = map(int, input().split())
y = y/1000
answer= ""

for rep1 in range(n + 1):
    for rep2 in range(n + 1):
        for rep3 in range(n + 1):
            if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
                answer = ("rep1 rep2 rep3")
                break

print(answer) if answer != "" else print("-1 -1 -1")


Fixed submission:
print(input().replace("2017", "2018"))

Buggy python submission (verdict: Runtime Error):
n, y = map(int, input().split())
y = y/1000
counter = []

for rep1 in range(n + 1):
    for rep2 in range(n + 1):
        for rep3 in range(n + 1):
            if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
                counter = ([rep1, rep2, rep3])
                break

print(counter) if counter != [] else print("-1 -1 -1")

Fixed submission:
print(input().replace("2017", "2018"))
Buggy python submission (verdict: Time Limit Exceeded):
n, y = map(int, input().split())
y = y/1000
answer= []

for rep1 in range(n + 1):
    for rep2 in range(n + 1 - rep1):
        for rep3 in range(n + 1 - rep1 - rep2):
            if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
                answer = [rep1,rep2, rep3]
                break

print(answer[0], answer[1], answer[2]) if answer != [] else print("-1 -1 -1")


Fixed submission:
n, y = map(int, input().split())
y = y/1000
answer= []

for ten in range(n + 1):
    for five in range(n + 1 - ten):
        one = n - ten - five
        if ten * 10 + five * 5 + one == y:
            answer = [ten, five, one]
            break

print(answer[0], answer[1], answer[2]) if answer != [] else print("-1 -1 -1")

Buggy python submission (verdict: Time Limit Exceeded):
n, y = map(int, input().split())
y = y/1000
answer= []

for rep1 in range(n + 1):
    for rep2 in range(n + 1):
        for rep3 in range(n + 1):
            if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
                answer = [rep1,rep2, rep3]
                break

print(answer[0], answer[1], answer[2]) if answer != [] else print("-1 -1 -1")


Fixed submission:
n, y = map(int, input().split())
y = y/1000
answer= []

for ten in range(n + 1):
    for five in range(n + 1 - ten):
        one = n - ten - five
        if ten * 10 + five * 5 + one == y:
            answer = [ten, five, one]
            break

print(answer[0], answer[1], answer[2]) if answer != [] else print("-1 -1 -1")

Buggy python submission (verdict: Runtime Error):
n, y = map(int, input().split())
y = y/1000
answer= []

for rep1 in range(n + 1):
    for rep2 in range(n + 1):
        for rep3 in range(n + 1):
            if rep1 + rep2 + rep3 == n and rep1 * 10 + rep2 * 5 + rep3 == y:
                answer = ([rep1, rep2, rep3])
                break

print(counter) if counter != [] else print("-1 -1 -1")

Fixed submission:
n, y = map(int, input().split())
y = y/1000
answer= []

for ten in range(n + 1):
    for five in range(n + 1 - ten):
        one = n - ten - five
        if ten * 10 + five * 5 + one == y:
            answer = [ten, five, one]
            break

print(answer[0], answer[1], answer[2]) if answer != [] else print("-1 -1 -1")
Buggy python submission (verdict: Time Limit Exceeded):
from itertools import accumulate
def is_prime(n):
   if n == 1:
       return False
   for i in range(2, int(n ** 0.5) + 1):
       if n % i == 0:
           return False
   return True

for _ in range(int(input())):
    l, r = map(int, input().split())
    c = [0] * (r + 1)

    check = []
    for i in range(l, r+1):
        if (i % 2 == 1):
            flg = (is_prime(i) and is_prime((i+1)/2))
        else:
            flg = 0
        check.append(flg)

    check = [0] + check
    check = list(accumulate(check))
    print(check[-1]-check[0])

Fixed submission:
from itertools import accumulate
def is_prime(n):
   if n == 1:
       return False
   for i in range(2, int(n ** 0.5) + 1):
       if n % i == 0:
           return False
   return True

q = int(input())

l, r = [],[]
for _ in range(q):
    t, tt = map(int, input().split())
    l.append(t)
    r.append(tt)

m_r = max(r)

table = [0] * (m_r + 2)
for i in range(1, m_r + 1, 2):
    if is_prime(i) and is_prime((i + 1) // 2):
        table[i] = 1

c_table = list(accumulate(table))

for i in range(q):
    print(c_table[r[i]] - c_table[l[i]-1])
Buggy python submission (verdict: Runtime Error):
n, a, b = map(int, input().split())
counter = 0

for i in range(1, n):
    str_i = str(i)
    sum_i = sum(map(int, str_i))
    if a <= sum_i <= b:
        counter += i

print(counter)


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

print("Left" if a+b > c+d else "Balanced" if a+b == c+d else "Right")

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

for i in range(1, n):
    str_i = str(i)
    sum_i = sum(map(int, str_i))
    if a <= sum_i <= b:
        counter += i

print(counter)

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

print("Left" if a+b > c+d else "Balanced" if a+b == c+d else "Right")
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
a_joined = 0

for i in range(n):

	a_joined = a_joined | a[i]

a_joined = a_joined & -(a_joined)
print(len(bin(a_joined)) - 3)

Fixed submission:
print(str(input()).count("1"))

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

for i in range(n):

	a_joined = a_joined | a[i]

print(len(bin(a_joined)) - 3)


Fixed submission:
print(str(input()).count("1"))

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

for i in range(n):

	a_joined = a_joined | a[i]

print(len(bin(a_joined)) - 3)

Fixed submission:
print(str(input()).count("1"))
Buggy python submission (verdict: Time Limit Exceeded):
from bisect import bisect_left

n = int(input())

a = sorted(list(map(int, input().split())))
b = sorted(list(map(int, input().split())))
c = sorted(list(map(int, input().split())))

second_list = []
for i in b:
    second_list.append(bisect_left(a, i))

ans = 0
for i in c:
    ans += sum(second_list[0:bisect_left(b, i)])

print(ans)

Fixed submission:
from bisect import bisect_left, bisect_right

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

ans = 0
for i in b:
    ans += bisect_left(a, i) * (n - bisect_right(c, i))

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

second_list = [0] * n

for B in range(n):
    second_list[B] = sum(b[B] > i for i in a)

ans = 0
for C in range(n):
    for i in range(n):
        ans += second_list[i] if c[C] > b[i] else 0 

print(ans)

Fixed submission:
from bisect import bisect_left, bisect_right

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

ans = 0
for i in b:
    ans += bisect_left(a, i) * (n - bisect_right(c, i))

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())

a = list(map(int, input().split()))
b = list(map(int, input().split()))
c = list(map(int, input().split()))

ans_list = [0] * n
for r in range(n):
    temp = [i for i in a if b[r] > i]
    ans_list[r] = len(temp) 

ans_list2= [0] * n
for r in range(n):
    temp = [ans_list[i] for i in range(n) if c[r] > b[i]]
    ans_list2[r] += sum(temp)

print(sum(ans_list2))

Fixed submission:
from bisect import bisect_left, bisect_right

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

ans = 0
for i in b:
    ans += bisect_left(a, i) * (n - bisect_right(c, i))

print(ans)
Buggy python submission (verdict: Runtime Error):
print(3 ** int(input()) - reduce(lambda x,y: x*y, (1 if i % 2 == 1 else 2 for i in map(int, input().split()

Fixed submission:
N = int(input())
A = list(map(int, input().split()))

odds = 1
for i in A:
    odds *= 1 if i % 2 == 1 else 2

print(3 ** N - odds)

Buggy python submission (verdict: Runtime Error):
print(3 ** int(input()) - reduce(mul, (1 if i % 2 == 1 else 2 for i in map(int, input().split()))))


Fixed submission:
N = int(input())
A = list(map(int, input().split()))

odds = 1
for i in A:
    odds *= 1 if i % 2 == 1 else 2

print(3 ** N - odds)
Buggy python submission (verdict: Runtime Error):
n = input()
ans = 0
for i in range(n):
    l, r = map(int, (input().split()))
    ans += r - l + 1
print(ans)

Fixed submission:
n = int(input())
ans = 0
for i in range(n):
    l, r = map(int, input().split())
    ans += r - l + 1
print(ans)
Buggy python submission (verdict: Runtime Error):
n = int(input())
a = list(map(int, input().split()))
sorted_a = sorted([i[0]for i in Counter(a).most_common() if i[1] >= 2], reverse=True)
print(sorted_c_a[0] * sorted_c_a[1] if len(sorted_c_a) >= 2 else 0)

Fixed submission:
from collections import *

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

filtered_a = sorted([i for i in Counter(a).most_common() if i[1] >= 2], reverse=True)

print(  0 if len(filtered_a) < 2
        else filtered_a[0][0] ** 2 if filtered_a[0][1] >= 4
        else filtered_a[0][0] * filtered_a[1][0])
Buggy python submission (verdict: Runtime Error):
n = int(input())
graph = [list() for i in range(n+1)]

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

len_list = [float("inf")] * (n + 1)
q, k = map(int, input().split())

def dfs(pre, now, c):
    len_list[now] = min(len_list[now], len_list[pre] + c)

    while graph[now]:
        n, c = graph[now].pop()
        dfs(now, n, c)

len_list[k] = 0
dfs(k, k, 0)

for _ in range(q):
    x, y = map(int, input().split())
    print(len_list[x] + len_list[y])

Fixed submission:
import sys
sys.setrecursionlimit(10000000)

n = int(input())
graph = [list() for i in range(n+1)]

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

q, k = map(int, input().split())

def dfs(pre, now, c):
    len_list[now] = min(len_list[now], len_list[pre] + c)

    while graph[now]:
        n, c = graph[now].pop()
        dfs(now, n, c)

len_list = [float("inf")] * (n + 1)
len_list[k] = 0
dfs(k, k, 0)

for _ in range(q):
    x, y = map(int, input().split())
    print(len_list[x] + len_list[y])
Buggy python submission (verdict: Runtime Error):
s = input()
print(s[0] + str(len(s) - 2) + s[-1]))

Fixed submission:
s = input()
print(s[0] + str(len(s) - 2) + s[-1])
Buggy python submission (verdict: Runtime Error):
H, W = map(int, input().split())
N = int(input())
a = list(map(int, input().split()))

ans_list = ([[i+1] * a[i] for i in range(N)])
ans_list = reduce(lambda a, b: a + b, ans_list)

for i in range(H):
    print(ans_list[i*W:i*W+W] if i%2 == 0 else ans_list[i*W+W-1:i*W-1:-1])

Fixed submission:
from functools import *

H, W = map(int, input().split())
N = int(input())
a = list(map(int, input().split()))

ans_list = ([[i+1] * a[i] for i in range(N)])
ans_list = reduce(lambda a, b: a + b, ans_list)

for i in range(H):
    ans = ans_list[i*W:i*W+W] if i%2 == 0 else ans_list[i*W+W-1:i*W-1:-1]
    print(*ans)
Buggy python submission (verdict: Runtime Error):
n, m = map(int, input().split())

graph = [list() for i in range(n+1)]

for i in range(m):
    a, b = map(int, (input().split()))
    graph[a] += [b]
    graph[b] += [a]

for i in graph[1]:
    if n in graph[i]:
        print("POSSIBLE")
        exit()
        
print(IMPOSSIBLE)

Fixed submission:
n, m = map(int, input().split())

graph = [list() for i in range(n+1)]

for i in range(m):
    a, b = map(int, (input().split()))
    graph[a] += [b]
    graph[b] += [a]

for i in graph[1]:
    if n in graph[i]:
        print("POSSIBLE")
        exit()
        
print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(m)]

for a, b in ab:
    if a == 1:
        for a2, b2 in ab:
            if a2 == b and b2 == n:
                print("POSSIBLE")
                exit()
    if b == 1:
        for a2, b2 in ab:
            if b2 == a and a2 == n:
                print("POSSIBLE")
                exit()

print("IMPOSSIBLE")

Fixed submission:
n, m = map(int, input().split())

graph = [list() for i in range(n+1)]

for i in range(m):
    a, b = map(int, (input().split()))
    graph[a] += [b]
    graph[b] += [a]

for i in graph[1]:
    if n in graph[i]:
        print("POSSIBLE")
        exit()
        
print("IMPOSSIBLE")

Buggy python submission (verdict: Time Limit Exceeded):
n, m = map(int, input().split())
ab = [list(map(int, input().split())) for i in range(m)]

for a, b in ab:
    if a == 1:
        for a2, b2 in ab:
            if a2 == b and b2 == n:
                print("POSSIBLE")
                exit()
    if b == 1:
        for a2, b2 in ab:
            if b2 == a and a2 == n:
                print("POSSIBLE")
                exit()

print("IMPOSSIBLE")

Fixed submission:
n, m = map(int, input().split())

graph = [list() for i in range(n+1)]

for i in range(m):
    a, b = map(int, (input().split()))
    graph[a] += [b]
    graph[b] += [a]

for i in graph[1]:
    if n in graph[i]:
        print("POSSIBLE")
        exit()
        
print("IMPOSSIBLE")
Buggy python submission (verdict: Runtime Error):
n, k = map(int, input().split())
a = list(map(int, input().split()))

from functools import reduce
from math import gcd

g = reduce(gcd, a)

print('POSSIBLE' if (k % g == 0) and (k <= sum(a)) else 'IMPOSSIBLE')


Fixed submission:
n, k = map(int, input().split())
a = list(map(int, input().split()))

from functools import reduce
from fractions import gcd

g = reduce(gcd, a)

print('POSSIBLE' if (k % g == 0) and (k <= max(a)) else 'IMPOSSIBLE')
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
a = [0] + [int(input()) for i in range(n)]

match = []
counter = 0
now = 1
for i in range(n):
    if now == 2:
        print(counter)
        exit()

    elif now not in match:
        match += [now]
        now = a[now]
        counter += 1

    else:
        print("-1")
        exit()

Fixed submission:
n = int(input())
a = [0] + [int(input()) for i in range(n)]

match = []
counter = 0
now = 1
for i in range(n):
    if now == 2:
        print(counter)
        exit()

    else:
        now = a[now]
        counter += 1

print("-1")
Buggy python submission (verdict: Runtime Error):
n = int(input())

colors = [0] * 12
for i in list(map(int, input().split())):
    colors[i//400] += 1

ans = 8 - colors[:8].count(0)
free = sum(colors[8:])

print(max(1, ans), max(1, ans + free))

Fixed submission:
n = int(input())

colors = [0] * 13
for i in list(map(int, input().split())):
    colors[i//400] += 1

ans = 8 - colors[:8].count(0)
free = sum(colors[8:])

print(max(1, ans), max(1, ans + free))
Buggy python submission (verdict: Runtime Error):
n = int(input())
s_counted = Counter(input())

for i in range(n - 1):
    si_counted = Counter(input())
    for j in s_counted:
        if j in si_counted:
            s_counted[j] = min(s_counted[j], si_counted[j])

        else:
            s_counted[j] = 0

ans = ""
for i in sorted(s_counted.most_common()):
    ans += i[1] * i[0]

print(ans)

Fixed submission:
from collections import *

n = int(input())
s_counted = Counter(input())

for i in range(n - 1):
    si_counted = Counter(input())
    for j in s_counted:
        if j in si_counted:
            s_counted[j] = min(s_counted[j], si_counted[j])

        else:
            s_counted[j] = 0

ans = ""
for i in sorted(s_counted.most_common()):
    ans += i[1] * i[0]

print(ans)
Buggy python submission (verdict: Runtime Error):
n, s = map(int, (input().split()))
ans = 0

for x,y in product(range(n+1), range(n+1)):
    if 0 <= s - x - y <= n:
        ans += 1
print(ans)

Fixed submission:
n, s = map(int, (input().split()))
ans = 0

for x in range(n + 1):
    for y in range(n + 1):
        if 0 <= s - x - y <= n:
            ans += 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n, s = map(int, (input().split()))
n += 1
ans = 0

for x in range(n):
    for y in range(n):
        for z in range(n):
            if x + y + z == s:
                ans += 1
print(ans)

Fixed submission:
n, s = map(int, (input().split()))
ans = 0

for x in range(n + 1):
    for y in range(n + 1):
        if 0 <= s - x - y <= n:
            ans += 1
print(ans)
Buggy python submission (verdict: Runtime Error):
s = [ord(i) - 97 for i in input()]
k = int(input())

for i in range(len(s)):
    if 26 - s[i] <= k:
        k -= 26 - s[i]
        s[i] = 0

s[-1] += k

ans = "".join(chr(i+97) for i in s)
print(ans)


Fixed submission:
s = [ord(i) - 97 for i in input()]
k = int(input())

for i in range(len(s)):
    diff = 26 - s[i]
    if (s[i] != 0) and (diff <= k):
        k -= diff
        s[i] = 0

s[-1] = (s[-1] + k) % 26

ans = "".join(chr(i+97) for i in s)
print(ans)
Buggy python submission (verdict: Runtime Error):
print("Yes" if all(i % 2 == 0 for i in Counter(input()).values()) else "No")


Fixed submission:
from collections import Counter

print("Yes" if all(i % 2 == 0 for i in Counter(input()).values()) else "No")
Buggy python submission (verdict: Runtime Error):

N, M = map(int, input().split())
S, C = [], []
for i in range(M):
    s, c = map(int, input().split())
    S.append(s)
    C.append(c)

for i in range(10**(N-1), 10**(N)):
    t = str(i)
    flag = True
    for j in range(M):
        if t[S[j]-1] != str(C[j]):
            flag = False
    if flag:
        print(i)
        F = True
        break
if not F:
    print(-1)

Fixed submission:

N, M = map(int, input().split())
S, C = [], []
for i in range(M):
    s, c = map(int, input().split())
    S.append(s)
    C.append(c)
F = False
for i in range(10**(N)):
    t = str(i)
    flag = True
    if len(t) != N:
        continue
    for j in range(M):
        if t[S[j]-1] != str(C[j]):
            flag = False
    if flag:
        print(i)
        F = True
        break
if not F:
    print(-1)
Buggy python submission (verdict: Time Limit Exceeded):
#!/usr/bin/env python3
import sys

MOD = 1000000007  # type: int


def solve(N: int, A: "List[str]"):
    ans = 0
    for i in range(60):
        z = 0
        o = 0
        for a in A:
            if i + 1 > len(a):
                z += 1
            else:
                if a[len(a) - i - 1] == '0':
                    z += 1
                else:
                    o += 1
        ans += (z * o) * (2 ** i)
        ans %= MOD
    print(ans)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [bin(int(next(tokens)))[2:] for _ in range(N)]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()


Fixed submission:
#!/usr/bin/env python3
import sys

MOD = 1000000007  # type: int


def solve(N: int, A: "List[str]"):
    ans = 0
    for i in range(60):
        z = 0
        o = 0
        for a in A:
            if i + 1 > len(a):
                z += 1
            else:
                if a[len(a) - i - 1] == '0':
                    z += 1
                else:
                    o += 1
        ans += (z * o) * (2 ** i)
        ans %= MOD
    print(ans)
    return


# Generated by 1.1.6 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  # type: int
    A = [bin(int(next(tokens)))[2:] for _ in range(N)]  # type: "List[int]"
    solve(N, A)

if __name__ == '__main__':
    main()
Buggy python submission (verdict: Runtime Error):
#!/usr/bin/env python3
import sys, math


def solve(a: int, b: int, x: int):
    r = 1/2 * a**2 * b
    if x >= r:
        tan = a**3/(2*(a**2*b-x))
    else:
        tan = (2*x)/(a*b**2)
    print(90-math.degrees(math.atan(tan)))
    return


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

if __name__ == '__main__':
    main()


Fixed submission:
#!/usr/bin/env python3
import sys, math


def solve(a: int, b: int, x: int):
    r = 1/2 * a**2 * b
    if x >= r:
        if a**2*b-x != 0:
            tan = a**3/(2*(a**2*b-x))
        else:
            print(0)
            return
    else:
        tan = (2*x)/(a*b**2)
    print(90-math.degrees(math.atan(tan)))
    return


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

if __name__ == '__main__':
    main()