Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Time Limit Exceeded):
n,k  = map(int,input().split())
p = list(map(int, input().split()))
current_best = 0

for i in range(n-(k-1)):
  expect = (sum(p[i:i+k])+k)/2
  if expect > current_best:
    current_best = expect
print(current_best)

Fixed submission:
n,k  = map(int,input().split())
p = list(map(int, input().split()))
current_best = 0
sum_list = [(1+p[0])/2]

if n == 1:
  print(sum_list[0])
  exit()

#累積和の計算
for i in range(n-1):
  sum_list.append(sum_list[-1]+(1+p[i+1])/2)
  
if n==k:
  print(sum_list[-1])
  exit()
  
for j in range(n-k):
  expect = sum_list[j+k]-sum_list[j]
  if expect > current_best:
    current_best = expect
print(current_best)
Buggy python submission (verdict: Time Limit Exceeded):
n,k = list(map(int,input().split()))
h = list(map(int, input().split()))
if n<=k:
  print("0")
  exit()
for i in range(k):
  h.remove(max(h))
print(sum(h))

Fixed submission:
n,k = list(map(int,input().split()))
h = list(map(int, input().split()))
if n<=k:
  print("0")
  exit()
new_h = sorted(h)
for i in range(k):
  new_h.pop(-1)
print(sum(new_h))
Buggy python submission (verdict: Time Limit Exceeded):
h = int(input())
new_h = h
pow_num = 0
ans = 0
attack = 1
preattack = 1


while(1):
  new_h = new_h//2
  pow_num += 1
  if new_h == 1:
    break
for i in range(pow_num):
  preattack = preattack*2
  attack += preattack
print(attack)

Fixed submission:
h = int(input())
new_h = h
pow_num = 0
ans = 0
attack = 1
preattack = 1

if h == 1:
  print("1")
  exit()
while(1):
  new_h = new_h//2
  pow_num += 1
  if new_h == 1:
    break
for i in range(pow_num):
  preattack = preattack*2
  attack += preattack
print(attack)
Buggy python submission (verdict: Runtime Error):
# coding:utf-8
import math
X = int(input())
c = 0
x2 = X%100
for i in range(100000):
  x = 0
  if x2/5 >= 1 :
    x = math.floor(x2/5)
    x2 -= 5*x
  elif x2 / 4 >= 1 :
    x = math.floor(x2/4)
    x2 -= 4*x
  elif x2 / 3 >= 1 :
    x = math.floor(x2/3)
    x2 -= 3*x
  elif x2 / 2 >= 1 :
    x = math.floor(x2/2)
    x2 -= 2*x
  elif x2 / 1 == 1 :
    x = math.floor(x2/1)
    x2 -= 1*x
  c += x
  if x2 == 0:
    break
if X > c*100:
  print("1")
else :
  print("0")

Fixed submission:
# coding:utf-8
m1,d1 = list(map(int, input().split()))
m2,d2 = list(map(int, input().split()))
if m1 != m2:
  print("1")
else:
  print("0")

Buggy python submission (verdict: Runtime Error):
# coding:utf-8
import math
X = int(input())
if X < 100:
  print("0")
  exit()
c = 0
x2 = X%100
for i in range(100000):
  x = 0
  if x2/5 > 1 :
    x = math.floor(x2/5)
    x2 -= 5*x
    five = 5*x
  elif x2 / 4 >= 1 :
    x = math.floor(x2/4)
    x2 -= 4*x
    four = 4*x
  elif x2 / 3 >= 1 :
    x = math.floor(x2/3)
    x2 -= 3*x
    three = 3*x
  elif x2 / 2 >= 1 :
    x = math.floor(x2/2)
    x2 -= 2*x
    two = 2*x
  elif x2 / 1 == 1 :
    x = math.floor(x2/1)
    x2 -= 1*x
    one = 1*x
  c += x
  if x2 == 0:
    break
if c == 0 or X >= c*100:
  print("1")
else :
  print("0")

Fixed submission:
# coding:utf-8
m1,d1 = list(map(int, input().split()))
m2,d2 = list(map(int, input().split()))
if m1 != m2:
  print("1")
else:
  print("0")
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = [input() for i in range(N)]
ans = 0
str_list = []
for i in range(N):
  str_list.append(sorted(s[i]))
for i in range(N):
  for j in range(i+1,N):
    if str_list[i] == str_list[j]:
      ans += 1
      
print(int(ans))

Fixed submission:
n = int(input())
ans = 0
dict = {}
for _ in range(n):
  	#文字列をキーとする辞書型に出現回数を保持する
    s = str(''.join(sorted(list(input()))))
    try:
        ans += dict[s]
        dict[s] += 1
    except:
        dict[s] = 1
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
s = [input() for i in range(N)]
ans = 0
str_list = []
for i in range(N):
  str_list.append(sorted(s[i]))
for i in range(N):
  for j in range(N):
    if i==j:
      continue
    if str_list[i] == str_list[j]:
      ans += 1
print(int(ans/2))

Fixed submission:
n = int(input())
ans = 0
dict = {}
for _ in range(n):
  	#文字列をキーとする辞書型に出現回数を保持する
    s = str(''.join(sorted(list(input()))))
    try:
        ans += dict[s]
        dict[s] += 1
    except:
        dict[s] = 1
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b,c = map(int,input().split())
print(max(a-b,c)

Fixed submission:
a,b,c = map(int,input().split())
print(c-min(a-b,c))
Buggy python submission (verdict: Time Limit Exceeded):
import copy
N = int(input())
A = [int(input()) for i in range(N)]

for i in range(len(A)):
  a = copy.deepcopy(A)
  a.pop(i)
  print(sorted(a)[-1])

Fixed submission:
import numpy as np

N = int(input())
A = [int(input()) for i in range(N)]
A = np.array(A)
first = max(A)
arg = A.argsort()
first_idx = arg[-1]
second_idx = arg[-2]
second = A[second_idx]
for i in range(len(A)):
  if i==first_idx:
    print(second)
  else:
    print(first)

Buggy python submission (verdict: Time Limit Exceeded):
import copy
N = int(input())
A = [int(input()) for i in range(N)]

for i in range(len(A)):
  a = copy.deepcopy(A)
  a.pop(i)
  print(max(a))

Fixed submission:
import numpy as np

N = int(input())
A = [int(input()) for i in range(N)]
A = np.array(A)
first = max(A)
arg = A.argsort()
first_idx = arg[-1]
second_idx = arg[-2]
second = A[second_idx]
for i in range(len(A)):
  if i==first_idx:
    print(second)
  else:
    print(first)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
candidate = None
h.sort()
for i in range(N-K+1):
    tmp = h[i+K-1] - h[i]
    if candidate == None or tmp < candidate:
        candidate = tmp
print(candidate)

Fixed submission:
D = int(input())
ans = "Christmas"
for i in range(25-D):
    ans += " Eve"
print(ans)

Buggy python submission (verdict: Runtime Error):
ans = "Christmas"
for i in range(25-D):
    ans += " Eve"
print(ans)

Fixed submission:
D = int(input())
ans = "Christmas"
for i in range(25-D):
    ans += " Eve"
print(ans)
Buggy python submission (verdict: Runtime Error):
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
candidate = None
h.sort()
for i in range(N-K+1):
    tmp = h[i+K+1] - h[i]
    if candidate == None or tmp < candidate:
        candidate = tmp
print(candidate)

Fixed submission:
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
candidate = None
h.sort()
for i in range(N-K+1):
    tmp = h[i+K-1] - h[i]
    if candidate == None or tmp < candidate:
        candidate = tmp
print(candidate)

Buggy python submission (verdict: Runtime Error):
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
first_flg = True
h.sort()
for i in range(N-K-1):
    tmp = h[i+K-1] - h[i]
    if first_flg or tmp < candidate:
        first_flg = False
        candidate = tmp
print(candidate)

Fixed submission:
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
candidate = None
h.sort()
for i in range(N-K+1):
    tmp = h[i+K-1] - h[i]
    if candidate == None or tmp < candidate:
        candidate = tmp
print(candidate)

Buggy python submission (verdict: Runtime Error):
import numpy as  np
import copy
for i in range(N-K+1):
    
    diff = 0
    print("h[i] is {}".format(h[i]))
    for j in range(K-1):
        if(h[i] >= h[j]):
            target = [a for a in h if a <= h[i] and a >= h[j]]
            print("0")
            exit()
        else :
            target = [a for a in h if a > h[i] and a < h[j]]
        media = (a.pop(np.abs(np.asarray(a) - h[i]).argmin()))
        choose_h =[h[i],h[j],media]
        diff = max(choose_h)-min(choose_h)
        if(diff < candidate):
            candidate = diff
print(candidate)

Fixed submission:
N,K = list(map(int, input().split()))
h = [int(input()) for i in range(N)]
candidate = None
h.sort()
for i in range(N-K+1):
    tmp = h[i+K-1] - h[i]
    if candidate == None or tmp < candidate:
        candidate = tmp
print(candidate)
Buggy python submission (verdict: Runtime Error):
import itertools
N = int(input())
combi = []
l = []
count = 0

def dfs(s):
    if int(s) > N:
        return 0
    ret = 1 if all(s.count(c) > 0 for c in '753') else 0
    for c in '753':
        ret += dfs(s+c)
    return
print(dfs('0'))


Fixed submission:
N = int(input())
def dfs(s):
    if int(s) > N:
        return 0
    ret = 1 if all(s.count(c) > 0 for c in '753') else 0
    for c in '753':
        ret += dfs(s+c)
    return ret
print(dfs('0'))
Buggy python submission (verdict: Runtime Error):
n, m = list(map(int, input().split()))
city_list = [[] for i in range(n)]

for i in range(m):
    pm, ym = list(map(int, input().split()))
    city_list[pm-1].append(ym)
city_list_copied = copy.deepcopy(city_list)

for i in range(n):
    city_list_copied[i].sort()
    for j in range(len(city_list[i])):
        cindex = sum(x <= city_list[i][j] for x in city_list[i])
        print("{:0=6}{:0=6}".format(i+1, cindex))


Fixed submission:
x, y = list(map(int, input().split()))
print("{} ".format(int(x+y/2)))

Buggy python submission (verdict: Runtime Error):
import copy
n, m = list(map(int, input().split()))
city_list = [[] for i in range(n)]
numbers = []

for i in range(m):
    pm, ym = list(map(int, input().split()))
    city_list[pm-1].append(ym)
city_list_copied = copy.deepcopy(city_list)

for i in range(n):
    city_list_copied[i].sort()
    for j in range(len(city_list[i])):
        cindex = city_list_copied[i].index(city_list[i][j])
        print("{:0=6}{:0=6}".format(i+1, cindex+1))

Fixed submission:
x, y = list(map(int, input().split()))
print("{} ".format(int(x+y/2)))
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
x = [0] * N
y = [0] * N
h = [0] * N

for i in range(N):
    x[i], y[i], h[i] = list(map(int, input().split()))

for i in range(101):
    for j in range(101):
        for k in range(N):
            H = h[k] + abs(x[k]-i) + abs(y[k]-j)
            if H < 1:
                continue
            flg = True
            for l in range(N):
                if max (H-abs(x[l]-i)-abs(y[l]-j),0) != h[l] :
                    flg = False
                    break
            if flg:
                print("{} {} {}".format(i,j,H))
                exit()

Fixed submission:
N=int(input())

A=[]
for i in range(N):
    x,y,h=map(int,input().split())
    A.append([h,x,y])
A.sort(reverse=True)

for i in range(101):
    for j in range(101):
        for k in range(N):
            H = A[k][0] + abs(j-A[k][1]) + abs(i-A[k][2])
            flg = True
            for l in A:
                if l[0]!=max(0,H-abs(j-l[1])-abs(i-l[2])):
                    flg = False
                    break
            if flg == True:
                print(j,i,H)
                exit()
Buggy python submission (verdict: Runtime Error):
s = input()
t = input()
dic1 = {}
dic2 = {}
for i in range(len(s)):
    if dic1.get(s[i]) == None:
        dic1[s[i]] = t[i]
    elif dic1[s[i]] != t[i] 
        print("No")
        exit()
    if dic2.get(t[i]) == None:
        dic2[t[i]] = s[i]
    elif dic2[t[i]] != s[i]:
        print("No")
        exit()
print("Yes")

Fixed submission:
s = input()
t = input()
dic1 = {}
dic2 = {}
for i in range(len(s)):
    if dic1.get(s[i]) == None:
        dic1[s[i]] = t[i]
    elif dic1[s[i]] != t[i]:
        print("No")
        exit()
    if dic2.get(t[i]) == None:
        dic2[t[i]] = s[i]
    elif dic2[t[i]] != s[i]:
        print("No")
        exit()
print("Yes")
Buggy python submission (verdict: Time Limit Exceeded):
n = int(input())
ans = 2
while(1):
  if ans%2==0 and ans%n==0:
    break
  ans += 1
print(ans)

Fixed submission:
n = int(input())
ans = n
while(1):
  if ans%2==0 and ans%n==0:
    break
  ans += n
print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
from collections import deque
from sys import stdin


def main():
    N, K = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(x) for x in stdin.readline().rstrip().split()]
    pos = 1
    tmp = deque([pos])
    for _ in range(K):
        pos = As[pos - 1]
        if pos in tmp:
            idx_s = tmp.index(pos)
            break
        tmp.append(pos)
    else:
        print(list(tmp)[-1])
        return

    K = K - idx_s
    tmp = list(tmp)
    print(tmp[idx_s:][K % (len(tmp) - idx_s)])


if __name__ == "__main__":
    main()


Fixed submission:
from collections import deque
from sys import stdin


def main():
    N, K = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(x) for x in stdin.readline().rstrip().split()]
    pos = 1
    a = [False] * N
    a[0] = True
    tmp = deque([pos])
    for _ in range(K):
        pos = As[pos - 1]
        if a[pos - 1]:
            idx_s = tmp.index(pos)
            break
        a[pos - 1] = True
        tmp.append(pos)
    else:
        print(list(tmp)[-1])
        return

    K = K - idx_s
    tmp = list(tmp)
    print(tmp[idx_s:][K % (len(tmp) - idx_s)])


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin


def spam(x, AB, per):
    min_ = x
    max_ = x
    while True:
        min_ -= 1
        tmp = int(min_ * per)
        if AB != tmp:
            min_ += 1
            break
    while True:
        max_ += 1
        tmp = int(max_ * per)
        if AB != tmp:
            max_ -= 1
            break
    return min_, max_


def main():
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    x = spam(int(A / 0.08), A, 0.08)
    y = spam(int(B / 0.1), B, 0.1)
    if int(x[0] * 0.08) != A:
        a
    if int(x[1] * 0.08) != A:
        a
    if int(y[0] * 0.1) != B:
        a
    if int(y[1] * 0.1) != B:
        a

    if x[0] <= y[0] <= x[1]:
        print(y[0])
    elif y[0] <= x[0] <= y[1]:
        print(x[0])
    else:
        print(-1)


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    A, B = [int(x) for x in stdin.readline().rstrip().split()]
    result = 1
    while True:
        a = int(result * 0.08)
        b = int(result * 0.1)
        if a == A and b == B:
            print(result)
            break
        if A < a and B < b:
            print(-1)
            break
        result += 1


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    result = ['*'] * N
    for i in range(M):
        s, c = [int(x) for x in stdin.readline().rstrip().split()]
        if result[s - 1] == '*' or result[s - 1] == str(c):
            result[s - 1] = str(c)
        else:
            print(-1)
            return
    if result[0] == '0' and N != 1:
        print(-1)
        return
    if result[0] == '*':
        result[0] = '1'
    for i in range(N):
        if result[i] == '*':
            result[i] = '0'
    if N == 1:
        aaa
    print(''.join(result))


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    result = ['*'] * N
    for i in range(M):
        s, c = [int(x) for x in stdin.readline().rstrip().split()]
        if result[s - 1] == '*' or result[s - 1] == str(c):
            result[s - 1] = str(c)
        else:
            print(-1)
            return
    if result[0] == '0' and N != 1:
        print(-1)
        return
    if result[0] == '*' and N == 1:
        result[0] = '0'
    if result[0] == '*':
        result[0] = '1'
    for i in range(N):
        if result[i] == '*':
            result[i] = '0'
    print(''.join(result))


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    S = stdin.readline().rstrip()
    count = 0
    for i in range(1000):
        left = 0
        not_found = False
        for c in f'{i:03}':
            for j in range(left, N):
                if S[j] == c:
                    left = j + 1
                    break
            else:
                not_found = True
                break
            if not_found:
                break
        if not not_found:
            count += 1
    print(count)


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    S = stdin.readline().rstrip()
    count = 0
    for i in range(1000):
        left = 0
        not_found = False
        for c in '{:03}'.format(i):
            for j in range(left, N):
                if S[j] == c:
                    left = j + 1
                    break
            else:
                not_found = True
                break
            if not_found:
                break
        if not not_found:
            count += 1
    print(count)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin
import numpy as np


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = np.asarray([K] * N)
    for A in As:
        score -= 1
        score[A - 1] += 1
    for s in score:
        print('Yes' if 0 < s else 'No')


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    N, K, Q = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(stdin.readline().rstrip()) for _ in range(Q)]
    score = [0] * N
    for A in As:
        score[A - 1] += 1
    for s in score:
        x = K - (Q - s)
        print('Yes' if 0 < x else 'No')


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin
from bisect import insort


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(x) for x in stdin.readline().rstrip().split()]
    As.sort()
    for _ in range(M):
        x = As[-1] / 2
        insort(As, x)
        del As[-1]
    sum_ = 0
    for x in As:
        sum_ += int(x)
    print(sum_)


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin
import heapq


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = []
    for i in [int(x) for x in stdin.readline().rstrip().split()]:
        heapq.heappush(As, -i)
    for _ in range(M):
        x = heapq.heappop(As)
        heapq.heappush(As, x / 2)
    print(sum([-1 * int(x) for x in As]))


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin
from bisect import insort


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(x) for x in stdin.readline().rstrip().split()]
    As.sort()
    for _ in range(M):
        x = As[-1] / 2
        insort(As, x)
        del As[-1]
    print(sum([int(x) for x in As]))


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin
import heapq


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = []
    for i in [int(x) for x in stdin.readline().rstrip().split()]:
        heapq.heappush(As, -i)
    for _ in range(M):
        x = heapq.heappop(As)
        heapq.heappush(As, x / 2)
    print(sum([-1 * int(x) for x in As]))


if __name__ == "__main__":
    main()

Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = [int(x) for x in stdin.readline().rstrip().split()]
    As.sort()
    for _ in range(M):
        As[-1] /= 2
        As.sort()
    print(sum([int(x) for x in As]))


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin
import heapq


def main():
    N, M = [int(x) for x in stdin.readline().rstrip().split()]
    As = []
    for i in [int(x) for x in stdin.readline().rstrip().split()]:
        heapq.heappush(As, -i)
    for _ in range(M):
        x = heapq.heappop(As)
        heapq.heappush(As, x / 2)
    print(sum([-1 * int(x) for x in As]))


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Time Limit Exceeded):
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    As = [int(x) for x in stdin.readline().rstrip().split()]
    result = [0 for _ in range(N)]
    for i, a in enumerate(As[::-1]):
        num = N - i
        idx = num - 1
        if N // num < 2:
            result[idx] = a
        else:
            sum_ = sum([x for i, x in enumerate(result) if idx % (i + 1) == 0])
            if sum_ % 2 == 1:
                result[idx] = 1 if a == 0 else 0
            else:
                result[idx] = 0 if a == 0 else 1
    print(len([x for x in result if x == 1]))
    for i, x in enumerate(result):
        if x == 1:
            print(i + 1, end=' ')


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    As = [int(x) for x in stdin.readline().rstrip().split()]
    result = [0 for _ in range(N)]
    for i, a in enumerate(As[::-1]):
        num = N - i
        idx = num - 1
        if N // num < 2:
            result[idx] = a
        else:
            sum_ = 0
            cnt = 2
            while True:
                if N < (num * cnt):
                    break
                sum_ += result[(num * cnt) - 1]
                cnt += 1
            if sum_ % 2 == 1:
                result[idx] = 1 if a == 0 else 0
            else:
                result[idx] = 0 if a == 0 else 1
    print(len([x for x in result if x == 1]))
    for i, x in enumerate(result):
        if x == 1:
            print(i + 1, end=' ')


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
def main():
    with open('sample.txt') as f:
        ab, bc, ca = [int(x) for x in f.readline().rstrip().split()]
        print(ab * bc // 2)


if __name__ == "__main__":
    main()


Fixed submission:
from sys import stdin


def main():
    ab, bc, ca = [int(x) for x in stdin.readline().rstrip().split()]
    print(ab * bc // 2)


if __name__ == "__main__":
    main()
Buggy python submission (verdict: Runtime Error):
from sys import stdin
stdin = open('sample.txt')


def main():
    N = int(stdin.readline().rstrip())

    if N == 0:
        print('0')
        return

    ans = ''
    base = 2
    while N != 1:
        ans = str(abs(N % base)) + ans
        N = N // base
        N = -1 * N
    print('1' + ans)


if __name__ == '__main__':
    main()


Fixed submission:
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())

    if N == 0:
        print('0')
        return

    ans = ''
    base = 2
    while N != 1:
        ans = str(abs(N % base)) + ans
        N = N // base
        N = -1 * N
    print('1' + ans)


if __name__ == '__main__':
    main()