Harryxun/GPT-100-sft-dataset huggingface dataset:
Problem p02602 (python)

Fixed submission:
N, K = map(int, input().split())
A = list(map(int, input().split()))
 
for i in range(N - K):
  score_2 = A[i+K]
  score_1 = A[i]
  print('Yes' if score_1 < score_2 else 'No')

Buggy submission (verdict: Runtime Error):
def main():
    N, K = list(map(int, input().split(' ')))
    Ai = list(map(int, input().split(' ')))
    # print(Ai)
    P = []
    prev = 0
    now = 0
    
    S = [1]
    for index, i in enumerate(range(len(Ai)-K*2, len(Ai))):
        S.append(S[index] * Ai[i])
    # print(S, len(S))
    
    for n in range(K-1,N-1):
        # print(n, S[n], n-K, S[n-K])
        a1 = S[n] // S[n-K]
        a2 = S[n+1] // S[n-K+1]
        
        if a2 > a1:
            print('Yes')
        else:
            print('No')
        

main()
Problem p02696 (python)

Fixed submission:
from math import floor, gcd

def f(x, A, B):
    return floor(A * x / B) - A * floor(x / B)

def main():
    A, B, N = list(map(int, input().split(' ')))
    
    tmp = 0
    
    # mods = []
    
    a = f(min(B-1, N), A, B)
    print(a)
    
    
main()

Buggy submission (verdict: Runtime Error):
from math import floor, gcd

def lcm(x, y):
    return (x * y) // gcd(x, y)

def main():
    A, B, N = list(map(int, input().split(' ')))
    
    tmp = 0
    
    mods = []
    # print([A * x % B for x in range(B)])
    for x in range(B):
        m = A * x % B
        if m >= 1:
            mods.append(m)
    
    # print(mods)
    if A <= B:
        index = mods.index(min(mods))
    else:
        index = mods.index(max(mods))
    print(index+1)

    # for x in range(1, N+1):
    #     out = floor(A * x / B) - floor(x / B)
    #     tmp = max(tmp, out)
    # print(tmp)
    
    
main()
Problem p02717 (python)

Fixed submission:
def main():
    A, B, C = map(int, input().split(' '))
    A, B = B, A
    A, C = C, A
    print(A, B, C)
    
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    A, B, C = map(int, input().split(' '))
    A, B = B, A
    A, C = C, A
    pritn(A, B, C)
    
    
main()
Problem p02742 (python)

Fixed submission:
def main():
    H, W = map(int, input().split(" "))
    # r1 + c1 = r2 + c2
    # r1 - c1 = r2 - c2
    c = H * W
    if H == 1 or W == 1:
        print('1')
        return

    if c % 2 == 0: # OK
        print(c // 2)
    else:
        print((c // 2) + 1)


# def main():
#     H, W = map(int, input().split(" "))
#     # r1 + c1 = r2 + c2
#     # r1 - c1 = r2 - c2

#     if H == 1 or W == 1:
#         print('1')

#     c = H * W
#     if c % 2 == 0:
#         print(c // w)
#     else:
#         MAX = max(H, W)
#         MIN = min(H, W)

#         out = MIN * (MIN - 1) + MAX % MIN
        


main()

Buggy submission (verdict: Runtime Error):
def main():
    H, W = map(int, input().split(" "))
    # r1 + c1 = r2 + c2
    # r1 - c1 = r2 - c2

    if H == 1 or W == 1:
        print('1')

    c = H * W
    if c % 2 == 0:
        print(c // w)
    else:
        MAX = max(H, W)
        MIN = min(H, W)

        out = MIN * (MIN - 1) + MAX % MIN
        


main()
Problem p02743 (python)

Fixed submission:
from decimal import Decimal

def main():
    a,b,c = map(int, input().split(" "))

    if Decimal(a).sqrt() + Decimal(b).sqrt() < Decimal(c).sqrt():
        print('Yes')
    else:
        print('No')
main()

Buggy submission (verdict: Runtime Error):
def main():
    a,b,c = map(int, input().split(" "))

    if (4 * a * b) < (c - a - b) * (c - a - b) 2 and (c - a - b) > 0:
        print('Yes')
    else:
        print('No')
main()

Buggy submission (verdict: Runtime Error):
def main():
    a,b,c = map(int, input().split(" "))

    if (4 * a * b) < (c - a - b) * (c - a - b) 2 and (c - a - b) > 0:
        print('Yes')
    else:
        print('No')
main()

Buggy submission (verdict: Runtime Error):
def main():
    a,b,c = map(int, input().split(" "))

    if 4 * a * b < (c - a - b) * (c - a - b) 2 and (c - a - b) > 0:
        print('Yes')
    else:
        print('No')
main()
Problem p02756 (python)

Fixed submission:
from collections import deque

def main():
    S = list(input())
    Q = int(input())
    l = [list(input().split(' ')) for _ in range(Q)]

    d = deque(S)

    FLAG = False

    for li in l:
        if int(li[0]) == 1: # 前後反転
            if FLAG == True:
                FLAG = False
            else:
                FLAG = True
        
        elif int(li[0]) == 2: # 追加, li[1] == 1 => li[2]を先頭に，li[1] == 2 => li[2]を末尾
            if int(li[1]) == 1:
                if FLAG == True:
                    d.append(li[2])
                else:
                    d.appendleft(li[2])
            elif int(li[1]) == 2:
                if FLAG == True:
                    d.appendleft(li[2])
                else:
                    d.append(li[2])

    S = ''.join(d)
    if FLAG:
        S = S[::-1]
    print(S)


main()

Buggy submission (verdict: Runtime Error):
from collections import deque

def main():
    S = list(input())
    Q = int(input())
    l = [list(input().split(' ')) for _ in range(Q)]

    d = deque(S)

    FLAG = False

    for li in l:
        if int(li[0]) == 1: # 前後反転
            if FLAG == True:
                FLAG = False
            else:
                FLAG = True
        
        elif int(li[0]) == 2: # 追加, li[1] == 1 => li[2]を先頭に，li[1] == 2 => li[2]を末尾
            if int(li[1]) == 1:
                if FLAG == True:
                    d.append(li[2])
                else:
                    d.appendleft(li[2])
            elif int(li[1]) == 2:
                if FLAG == True:
                    d.appendleft(li[2])
                else:
                    d.append(li[2])
                    
                # S.append(li[2])
        # print(S)
    if FLAG:
        d = d[::-1]
    print(''.join(d))


main()
Problem p03101 (python)

Fixed submission:
def main():
  H, W = map(int, input().split(' '))
  h, w = map(int, input().split(' '))
  
  a = H*W
  b = (h * W) + (w * H) - h * w
  print(a - b)
  


main()

Buggy submission (verdict: Runtime Error):
import numpy as np

from sys import exit

def main():
  A, B = map(int, input().split(' '))
  values = range(A, B+1)
  # values = []

  # for n in N:
  #   values.append('{:043b}'.format(n))

  values = np.array(values)
  for i, value in enumerate(values):
    if i == 0:
      result = value
    else:
      result = np.bitwise_xor(result, value)
  print(int(result))
    
  # if len(values) == 1:
  #   print(int(values[0], 2))
  #   return

  # result = ''

  # if len(values) % 2 == 1:
  #   for n in range(43):
  #     num_zero = 0
  #     for value in values:
  #       if value[n] == '0':
  #         num_zero += 1

  #     if num_zero % 2 == 0:
  #       result += '1'
  #     else:
  #       result += '0'

  # else:
  #   for n in range(43):
  #     num_zero = 0

  #     for value in values:
  #       if value[n] == '0':
  #         num_zero += 1

  #     if num_zero % 2 == 0:
  #       result += '0'
  #     else:
  #       result += '1'
  # print(int(result, 2))
  
main()
Problem p03244 (python)

Fixed submission:
from collections import Counter


def main():
    n = int(input())
    v_n = input().split(' ')
    
    gu = Counter(v_n[::2])
    ki = Counter(v_n[1::2])

    guusuu = gu.most_common()
    kisuu = ki.most_common()

    # print(guusuu, len(guusuu))
    # print(kisuu, len(kisuu))
    
    if guusuu[0][0]==kisuu[0][0]:
        if len(guusuu)==1 and len(kisuu)==1:
            # n=4, `4 4 4 4`
            # print('----------')
            print(guusuu[0][1])
        else:
            print(min(n - guusuu[0][1] - kisuu[1][1], n - guusuu[1][1] - kisuu[0][1]))
    else:
        print(n - guusuu[0][1] - kisuu[0][1])

main()

Buggy submission (verdict: Runtime Error):
from collections import Counter


def main():
    n = int(input())
    v_n = input().split(' ')
    
    gu = Counter(v_n[::2])
    ki = Counter(v_n[1::2])

    guusuu = gu.most_common()
    kisuu = ki.most_common()
    
    if guusuu[0][0]==kisuu[0][0]:
        print(min(n - guusuu[0][1] - kisuu[1][1], n - guusuu[1][1] - kisuu[0][1]))
    else:
        print(n - guusuu[0][1] - kisuu[0][1])

main()
Problem p03262 (python)

Fixed submission:
from functools import reduce

def gcds(a, b):
	while b:
		a, b = b, a % b
	return a

def gcd(*numbers):
  return reduce(gcds, numbers)

def solve():
  n, start = map(int, input().split())
  cities = input().split(" ")
  # Startを0からに変更
  cities = [int(i) - start for i in cities]
  print(abs(gcd(*cities)))

solve()

Buggy submission (verdict: Runtime Error):
import math
from functools import reduce

def gcd(*numbers):
  return reduce(math.gcd, numbers)

def solve():
  n, start = map(int, input().split())
  cities = input().split(" ")
  # Startを0からに変更
  cities = [int(i) - start for i in cities]
  print(gcd(*cities))

solve()
Problem p03292 (python)

Fixed submission:
l = list(map(int, input().split(" ")))

l = sorted(l)
cost_1 = abs(l[1] - l[0])
cost_2 = abs(l[2] - l[1])
r = cost_1 + cost_2
print(r)

Buggy submission (verdict: Runtime Error):
def gcd(a, b):
	while b:
		a, b = b, a % b
	return a

def lcm(a, b):
	return a * b // gcd (a, b)

def f(m, input):
  r = 0
  for i in input:
    r += m % i
  return r

N = map(int, input())
a_n = list(map(int, input().split(" ")))
a_n = sorted(a_n)

max = 0
for x in a_n:
  max += x
 
# result = []
# for m in range(max):
  # out = f(m, a_n)
  # result.append(out)
# re = sorted(result)
#print(re[-1])
#print(max) #994 518 941 851 647 2 581 -> 4534
print(max - len(a_n))
Problem p03469 (python)

Fixed submission:
def solve():
    s = input().split("/")
    print("2018/{}/{}".format(s[1], s[2]))

solve()

Buggy submission (verdict: Runtime Error):
def solve():
    n, y = map(int, input().split())
    y = y // 1000
    for nogu in range(n+1):
        for higu in range(n + 1 - nogu):
            yuki = n - higu - nogu
            total = yuki*10 + higu*5 + nogu
            if total == y:
                print(yuki, higu, nogu)
                return
    print("-1 -1 -1")

solve()
Problem p03486 (python)

Fixed submission:
def solve():
    s = input()
    t = input()

    s = sorted(s)
    t = sorted(t, reverse=True)

    if "".join(s) < "".join(t):
        print("Yes")
    else:
        print("No")
solve()

Buggy submission (verdict: Runtime Error):
def solve():
    s = input()
    t = input()

    s = sorted(s)
    t = sorted(t, reversed=True)

    if "".join(s) < "".join(t):
        print("Yes")
    else:
        print("No")
solve()
Problem p03639 (python)

Fixed submission:
from collections import Counter

def main():
    N = int(input())
    an = sorted(map(int, input().split(' ')))
    
    # N = 6
    # an = [1, 10, 100]
    # an = [2, 7, 1, 8, 2, 8]
    # an = [1, 2, 3, 4]
    # an = [1, 4, 1]
    # an = [846579189, 56223110]
    
    out = []
    
    for a in an:
        if a % 2 != 0:
            out.append('A')
        elif a % 4 != 0:
            out.append('B')
        else:
            out.append('C') 
    # print(out)
    counter = Counter(out)
    # print(counter)
    num_A = counter['A']
    num_B = counter['B']
    num_C = counter['C']
    # print(num_A, num_B, num_C)
    
    if num_A == 1 and num_B == 1 and num_C ==0:
        print('No')
        return
    
    if not ('B' in out):
        if (num_C + 1) >= num_A:
            print('Yes')
            # return
        else:
            print('No')
            # return
    else:
        if num_B >= num_A:
            print('Yes')
        else:
            print('No')
        
        
        
        
    
main()

Buggy submission (verdict: Runtime Error):
def main():
    N = int(input())
    an = sorted(map(int, input().split(' ')))
    
    # N = 6
    # an = [2, 7, 1, 8, 2, 8]
    # an = [1, 2, 3, 4]
    
    # a = [i % 4 for i in an]
    
    for i in range(len(N)-1):
        a = an[i]
        b = an[i+1]
        c = a * b
        if c % 4 != 0:
            print('No')
            
    print('Yes')
    
    
    
    
    
    
main()
Problem p03720 (python)

Fixed submission:
def solve():
    n, m = map(int, input().split())
    lists = []

    for _ in range(m):
        lists += input().split()
    
    for i in range(1, n + 1):
        print(lists.count(str(i)))


solve()

Buggy submission (verdict: Runtime Error):
def solve():
    n, m = map(int, input().split())
    lists = []

    for _ in range(m):
        lists += input().split()
    
    for i in range(i, n + 1):
        print(lists.count(str(i)))


solve()
Problem p02796 (python)

Fixed submission:
n = int(input())

arm_list = []
for i in range(n):
    array = list(map(int, input().split()))
    a = array[0] - array[1]
    b = array[0] + array[1] - 1
    arm_list.append([a, b])

arm_list.sort(key=lambda x:x[1])

if n == 1:
    print(1)
    exit()
count = 1
a = arm_list[0][1]
b = arm_list[1][0]
for i in range(1, n-1):
    if a < b:
        count += 1
        a = arm_list[i][1]
        b = arm_list[i+1][0]
    else:
        b = arm_list[i+1][0]

if a < b:
    count += 1



print(count)

Buggy submission (verdict: Runtime Error):
n = int(input())

arm_list = []
for i in range(n):
    array = list(map(int, input().split()))
    a = array[0] - array[1]
    b = array[0] + array[1] - 1
    arm_list.append([a, b])

arm_list.sort(key=lambda x:x[1])


count = 1
a = arm_list[0][1]
b = arm_list[1][0]
for i in range(1, n-1):
    if a < b:
        count += 1
        a = arm_list[i][1]
        b = arm_list[i+1][0]
    else:
        b = arm_list[i+1][0]

if a < b:
    count += 1



print(count)
Problem p02814 (python)

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

from fractions import gcd
from functools import reduce

a = [i >> 1 for i in a]

def applied_lcm(x, y):
    g = gcd(x, y)
    x //= g
    y //= g
    if x %2 == 0:
        return 0
    if y %2 == 0:
        return 0
    n = x * y * g
    if n >> 10**9:
        return 0

    return n

p = reduce(applied_lcm, a)
if p == 0:
    ans = 0
else:
    ans = (m//p) - (m//(p+p))
print(ans)

Buggy submission (verdict: Runtime Error):
import fractions
from functools import reduce

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

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

b = lcm_list(a)

m -= int((b/2))
if m < 0:
    print(0)
    exit()

ans = (m//b) + 1
print(int(ans))

Buggy submission (verdict: Runtime Error):
import fractions
from functools import reduce

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

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

b = lcm_list(a)

m -= int((b/2))
if m < 0:
    print(0)
    exit()

ans = (m//b) + 1
print(int(ans))

Buggy submission (verdict: Runtime Error):
import fractions
from functools import reduce

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

def lcm_base(x, y):
    return (x * y) // fractions.gcd(x, y)

def lcm(*numbers):
    return reduce(lcm_base, numbers, 1)

def lcm_list(numbers):
    return reduce(lcm_base, numbers, 1)

b = lcm_list(a)

m -= (b/2)

ans = (m//b) + 1
print(int(ans))
Problem p02888 (python)

Fixed submission:
from bisect import bisect_left

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


a.sort()
count = 0

for i in range(n-2):
    for j in range(i+1, n-1):
        x = bisect_left(a, a[i] + a[j])
        count += x - (j+1)

print(count)

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

a.sort()
count = 0


def binary_search(numbers, target_number):
    # 最小値を仮決め
    low = 0
    # 範囲内の最大値
    high = len(numbers)


    # 目的地を探し出すまでループ
    while low <= high:
        if low == high:
            return low
        # 中央値を求める（index）
        middle = (low + high) // 2
        # 中央値のnumbersの値とtarget_numberが等しい場合
        if numbers[middle] == target_number:
            return middle
        # 中央値のnumbersの値がtarget_numberより小さい場合
        elif numbers[middle] < target_number:
            low = middle + 1
        # 中央値のnumbersの値がtarget_numberより大きい場合
        else:
            high = middle - 1


for i in range(n-2):
    for j in range(i+1, n-1):
        if a[i] + a[j] > max(a):
            count += n - (j+1)
            continue
        index = binary_search(a, (a[i]+a[j]))
        if a[i] + a[j] == a[index]:
            count += (index-(j+1))
        else:
            count += (index - j)


print(count)

Buggy submission (verdict: Runtime Error):
import itertools
from math import factorial

n = int(input())
a = list(map(int, input().split()))
a.sort(reverse=True)
original = a.copy()

count = [0]
daburi = []
c_list = []
c = 1

for i in range(2000):
    if a[0] > a[1] * 2:
        a.pop(0)

for i in range(len(a)-1):
    if a[i] == a[i+1]:
        if a[i] not in daburi:
            daburi.append(a[i])
        c += 1
    else:
        c_list.append(c)
        c = 1

for i in range(len(daburi)):
    if c_list[i] == 2:
        count[0] += n - original.index(2*daburi[i]-1) - 2
    else:
        count[0] += n - original.index(2 * daburi[i] - 1) - c_list[i]
        count[0] += factorial(c_list[i]) / factorial(3) /factorial(c_list[i] - 3)

a = sorted(set(a), key=a.index)

x = list(itertools.combinations(a, 3))

def check_triangle(li):
    li.sort(reverse=True)
    if li[0] < li[1] + li[2]:
        count[0] += 1


for i in x:
    check_triangle(list(i))

print(count[0])
Problem p02900 (python)

Fixed submission:
import fractions

a, b = map(int, input().split())
count = 0


def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


c = make_divisors(a)
d = make_divisors(b)
e = []
for i in c:
    if i in d:
        e.append(i)

e.pop(0)
e.sort()

gcd_list = [1]
for i in e:
    count = 0
    for j in gcd_list:
        if fractions.gcd(i, j) != 1:
            break
        else:
            count += 1
        if count == len(gcd_list):
            gcd_list.append(i)

print(len(gcd_list))

Buggy submission (verdict: Runtime Error):
import math

a, b = map(int, input().split())
count = 0
# a, b = (12, 18)

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors


c = make_divisors(a)
d = make_divisors(b)
e = []
for i in c:
    if i in d:
        e.append(i)

print(e)
e.pop(0)
e.sort()

gcd_list = [1]
for i in e:
    count = 0
    for j in gcd_list:
        if math.gcd(i, j) != 1:
            break
        else:
            count += 1
        if count == len(gcd_list):
            gcd_list.append(i)

# for i in range(len(e)):
#     for j in range(i+1, len(e)):
#         if math.gcd(e[i], e[j]) == 1:
#             print(e[i], e[j])
#             count += 1

print(len(gcd_list))
Problem p02923 (python)

Fixed submission:
a = int(input())

b = list(map(int, input().split()))
c = []
count = 0

if a == 1:
    print(0)
    exit()

for i in range(a-1):
    if b[i] >= b[i+1]:
        count += 1
    else:
        count = 0
    c.append(count)

print(max(c))

Buggy submission (verdict: Runtime Error):
a = int(input())

b = list(map(int, input().split()))
c = []
count = 0

for i in range(a-1):
    if b[i] >= b[i+1]:
        count += 1
    else:
        count = 0
    c.append(count)

print(max(c))
Problem p02975 (python)

Fixed submission:
from collections import defaultdict

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

if len(set(a)) == 1 and list(set(a))[0] == 0:
    print('Yes')
    exit()

if n % 3 == 0 and len(set(a)) == 3:
    x = list(set(a))
    e = x[0]
    b = x[1]
    c = x[2]
    if e ^ b != c:
        print('No')
        exit()
    if b ^ c != e:
        print('No')
        exit()
    if c ^ e != b:
        print('No')
        exit()
    d = defaultdict(int)
    for i in a:
        d[i] += 1
    if d[e] != d[b] or d[b] != d[c] or d[c] != d[e]:
        print('No')
        exit()
    print('Yes')
elif n % 3 == 0 and len(set(a)) == 2:
    x = list(set(a))
    x.sort()
    if x[0] == 0:
        t = 1
    else:
        print('No')
        exit()
    d = defaultdict(int)
    for i in a:
        d[i] += 1
    if d[x[0]]*2 == d[x[1]]:
        print('Yes')
        exit()
    print('No')
else:
    print('No')

Buggy submission (verdict: Runtime Error):
from collections import defaultdict

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

if n % 3 == 0 and len(set(a)) == 3:
    x = list(set(a))
    a = x[0]
    b = x[1]
    c = x[2]
    if a ^ b != c:
        print('No')
        exit()
    if b ^ c != a:
        print('No')
        exit()
    if c ^ a != b:
        print('No')
        exit()
    d = defaultdict(int)
    for i in a:
        d[i] += 1
    if d[a] != d[b] or d[b] != d[c] or d[c] != d[a]:
        print('No')
        exit()
    print('Yes')
elif n % 2 == 0 and len(set(a)) == 2:
    x = list(set(a))
    x.sort()
    if x[0] == 0:
        t = 1
    else:
        print('No')
        exit()
    d = defaultdict(int)
    for i in a:
        d[i] += 1
    if d[x[0]] != d[x[1]]:
        print('No')
        exit()
    print('Yes')
else:
    print('No')
Problem p02995 (python)

Fixed submission:
import fractions

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

# 最小公倍数を求める
def lcm(x, y):
    return (x * y) // fractions.gcd(x, y)

def cal(num, a, b):
    x = num // a
    y = num // b
    z = num // (lcm(a, b))
    return num - (x + y - z)

num_a = cal(b, c, d)
num_b = cal(a-1, c, d)

print(num_a - num_b)

Buggy submission (verdict: Runtime Error):
import math

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

# 最小公倍数を求める
def lcm(x, y):
    return (x * y) // math.gcd(x, y)

def cal(num, a, b):
    x = num // a
    y = num // b
    z = num // (lcm(a, b))
    print('z={}'.format(z))
    return num - (x + y - z)

num_a = cal(b, c, d)
num_b = cal(a-1, c, d)

print(num_a - num_b)

Buggy submission (verdict: Runtime Error):
import math

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


num_b = b - (b // c) - (b // d) + (b // (c * d / math.gcd(c, d)))
num_a = a - 1 - ((a - 1 ) // c) - ((a - 1) // d) + ((a - 1) // (c * d / math.gcd(c, d)))
num = num_b - num_a

print(int(num))