Harryxun/testdata huggingface dataset:
Buggy python submission (verdict: Runtime Error):
n = int(input())
X = [0]*100000000
for i in range(n):
  a,b = map(int,input().split())
  p = b
  for j in range(a):
    while X[p]!=0:
      p-=1
      if p<0:
        print("No")
        exit()
    X[p]=1
    p-=1
    if p<0:
        print("No")
        exit()
print("Yes")

Fixed submission:
n = int(input())
A=[]
for i in range(n):
  a,b = map(int,input().split())
  A.append((b,a))
A.sort()
c = 0
for a in A:
  c+=a[1]
  if c>a[0]:
    print("No")
    exit()
print("Yes")

Buggy python submission (verdict: Runtime Error):
using System;
using System.Collections.Generic;
using System.Diagnostics;
using System.Linq;

class Solver7
    {
        /*
         * https://atcoder.jp/contests/abc131/tasks/abc131_d
         * 
         * 
         */
                public void Solve7()
        {
            var nnum = 99999999;
            var n = int.Parse(Console.ReadLine());
            int[] X = new int[nnum];
            
            try
            {
                for (int i = 0; i < n; i++)
                {
                    var ab = u.readIntArrayBySplit();
                    var a = ab[0];
                    var b = ab[1];
                    var p = b;
                    for (int j = 0; j < a; j++)
                    {
                      	var xx = X[p];
                      	
                        while (X[p]!=null && X[p] == 1)
                        {
                            p--;
                        }
                        X[p] = 1;
                    }
                }
                Console.WriteLine("Yes");
            }
            catch(Exception ex)
            {
                Console.WriteLine("No");
            }


        }
        static void Main()
        {
            var solver = new Solver7();
            solver.Solve7();
        }
    }
    static class u
    {
        public static void outA(int[] A) { Console.WriteLine(string.Join(" ", A)); }
        public static void outInt(int i) { Console.WriteLine(i.ToString()); }
        public static void outLong(long i) { Console.WriteLine(i.ToString()); }
        static public string AsJoinedString<T>(this IEnumerable<T> ie, string st = " ") { return string.Join(st, ie); }
        public static int readInt() { return int.Parse(Console.ReadLine()); }
        public static  string readStr() { return Console.ReadLine(); }
        public static int[] readIntArrayBySplit() { return Console.ReadLine().Split(' ').Select(s => int.Parse(s)).ToArray(); }
        public static int[] readIntArrayZeroIchiRenzoku() { return Console.ReadLine().Select(s => int.Parse(s.ToString())).ToArray(); }

    }

Fixed submission:
n = int(input())
A=[]
for i in range(n):
  a,b = map(int,input().split())
  A.append((b,a))
A.sort()
c = 0
for a in A:
  c+=a[1]
  if c>a[0]:
    print("No")
    exit()
print("Yes")
Buggy python submission (verdict: Runtime Error):
a,b = map(int,input().split())
if a >12:print(b)
else if a <6:print(b//2)
else: print(0)

Fixed submission:
a,b = map(int,input().split())
if a >12:print(b)
elif a >5:print(b//2)
else: print(0)
Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
A = list(map(int,input().split()))
for i in range(m):
  b,c = map(int,input().split())
  A.extend([c for j in range(b)])
A.sort(reverse=True)
print(sum(A[:n]))

Fixed submission:
n,m = map(int,input().split())
A = list(map(int,input().split()))
CntA = [1 for i in range(n)]
for i in range(m):
  b,c = map(int,input().split())
  A.append(c)
  CntA.append(b)
Z = list(zip(A,CntA))
Z.sort(reverse=True)
ans = 0
for z in Z:
  if n>z[1]:
    ans+=z[1]*z[0]
    n-=z[1]
  else:
    ans+=n*z[0]
    break
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
B=[]
C=[]
for i in range(m):
  b,c = map(int,input().split())
  B.append(b)
  C.append(c)
L = list(zip(C,B))
L.sort(reverse = True)
L2 = []
for i in range(m):
  L2.extend([L[i][0]]*L[i][1])
#print(L2)
ans = 0
for i in range(n):
  if i >= len(L2): ans+=A[i]
  else:
    if L2[i] > A[i]:ans+=L2[i]
    else: ans+=A[i]
print(ans)

Fixed submission:
n,m = map(int,input().split())
A = list(map(int,input().split()))
CntA = [1 for i in range(n)]
for i in range(m):
  b,c = map(int,input().split())
  A.append(c)
  CntA.append(b)
Z = list(zip(A,CntA))
Z.sort(reverse=True)
ans = 0
for z in Z:
  if n>z[1]:
    ans+=z[1]*z[0]
    n-=z[1]
  else:
    ans+=n*z[0]
    break
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
n,m = map(int,input().split())
A = list(map(int,input().split()))
A.sort()
for i in range(m):
  b,c = map(int,input().split())
  for j in range(b):
    if c>A[j]:
      A[j] = c
  A.sort()
print(sum(A))

Fixed submission:
n,m = map(int,input().split())
A = list(map(int,input().split()))
CntA = [1 for i in range(n)]
for i in range(m):
  b,c = map(int,input().split())
  A.append(c)
  CntA.append(b)
Z = list(zip(A,CntA))
Z.sort(reverse=True)
ans = 0
for z in Z:
  if n>z[1]:
    ans+=z[1]*z[0]
    n-=z[1]
  else:
    ans+=n*z[0]
    break
print(ans)
Buggy python submission (verdict: Runtime Error):
n,k = map(int,input().split())
s = input()
s[k-1] = s[k-1].lower()
print(s)

Fixed submission:
n,k = map(int,input().split())
s = input()
ret=""
for i in range(n):
  if i != k-1:
    ret +=s[i]
  else:
    ret+=s[i].lower()

print(ret)
Buggy python submission (verdict: Runtime Error):
using System;
using System;
using System.Collections.Generic;
using System.Linq;


    class Solver5
    {
        /*
         * 
         * https://atcoder.jp/contests/abc115/tasks/abc115_d
         * 
         */
 public void Solve5()
        {
            var nx = u.readLongArrayBySplit();
			var n = nx[0];
            var x = nx[1];
            long ans = 0;

            while (true)
            {
                var thk = new long[5]{ 1, (long)Math.Pow(2,n + 1) - 3, 1, (long)Math.Pow(2, n + 1) - 3, 1 };
                var pc = new long[5] { 0, (long)Math.Pow(2, n ) - 1 , 1, (long)Math.Pow(2, n )- 1, 0 };
                for (int i = 0; i < 5; i++)
                {
                    if (x > thk[i])
                    {
                        x -= thk[i];
                        ans += pc[i];
                    }
                    else if (x < thk[i])
                    {
                        n--;
                        break;
                    }
                    else
                    {
                        ans += pc[i];
                        Console.WriteLine(ans.ToString());
                        return;
                    }
                }

            }

        }
        static void Main()
        {
            var solver = new Solver5();
            solver.Solve5();
        }
    }
    static class u
    {
      public static long[] readLongArrayBySplit() { return Console.ReadLine().Split(' ').Select(s => long.Parse(s)).ToArray(); }
    }

Fixed submission:
n,x = map(int,input().split())
 
#レベルnバーガーの構造は、1,2^(n+1)-3,1,2^(n+1)-3,1
 
ans = 0
x2 = x
k=n
while True:
  thk = [1,2**(k+1)-3,1,2**(k+1)-3,1]
  pc = [0,2**k-1,1,2**k-1,0]
  for i in range(5):
    x2-=thk[i]
    if x2<0:
      x2+=thk[i]
      k-=1
      break
    elif x2==0:
      ans+=pc[i]
      print(ans)
      exit()
    else:
      ans+=pc[i]
Buggy python submission (verdict: Runtime Error):
def f(x):
  if x<10:
    return x
  else:
    a = x%10
    x%=10
    return a+f(x)
n = int(input())
a = f(n)
if n%a==0:
  print("Yes")
else:
  print("No")

Fixed submission:
def f(x):
  if x<10:
    return x
  else:
    a = x%10
    x//=10
    return a+f(x)
n = int(input())
a = f(n)
if n%a==0:
  print("Yes")
else:
  print("No")
Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i++
  if math.float(i)==a and math.float(i)==b:
    print(i)
    break
else:
  print(-1)

Fixed submission:
S = input()
if S[0] == S[1] == S[2]:
  print('No')
else:
  print('Yes')

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
for i in range(10000):
  if i//100*8==a and i//100*10==b:
    print(i)
  else:
    print(-1)

Fixed submission:
S = input()
if S[0] == S[1] == S[2]:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
a,b,c=input().split()

if a==b+c:
  print(b)
elif b==0:
  print(0)
else:
  print(a-c+b)

Fixed submission:
S,a,b=(int(x) for x in input().split())
ans = S//(a+b) * a
rem = S % (a+b )
ans +=min(rem,a)
print(ans)
Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i++
  if math.float(i)==a and math.float(i)==b:
    print(i)
    break
else:
  print(-1)

Fixed submission:
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i+=1
  if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
    print(i)
    break
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i++
  if math.float(i)==a and math.float(i)==b:
    print(i)
else:
  print(-1)

Fixed submission:
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i+=1
  if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
    print(i)
    break
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())

import math 

i=0
while i<10001:
  i++
  if math.float(i)==a and math.float(i)==b:
    print(i)
else:
  print(-1)
  

Fixed submission:
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i+=1
  if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
    print(i)
    break
else:
  print(-1)

Buggy python submission (verdict: Runtime Error):
a,b=(int(x) for x in input().split())

for _ in range(10000):
  if i//100*8==a and i//100*10==b:
    print(i)
  else:
    print(-1)

Fixed submission:
a,b=(int(x) for x in input().split())
 
import math 
 
i=0
while i<10001:
  i+=1
  if math.floor(i*0.08)==a and math.floor(i*0.1)==b:
    print(i)
    break
else:
  print(-1)
Buggy python submission (verdict: Runtime Error):
s=input()
ans=''
for _ in len(s):
  ans+='x'

Fixed submission:
a=input()
print("".join(["x" for x in a]))
Buggy python submission (verdict: Runtime Error):
len=input()
#len-1
Narray=sorted(input().split())
n=0
while True
	if not Narray[n] == Narray[n+1]:
    	pass
    elif:
      print("NO")
print("yes")
    	
  

Fixed submission:
length=input()
#len-1
Narray=sorted(input().split())
n=0
while n<int(length)-1:
	if Narray[n] == Narray[n+1]:
		print("NO")
		break
	elif n==int(length)-2:
		print("YES")
		break
	else:
		n+=1
Buggy python submission (verdict: Runtime Error):
d_cnt =(int(x) for x in input().split()) 

if d_cnt//4==0 or d_cnt//7==0 or d_cnt//11:
  print('Yes')
else:
  print('No')

  

Fixed submission:
N = int(input())
f = False
for i in range(N//4+1):
    for j in range(N//7+1):
        if i*4 + j*7 == N:
            f = True
            break
if f:
    print("Yes")
else:
    print("No")
Buggy python submission (verdict: Time Limit Exceeded):
N=int(input())
ans=list()

for i in range(1,N+1):
  count = 0
  while i%2==0:
    count+=1
  ans.append(count)

answer=ans.index(max(ans))
print(answer+1)
  

Fixed submission:
N=int(input())
ans=list()

for i in range(1,N+1):
  count = 0
  while i%2==0:
    i=i//2
    count+=1
  ans.append(count)

answer=ans.index(max(ans))
print(answer+1)

Buggy python submission (verdict: Time Limit Exceeded):
number = int(input())
answer = 0
for i in range(number):
  print(i)
  target=0
  while i%2==0:
    target+=1
    answer=max(target,answer)
print(answer) 

Fixed submission:
N=int(input())
ans=list()

for i in range(1,N+1):
  count = 0
  while i%2==0:
    i=i//2
    count+=1
  ans.append(count)

answer=ans.index(max(ans))
print(answer+1)
Buggy python submission (verdict: Time Limit Exceeded):
k,s=(int(x) for x in input().split())
ans=0
for i in range(k+1):
  for ii in range(k+1):
    for iii in range(k+1):
      if i+ii+iii==s:
        ans+=1
print(ans)

Fixed submission:
k,s=(int(x) for x in input().split())
ans=0
for i in range(k+1):
  for ii in range(k+1):
    if 0<=s-i-ii<=k:
        ans+=1
print(ans)
Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Fixed submission:
pred = input()
real = input()
length = len(pred)
count = 0
for i in range(length):
  if pred[i] == real[i]:
    count += 1
    
print(count)
Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(lambda x:int(x), input().split()))

idx = sorted(range(N-1), key=lambda k: H[k], reverse=True)

ans = 0
for i in idx:
  count = 0
  if (i != 0) and (H[i-1] > H[i]): continue
#  if i == N-1: continue

  j = i
  while j < N-1:
    if H[j] < H[j+1]: break
    count += 1
    j += 1
  ans = max(ans, count)

print(ans)


Fixed submission:
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(lambda x:int(x), input().split()))

idx = sorted(range(N-1), key=lambda k: H[k], reverse=True)

ans = 0
for i in idx:
  count = 0
  if (i != 0) and (H[i-1] > H[i]): continue
#  if i == N-1: continue

  for j in range(i, N-1):
    if H[j] < H[j+1]: break
    count += 1
  ans = max(ans, count)

print(ans)


Fixed submission:
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(lambda x:int(x), input().split()))

idx = sorted(range(N), key=lambda k: H[k], reverse=True)

ans = 0
for i in idx:
  count = 0
  if (i != 0) and (H[i-1] > H[i]): continue
    
  if i != N-1:
    for j in range(i, N-1):
      if H[j] >= H[j+1]:
        count += 1
      else:
        break
    ans = max(ans, count)

print(ans)


Fixed submission:
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Buggy python submission (verdict: Runtime Error):
N = int(input())
H = list(map(lambda x:int(x), input().split()))

ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Fixed submission:
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
N = int(input())
H = list(map(lambda x:int(x), input().split()))

idx = sorted(range(N), key=lambda k: H[k], reverse=True)

ans = 0
for i in idx:
  count = 0
  if i != N-1:
    for j in range(i, N-1):
      if H[j] >= H[j+1]:
        count += 1
      else:
        break
    ans = max(ans, count)

print(ans)

Fixed submission:
N = int(input())
H = list(map(lambda x:int(x), input().split()))
count = 0
ans = 0
for i in range(N-1):
  if H[i] >= H[i+1]:
    count += 1
  else:
    count = 0
  ans = max(ans, count)

print(ans)
Buggy python submission (verdict: Time Limit Exceeded):
# -*- Coding: utf-8 -*-

originalS = raw_input()

i = 0
while originalS.find('ABC')!=-1:
  originalS = originalS.replace('ABC', 'BCA', 1)
  i += 1

print i

Fixed submission:
# -*- Coding: utf-8 -*-
#import numpy as np

def count(s):
	i = 0
	a_cnt = 0
	cnt = 0
	while i < len(s):
		if s[i] == 'A':
			a_cnt += 1
		if s[i] =='D':
			cnt += a_cnt

		i += 1

	return cnt



originalS = raw_input()
originalS = originalS.replace('BC', 'D')
originalS = 'B'+originalS+'B'	


idx = []
i = 0

while i < len(originalS):
	if (originalS[i] == 'B')|(originalS[i] == 'C'):
		idx.append(i)
	i += 1


Substr = []

i = 0
while i < len(idx)-1:
	if idx[i+1]-idx[i]!=1:
		Substr.append(originalS[idx[i]+1:idx[i+1]])

	i += 1

ans = 0
for c in Substr:
	ans += count(c)

print ans
Buggy python submission (verdict: Time Limit Exceeded):
# -*- Coding: utf-8 -*-

N,M = map(int,raw_input().split())

list_in = []

for i in xrange(M):
	list_in.append(map(int,raw_input().split()))

count = 0
for i in xrange(N):
	flag = 0
	for j in xrange(M):
		if ((i+1)<list_in[j][0]) | ((i+1)>list_in[j][1]):
			flag = 1
			break

	if flag==1:
		flag = 0
	else:
		count += 1

print count

Fixed submission:
# -*- Coding: utf-8 -*-

N,M = map(int,raw_input().split())

L = 0
R = N

for i in xrange(M):
	li,ri = map(int,raw_input().split())
	L = max(L,li)
	R = min(R,ri)

print max(0,R-L+1)
Buggy python submission (verdict: Runtime Error):
S=input()
if S[1]==S[2] and S[2]==S[3]:
  print('No')
else:
  print('Yes')

Fixed submission:
S=input()
if S[0]==S[1] and S[1]==S[2]:
  print('No')
else:
  print('Yes')
Buggy python submission (verdict: Runtime Error):
a = int(input())

if a%2 ==0 :
  print("0.5000000000") 
else  :
  temp = n//2 +1 
  temp = temp/n 
  print(temp)

Fixed submission:
a = int(input())

if a%2 == 0 :
  print("0.5000000000") 
else  :
  temp = a//2 +1 
  temp = temp/a 
  print(temp)
Buggy python submission (verdict: Runtime Error):
S = input()
if S == "AAA" or B == "BBB":
  print("No")
else:
  print("Yes")
  

Fixed submission:
S = raw_input()
if S[0] == S[1] and S[1] == S[2]:
  print("No")
else:
  print("Yes")
Buggy python submission (verdict: Runtime Error):
n, a b = map(int, input().split())
ans = n// (a + b)
rem = n % (a + b)
ans += min(rem, A)
prnit(ans)

Fixed submission:
n , a, b = map(int, input().split())
ans = n//(a + b) * a
rem = n % (a + b)
ans += min(rem, a)
print(ans)

Buggy python submission (verdict: Time Limit Exceeded):
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = 0
for i in range(0, N):
  if i % (A+B) < A:
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy python submission (verdict: Time Limit Exceeded):
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy python submission (verdict: Runtime Error):
S = input()
N = int(S[0])
A = int(S[2])
B = int(S[4])
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy python submission (verdict: Runtime Error):
S = input()
N = int(S[0])
A = int(S[1])
B = int(S[2])
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy python submission (verdict: Runtime Error):
N = int(input())
A = int(input())
B = int(input())
#print(A+B)
 
b_count = 0
for i in range(0, N):
  #print('i')
  #print(i)
  if i % (A+B) < A:
    #print(b_count)
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)

Buggy python submission (verdict: Runtime Error):
N, A, B = input()

b_count = 0
for i in len(N):
  if i % (A+B) < A:
    b_count = b_count + 1
print(b_count)

Fixed submission:
S = input()
N = int(S.split(' ')[0])
A = int(S.split(' ')[1])
B = int(S.split(' ')[2])
 
b_count = (N // (A+B)) * A
rem = N % (A+B)
b_count = b_count + min(rem, A)
print(b_count)
Buggy python submission (verdict: Runtime Error):
N =input()

if N.isdigit() and N >= 1 and  N <= 100:
  if N % 2 == 0:
    ans = N / 2
  else:
    ans = (N - 1) / 2 + 1
  print(ans)
else:
  print('error')


Fixed submission:
N = input()
if N.isdigit() and int(N) >= 1 and  int(N) <= 100:
  if int(N) % 2 == 0:
    ans = int(N) / 2
  else:
    ans = (int(N) - 1) / 2 + 1
  print(int(ans))
else:
  print('error')

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print(N / 2)
else:
    print(N // 2 + 1)

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print 'N'
else:
    print 'N + 1'

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print([N])
else:
    print([N + 1])

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print(N)
else:
    print(N + 1)

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Buggy python submission (verdict: Runtime Error):
N = int(input())

if N % 2 = 0:
    print(int(N))
else:
    print(int(N + 1))

Fixed submission:
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)