Problem:
 Score : 100 points    Problem Statement Takahashi wants to print a document with N pages double-sided, where two pages of data can be printed on one sheet of paper.  At least how many sheets of paper does he need?      Constraints  N is an integer.  1 \leq N \leq 100         Input Input is given from Standard Input in the following format:  N       Output Print the answer.        Sample Input 1 5      Sample Output 1 3  By printing the 1 -st, 2 -nd pages on the 1 -st sheet, 3 -rd and 4 -th pages on the 2 -nd sheet, and 5 -th page on the 3 -rd sheet, we can print all the data on 3 sheets of paper.       Sample Input 2 2      Sample Output 2 1       Sample Input 3 100      Sample Output 3 50

Solution (Python):
import math

N = int(input())
print(math.ceil(N / 2))

Solution (Python):
a = int(input())
if a % 2 == 0:
    print(a//2)
else:
    print(a//2 + 1)

Solution (Python):
from math import ceil
n = int(input())
print(ceil(n/2))

Solution (Python):
n = int(input())
print(str((n+1) // 2))

Solution (Python):
print((int(input()) + 1) // 2)

Solution (Python):
n = int(input())
print((n+1)//2)

Solution (Python):

N = int(input())

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

Solution (Python):
import math

page = int(input())
output = math.ceil(page / 2)
print(output)

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
s = int(input())
if s%2 == 0:
    print(int(s/2))
else:
    print(int(s/2+1))

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    N = int(input())
    if N % 2 == 1:
        print(N//2+1)
    else:
        print(int(N/2))

if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())
print((N+1)//2)

Solution (Python):
import math
N = int(input())
print(math.ceil(N/2))

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())

if n % 2 == 1:
    ans = n//2 + 1
else:
    ans = n//2
print(ans)

Solution (Python):

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

Solution (Python):
import math
N = int(input())
print(math.ceil(N/2))

Solution (Python):
from decimal import *
N = int(input())

print(Decimal(str(N/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP))

Solution (Python):
import math

N = int(input())

a = math.ceil(N / 2)

print(a)

Solution (Python):
N = int(input()) 

import math

print(math.ceil(N/2))

Solution (Python):
n = int(input())
print((n + 1) // 2)

Solution (Python):
import math
n=int(input())
print(math.ceil(n/2))

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(int(N/2))
else:
    print(N//2 + 1)

Solution (Python):
print(-((-int(input()))//2))

Solution (Python):
n = int(input())

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

Solution (Python):
n=int(input())
if n%2==0:
  print(n//2)
else:
  print(n//2+1)

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())
if n % 2==0:
    print(n//2)
else:
    print((n//2)+1)

Solution (Python):
import math
N = int(input())


print(math.ceil(N / 2))

Solution (Python):
N = int(input())
if N % 2 == 0:
    ans = int(N / 2)
else:
    ans = int(N / 2)+1
print(ans)

Solution (Python):

import sys
input = sys.stdin.readline





def main():
    n = int(input())
    if n%2 == 0:print(int(n/2)) 
    else: print(int(n/2)+1)


    
if __name__ == '__main__':
    main()

Solution (Python):
n=int(input())
print(-(-n//2))

Solution (Python):
import math

X = int(input())
Y = X/2
print(math.ceil(Y))

Solution (Python):
n = int(input())

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

Solution (Python):
N=int(input())
a,b=divmod(N,2)
print(a+b)

Solution (Python):
import math
n = int(input())

print(math.ceil(n/2))

Solution (Python):
import math
N = int(input())

print(math.ceil(N/2))

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())

print((n+1)//2)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(int(N/2))
else:
    print(int(N//2)+1)

Solution (Python):
def main():
    n = int(input())

    ans = n//2 + n%2
    print(ans)

if __name__ == "__main__":
    main()

Solution (Python):
from math import ceil

n = int(input())


print(ceil(n/2))

Solution (Python):
N=int(input())
if N%2==1:
  print(N//2+1)
else:
  print(N//2)

Solution (Python):




def main():
    N = int(input())
    print(N // 2 if N % 2 == 0 else N // 2 + 1)


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())
if n == 1:
    print(1)
elif n % 2 == 0:
    print(n // 2)
else:
    print(n // 2 + 1)

Solution (Python):
N = int(input())
print(-(-N//2))

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(int(N / 2))
else:
    print(int(N/2) + 1)

Solution (Python):

a = int(input())

print(int(a/2+0.5))

Solution (Python):
n = int(input())
print(sum(divmod(n, 2)))

Solution (Python):
n = input()
n = int(n)
if n % 2 == 0:
    print(int(n/2))
else:
    print(int((n/2)+1))

Solution (Python):
import math
N=int(input())


B=math.ceil(N/2)
print(B)

Solution (Python):
import math
import string


def readints():
    return list(map(int, input().split()))


def nCr(n, r):
    return math.factorial(n)//math.factorial(n-r)*math.factorial(r)


n = int(input())
if n % 2 == 0:
    print((n//2))
else:
    print((n//2)+1)

Solution (Python):
from math import ceil

N = int(input())

print(ceil(N/2))

Solution (Python):
n = int(input())
print(-(-n//2))

Solution (Python):
import math as m
n = int(input())

print(m.ceil(n/2))

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())

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

Solution (Python):
N = int(input())
if N%2 == 0:
    a = int(N/2)
else:
    a = int(N//2+1)

print(a)

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())
ans = 0
if n%2 == 0:
   ans = n/2
else:
   ans = (n+1)/2

print(int(ans))

Solution (Python):
N=int(input())

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

Solution (Python):
import math

print(math.ceil(int(input()) / 2))

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())
if n % 2 == 1:
    print(int((n+1)/2))
else:
    print(int(n/2))

Solution (Python):
N = int(input())

ans = N // 2
if N % 2 != 0:
    ans += 1

print(ans)

Solution (Python):
a = int(input())

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

Solution (Python):
import math
N=int(input())
ans=math.ceil(N/2)
print(ans)

Solution (Python):
n = input()

N=int(n)

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

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(int(n/2))
else:
    print(int((n/2) + 1))

Solution (Python):
a  = int(input())
b = a//2
c = a%2
print(b+c)

Solution (Python):
N=int(input())
if N%2 == 0:
  print(N//2)
else:
  print(N//2+1)

Solution (Python):
N=int(input())

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2.0))

Solution (Python):
from math import ceil


N = int(input())


print(ceil(N/2))

Solution (Python):
n=int(input())
print(-(-n//2))

Solution (Python):




def solve(inp):
    N = int(inp.readline().strip())

    a = int((N - 1) / 2) + 1
    return str(a)


def main():
    import sys
    result = solve(sys.stdin)
    if result is not None and result != '':
        print(result)


if __name__ == '__main__':
    main()

Solution (Python):
import math


n= int(input())

print(math.ceil(n/2))

Solution (Python):
import math
print(math.ceil(int(input())/2))

Solution (Python):
N = int(input())
if N%2 == 0:
    print(N//2)
else:
    print((N + 1)//2)

Solution (Python):
import numpy as np
print(int(np.ceil(int(input())/2)))

Solution (Python):
x = int(input())
if x%2 == 0:
    print(int(x/2))
else:
    print(int((x+1)/2))

Solution (Python):
n = int(input())
if n % 2 == 0:
    print(n // 2)
else:
    print(n // 2 + 1)

Solution (Python):
import math

N = int(input())
print(math.ceil(N / 2))

Solution (Python):
from math import ceil
print(ceil(int(input())/2))

Solution (Python):
N= int(input())

count = 0

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

Solution (Python):
import math

n = int(input())
print(math.ceil(n/2))

Solution (Python):
pages = int(input())
print_page = pages // 2 + pages % 2
print(print_page)

Solution (Python):
import math
X = int(input())
print(math.ceil(X/2))

Solution (Python):
def resolve():
    n = int(input())
    if (n % 2 == 1):
        print((n // 2) + 1)
    else:
        print(n // 2)

if __name__ == '__main__':
    resolve()

Solution (Python):
import math
N = int(input())

print(math.ceil(N/2))

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

Solution (Python):
n = int(input())

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

Solution (Python):
n=int(input())
print((n+1)//2)

Solution (Python):
n = int(input())

ans = n // 2
if n % 2 != 0: ans += 1
print(ans)

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)

Solution (Python):
N=int(input())
if N%2==0:
  ans=N/2
else:
  ans=N//2+1
print(int(ans))

Solution (Python):
N = int(input())
if N % 2 == 1:
  ret = N // 2 + 1
else:
  ret = N // 2
print(ret)

Solution (Python):
import math

N = int(input())
print(math.ceil(N/2))

Solution (Python):
print((int(input()) + 1) // 2)

Solution (Python):
n = int(input())

q, mod = divmod(n, 2)

if (mod == 0):
  print(q)
else:
  print(q+1)

Solution (Python):
n=int(input())
if n%2==0:
    print(int(n/2))
else:
    print(int(n//2+1))

Solution (Python):
import numpy as np
N= int(input())
if int(N)%2==1:
    print(N//2+1)
else:
    print(N//2)

Solution (Python):
n=int(input())
print((n+1)//2)

Solution (Python):
pages = int(input())

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

Solution (Python):
n = int(input())

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

Solution (Python):
print(-(-int(input()) // 2))

Solution (Python):
import math
N = int(input())
print(math.ceil(N / 2))

Solution (Python):
print(-(-int(input())//2))

Solution (Python):
N = int(input())
if N%2 == 0:
    print(int(N/2))
else:
    print(int(N//2) + 1)

Solution (Python):
import math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
import math
n = int(input())
m = math.ceil(n/2)
print(m)

Solution (Python):
n=int(input())
if n%2==0:
    print(int(n/2))
else:
    n+=1
    print(int(n/2))

Solution (Python):

a = int(input())

from math import ceil
print(ceil(a/2))

Solution (Python):
n = int(input())

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

Solution (Python):
import math

n = int(input())

print(math.ceil(n / 2))

Solution (Python):
n=int(input())
if n%2==0:
    a=n//2
else:
    a=n//2+1
print(a)

Solution (Python):
import math

if __name__ == '__main__':
    n = int(input())
    result = math.ceil(n / 2)
    print(result)

Solution (Python):

N = int(input())


print(N//2+N%2)

Solution (Python):
a=int(input())
if a%2==0:
  print(a//2)
else:
  print(a//2+1)

Solution (Python):
import math
n = int(input())

print(math.ceil(n / 2))

Solution (Python):

import sys
input = sys.stdin.readline

n = int(input())
print((n + 1) // 2)

Solution (Python):
n = int(input())

if n % 2 == 0:
    print(int(n/2))
    
elif n % 2 == 1:
    print(int(n/2 +1))

Solution (Python):
N = int(input())
if(N%2==0):
    print(int(N/2.0))
else:
    print(int(N/2.0+1))

Solution (Python):
N =int(input())

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

Solution (Python):
x = int(input())
div, mod = divmod(x, 2)
if mod:
  div += 1
print(div)

Solution (Python):
import math
print(math.ceil(int(input()) / 2))

Solution (Python):
n=int(input())
print((n-1)//2+1)

Solution (Python):
N = int(input())

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

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N//2)
  
else:
  print(N//2+1)

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

Solution (Python):
N = int(input())


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

Solution (Python):
import math
a = int(input())
b = a/2
print(math.ceil(b))

Solution (Python):
n = int(input())
if n%2==0:
    print(int(n/2))
else:
    print (int(n/2+1))

Solution (Python):
def main():
    n = int(input())
    result = 0
    while True:
        if n > 0:
            n = n - 2
            result += 1
        else:
            break
    print(result)


if __name__ == "__main__":
    main()

Solution (Python):
def main():
    N = int(input())
    cal = N>>1
    if(N%2 == 0):
        print(cal)
    else:
        print(cal+1)

if __name__ == "__main__":
    main()

Solution (Python):
N=int(input())

print(-(-N//2))

Solution (Python):
n = int(input())
print(int((n+1)/2))

Solution (Python):
N = int(input())
p = N // 2
q = N % 2
print(p+q)

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
n = int(input())

q, mod = divmod(n, 2)
ans = q
if mod != 0:
    ans += 1
print(ans)

Solution (Python):
import math

N = int(input())

print(math.ceil(N / 2))

Solution (Python):

import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

N = int(readline().strip())

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

print(answer)

Solution (Python):
N = int(input())

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

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

Solution (Python):
n = int(input())

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

Solution (Python):
N = int(input())

N = int((N - N%2)/2 + N%2)
print(N)

Solution (Python):
n = int(input())

paper = n // 2
if n%2!=0:
    paper += 1

print(paper)

Solution (Python):
N=int(input())


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

Solution (Python):
import math

n = int(input())

p = math.ceil(n / 2)

print(p)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(int(n/2))
else:
    print(int(n/2)+1)

Solution (Python):
n = int(input())

a = n % 2
b = n // 2
print(a+b)

Solution (Python):
N = int(input())
print(-(-N // 2))

Solution (Python):



from math import *
from copy import *
from string import *				
from random import *				
from sys import stdin
from sys import maxsize
from operator import *				
from itertools import *
from collections import Counter		
from collections import defaultdict 

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
print(ceil(N/2))

Solution (Python):
def main():
    n = int(input().strip())
    print((n + 1) // 2)


main()

Solution (Python):
def solve():
    N = int(input())
    if N % 2 == 0:
        return N //2
    else:
        return N // 2 +1

    return 0

print(solve())

Solution (Python):
import math
N=int(input())
print(math.ceil(N/2))

Solution (Python):
n = int(input())
print((n+1)//2)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(int(n/2))
else:
    print(int(n//2+1))

Solution (Python):
import sys
import math
import fractions
import itertools
from collections import deque
import copy
import bisect

MOD = 10 ** 9 + 7
INF = 10 ** 18 + 7
input = lambda: sys.stdin.readline().strip()

N = int(input())
print(int((N+1)//2))

Solution (Python):
N = int(input())

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

Solution (Python):
import math
def main():
    N = int(input())
    N = N / 2
    print(math.ceil(N))

    return 0
if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n//2)
else:
    print(n//2 + 1)

Solution (Python):

import sys
import math


def solve(N: int):
    return print(math.ceil(N/2))



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
print(int((n + 1) / 2))

Solution (Python):
N = int(input())

ans , mod = divmod(N,2)
if mod == 0:
    print(ans)
elif mod == 1:
    print(ans+1)

Solution (Python):
N = int(input())
print(((N+2)-1)//2)

Solution (Python):
N = int(input())

def main(N):
    if N % 2 == 0:
        return N // 2
    else:
        return N // 2 + 1

if __name__ == "__main__":

    answer = main(N)
    print(answer)

Solution (Python):
import math
print(math.ceil((int(input())/2)))

Solution (Python):
import math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
import math
N = int(input())
print(math.ceil(N/2))

Solution (Python):
n = int(input())

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

Solution (Python):
s = list(map(int, input().split()))
if s[0]%2==1:
    print(int(s[0]/2)+1)
else:
    print(int(s[0]/2))

Solution (Python):
import math
print(math.ceil(int(input()) / 2))

Solution (Python):
N = int(input())

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

Solution (Python):
import math

if __name__ == '__main__':
    n = int(input())

    print(math.ceil(n/2))

Solution (Python):
import math
N = int(input())
print(math.ceil(N/2))

Solution (Python):
n=int(input())
print((n//2)) if n%2==0 else print(n//2+1)

Solution (Python):
print(abs((-int(input())//2)))

Solution (Python):
import math

N = int(input())
print(math.ceil(N/2))

Solution (Python):
N = int(input())
print(N//2) if N % 2 ==0 else print(N//2+1)

Solution (Python):
n = int(input())
print(n //2+ n%2)

Solution (Python):
n = int(input())
if n ==0:
    print(0)
elif n%2 ==0:
    print(int(n/2))
else:
    print(int(n/2)+1)

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2)
else:
    print((n//2)+1)

Solution (Python):
N = int(input())
if N % 2 == 1:
    print(N // 2 + 1)
else:
    print(N // 2)

Solution (Python):
N = int(input())
if N % 2 ==0:
  print(N//2)
else:
  print((N//2) + 1)

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())
print(-(-n//2))

Solution (Python):
import math 
n = int(input())





print(math.ceil(n / 2))

Solution (Python):
N = int(input())
print((N+1)//2)

Solution (Python):
import math

n=int(input())
r=math.ceil(n/2)

print(r)

Solution (Python):
N = int(input())
print(int(N/2+0.5))

Solution (Python):
n = int(input())

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

Solution (Python):
n=int(input())
p=int((n+1)/2)
print(p)

Solution (Python):
import math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
N = int(input())
if N % 2 == 0:
    print(N//2)
else:
    print(N//2+1)

Solution (Python):
import math

def main():
    n = int(input())
    ans = math.ceil(n / 2)
    print(int(ans))


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N%2:
    print(N//2+ 1)
else:
     print(N//2)

Solution (Python):
N = int(input().rstrip())
if N % 2 == 0:
    print(int(N/2))
else:
    print(int(N//2 + 1))

Solution (Python):
import math
print(math.ceil(int(input())/2))

Solution (Python):

import math
def main():
    N = int(input())
    print(math.ceil(N/2))


if __name__ == '__main__':
    main()

Solution (Python):
ii = lambda : int(input())
mi = lambda : map(int,input().split())
li = lambda : list(map(int,input().split()))

n = ii()

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

Solution (Python):
N = int(input())

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

Solution (Python):
from math import ceil
def main():
    n = int(input())
    r = ceil(n / 2)
    print(r)

main()

Solution (Python):
N = int(input())
print(int((N+1)//2) )

Solution (Python):
N = int(input())
print((N + 1)//2)

Solution (Python):
n = int(input())

if n %2==1:
    print(int(n//2)+1)
else:
    print(int(n//2))

Solution (Python):
import math

N = int(input())
ans = math.ceil(N / 2)
print(ans)

Solution (Python):
import math
print(int(math.ceil(int(input())/2)))

Solution (Python):
N = int(input())
print(-(-N // 2))

Solution (Python):

N = int(input().strip())

print((N + 1) // 2)

Solution (Python):
import math
import sys

input = sys.stdin.readline


def main():
    n = int(input())
    print(math.ceil(n / 2))


if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N//2)
else:
  print(N//2+1)

Solution (Python):
n = int(input())

a = n%2

if a==1:
    print(n//2+1)
else:
    print(n//2)

Solution (Python):


n = int(input())

if n%2:
    print(int((n+1)/2))
else:
    print(int(n/2))

Solution (Python):
a=int(input())
if a%2:
    print(a//2+1)
else:
    print(a//2)

Solution (Python):
n=int(input())
print(n//2+n%2)

Solution (Python):
N = int(input())
print((N + 1) // 2)

Solution (Python):
N = int(input())

kotae = int((N-1)/2) + 1

print(kotae)

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())

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

Solution (Python):
a = int(input())

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

Solution (Python):
N=int(input())

ans=(N+1)//2

print(ans)

Solution (Python):
n=int(input())
if n%2==1:
	print(n//2+1)
else:
	print(n//2)

Solution (Python):
s = int(input())

sec = (s+1) >> 1
print(sec)

Solution (Python):
import math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
N = int(input())

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

Solution (Python):
import math

N = int(input())
print(math.ceil(N/2))

Solution (Python):
N = int(input())

print(int((N+1)/2))

Solution (Python):
print((int(input()) + 1)//2)

Solution (Python):


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

Solution (Python):
N=int(input())
ans=N//2 + N%2
print(ans)

Solution (Python):
import math
def main():
    n = int(input())


    print( math.ceil(n/2))

if __name__ == '__main__' :
    main()

Solution (Python):
n = int(input())
ans = n / 2
num = int(ans + 0.5)
print(num)

Solution (Python):
n = int(input())

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

Solution (Python):


x = int(input())
if x % 2 == 0:
    print(int(x/2))
else:
    print(int((x+1)/2))

Solution (Python):
n = int(input())
print((n+1)//2)

Solution (Python):
import numpy as np

N = int(input())

print(int(np.ceil(N / 2)))

Solution (Python):
from math import ceil
N = int(input())
print(ceil(N/2))

Solution (Python):
N = int(input())

if N % 2 == 0:
    print(N//2)

else:
    print(N//2 + 1)

Solution (Python):
N = int(input())
if N % 2 == 0:
  print(N//2)
else:
  print(N//2+1)

Solution (Python):
n = int(input())
print(int(n // 2) if n % 2 == 0 else int(n // 2 + 1))

Solution (Python):
input = raw_input
n = int(input())
out =  n //2
if n % 2 == 1:
    out += 1
print(out)

Solution (Python):
n = int(input())
import math
print(math.ceil(n/2))

Solution (Python):
import sys
input = lambda: sys.stdin.readline().rstrip() 

def resolve():
    N = int(input())
    print((N+1)//2)

if __name__ == '__main__':
    resolve()

Solution (Python):
n = int(input())

if (n % 2 == 1):
   print(int(n/2) + 1)
else:
   print(int(n/2))

Solution (Python):

n = int(input())
ans = n // 2
if(n % 2 == 1):
    ans += 1
print(ans)

Solution (Python):
n = int(input())
if n%2 == 0:
    print(n//2)
else:
    print(n//2 + 1)

Solution (Python):


n = int(input())

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

Solution (Python):
def main():
    N = int(input())
    
    print((N+1)//2)

    return

if __name__ == "__main__":
    main()

Solution (Python):
import math


def main():
    n = int(input())
    print(math.ceil(n / 2))


if __name__ == '__main__':
    main()

Solution (Python):
n = int(input())
ans = 0
if n % 2 ==0:
    ans = int(n/2)
else:
    ans = int(n/2) + 1
print(ans)

Solution (Python):
n = int(input())

ans = (n+1)//2

print(ans)

Solution (Python):
N=int(input())

r=0

r=N //2
mod=N % 2

if(mod!=0):
 print(r+1)
else:
 print(r)

Solution (Python):
N = int(input().strip() ) ;
print ( N//2 + N % 2 ) ;

Solution (Python):
N = int(input())
ans = int((N+1) / 2)
print(ans)

Solution (Python):
import math
print(math.ceil(int(input())/2))

Solution (Python):
import math

a = int(input())

print(math.ceil(a/2))

Solution (Python):
n=int(input())
if (n%2==0):
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
n = int(input())
print(n//2 if n%2 == 0 else n//2 + 1)

Solution (Python):
import numpy as np
import math as m

def main(**kwargs):
    r = int(n / 2 + 0.5)
    return r

if __name__ == "__main__":
    cin = np.array(input().split(" ")).astype("int")
    n, *_ = cin

    cout = main(n=n)
    print(cout)

Solution (Python):
n = int(input())
print((n+1)//2)

Solution (Python):
import math
n = int(input())

print(math.ceil(n/2))

Solution (Python):
N = int(input())
if N % 2 :
    print(N // 2 +1)
else :
    print(N //2)

Solution (Python):
printn = lambda x: print(x,end='')
inn = lambda : int(input())
inl   = lambda: list(map(int, input().split()))
inm   = lambda:      map(int, input().split())
ins = lambda : input().strip()
DBG = True 
BIG = 10**18
R = 10**9 + 7

def ddprint(x):
  if DBG:
    print(x)

n = inn()
print((n+1)//2)

Solution (Python):
N = int(input())

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

Solution (Python):
input_line = int(input())

print((input_line+1) // 2)

Solution (Python):
N=int(input())
print((N+1)//2)

Solution (Python):
import math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
N=int(input())
if N%2!=0:
    print(N//2+1)
else:
    print(N//2)

Solution (Python):
def main():
    n = int(input())
    if n%2 == 0:
        print(n//2)
    else:
        print(n//2+1)



if __name__ == '__main__':
    main()

Solution (Python):
import sys

line = sys.stdin.readline().strip()
n = int(line)
print(n//2+n%2)

Solution (Python):
n = int(input())
if n%2:
    print(n//2+1)
else:
    print(n//2)

Solution (Python):
import math

a = int(input())
print(math.ceil(a/2))

Solution (Python):
N=int(input())
ans=(N+1)//2
print(ans)

Solution (Python):
N = int(input())

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

Solution (Python):
a = int(input())

if a % 2 == 0:
    b = a/2

else:
    b = (a+1)/2

print(int(b))

Solution (Python):
import math
n=int(input())
a=n/2
print(math.ceil(a))

Solution (Python):
N = int(input())
if N%2 == 0:
    print (N//2)
else:
    print (N//2+1)

Solution (Python):
n=int(input())
if n%2==0:
  print(n//2)
else:
  print((n//2)+1)

Solution (Python):
n = int(input())

print("%d"%(-(-n // 2)))

Solution (Python):
def main():
    N = int(input())
    if N%2 == 0:
        print(int(N/2))
    else:
        print(int(N/2+1))

if __name__ == '__main__':
    main()

Solution (Python):
N = int(input())

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

Solution (Python):
import math
n=int(input())
print(math.ceil(n/2))

Solution (Python):
n=int(input())
if n%2==1:
  print(n//2+1)
else:
  print(n//2)

Solution (Python):
import numpy as np
n = int(input())
if n%2 == 0:
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
import math

N = int(input())
print(math.ceil((N/2)))

Solution (Python):
n=int(input())
ans = -(-n // 2)
print(ans)

Solution (Python):
n=int(input())
if n%2==0:
    print(n//2)
else:
    print((n//2)+1)

Solution (Python):
N = int(input())
print(N//2+N%2)

Solution (Python):
n=int(input())

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

Solution (Python):


n = int(input())

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

Solution (Python):
N = int(input())
a, b = divmod(N, 2)
print(a+b)

Solution (Python):
N = int( input() )

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

Solution (Python):

import sys


def solve(N: int):
    ans = N // 2 + N % 2
    print(ans)

def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    solve(N)

if __name__ == '__main__':
    main()

Solution (Python):
a = int(input())
print(-(-a // 2))

Solution (Python):
N = int(input())
if N%2==0:
    print(N//2)
else:
    print(N//2 + 1)

Solution (Python):
import math

N = int(input())
print(math.ceil(N / 2))

Solution (Python):
N = int(input())

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

Solution (Python):
from sys import stdin


def main():
    N = int(stdin.readline().rstrip())
    print(N // 2 + N % 2)


if __name__ == "__main__":
    main()

Solution (Python):
n = int(input())

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

Solution (Python):
n = int(input())

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

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

Solution (Python):
n = int(input())

if n%2 != 0:
  print(int(n/2)+1)
else:
  print(int(n/2))

Solution (Python):
N = int(input())

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

Solution (Python):
n = int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)

Solution (Python):
if __name__ == '__main__':
    a = int(input())
    n = 0
    if a % 2 == 1:
        n = a// 2 +1
    else:
        n= a //2

    print(n)

Solution (Python):
import math
N = float(input())
print(math.ceil(N/2))

Solution (Python):
def resolve():
    N = int(input())  

    print(-(-N//2))
 
if __name__ == "__main__":
    resolve()

Solution (Python):
import math
n=int(input())
print(math.ceil(n/2))

Solution (Python):
n = int(input())
print(int((n+1)//2))

Solution (Python):
N = int(input())


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

Solution (Python):
import math
N = int(input())

print(math.ceil(N/2))

Solution (Python):
import numpy as np
N = int(input())
print(int(np.ceil(N/2)))

Solution (Python):
N = int(input())
ans = (-N) // 2 * -1
print(ans)

Solution (Python):
n = int(input())
if n%2==0:
  print(n//2)
else:
  print(n//2+1)

Solution (Python):
n = int(input())
if n%2 == 0:
  print(n//2)
else:
  print(n//2 + 1)

Solution (Python):
n = int(input())
print((n+1)//2)

Solution (Python):
a = int(input())
if a % 2 == 0:
    b = int(a / 2)
else:
    b = int(int(a / 2) + 1)

print(b)

Solution (Python):


import sys

DEBUG = False

def solve():
    return


def read_int_list(sep = " "):
    return [int(s) for s in sys.stdin.readline().rstrip().split(sep)]

def read_int():
    return int(sys.stdin.readline())

def dprint(*args, **kwargs):
    if DEBUG:
        print(*args, **kwargs)
    return

def divceil(a, b):
    return (a + b - 1) // b

def main():
    n = read_int()
    print(divceil(n, 2))


if __name__ == "__main__":
    main()

Solution (Python):
import math

n = int(input())
print(math.ceil(n / 2))

Solution (Python):
n=int(input())
print("{}".format((n+1)//2))

Solution (Python):
N=int(input())

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

Solution (Python):
n = int(input())
print(int((n + 2 -1) /2))

Solution (Python):
N = int(input())

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

Solution (Python):
N = int(input())

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

Solution (Python):
import math

N = int(input())
print(math.ceil(N/2))