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 sys
sys.setrecursionlimit(10**6)
from math import floor,ceil,sqrt,factorial,log
from heapq import heappop, heappush, heappushpop
from collections import Counter,defaultdict,deque
from itertools import accumulate,permutations,combinations,product,combinations_with_replacement
from bisect import bisect_left,bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd

mod = 10 ** 9 + 7
inf = float('inf')
ninf = -float('inf')
 

def ii(): return int(sys.stdin.readline().rstrip()) 
def mii(): return map(int,sys.stdin.readline().rstrip().split())
def limii(): return list(mii()) 
def lin(n:int): return [ii() for _ in range(n)]
def llint(n: int): return [limii() for _ in range(n)]

def ss(): return sys.stdin.readline().rstrip() 
def mss(): return sys.stdin.readline().rstrip().split()
def limss(): return list(mss()) 
def lst(n:int): return [ss() for _ in range(n)]
def llstr(n: int): return [limss() for _ in range(n)]




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

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

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):
N = int(input())
print((N+1)//2)

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

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

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def SI(): return sys.stdin.readline()[:-1]

def main():
    n=II()
    print((n+1)//2)

main()

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

print(-(-N//2))

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

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

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

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

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

print((N+1)>>1)

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

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

Solution (Python):
def I(): return int(input())
def MI(): return map(int, input().split())
def LMI(): return list(map(int, input().split()))


N = I()

print((N + 1) // 2)

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

print( -(-n//2) )

Solution (Python):
import math
print(math.ceil(int(input())/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())

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

Solution (Python):
import math

n = int(input())

a = math.ceil(n / 2)

print(a)

Solution (Python):
import numpy as np
n = int(input())

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

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

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

ans = math.ceil(N / 2)

print(ans)

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

Solution (Python):
a = input()
n, mod = divmod(int(a), 2)
print(n if mod == 0 else n + 1)

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

Solution (Python):
N = int(input())
if N%2 != 0:
    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):
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())
ans = n//2 if n % 2 == 0 else n//2+1
print(ans)

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

Solution (Python):

N = int(input())


m = N % 2

P = int(N / 2)

if m == 1:
    P += 1


print(P)

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

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

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

Solution (Python):
stdin = open(0)
K = (int)(stdin.readline())
if int(K % 2) == 1:
  print(int(K/2)+1)
else:
  print(int(K/2))

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

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 = input()
isPrime = int(n)%2
tmp = int(n)//2

if isPrime == 0:
    print(tmp)
else:
    print(tmp+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))

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

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

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

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

    ans = N // 2
    print(ans + 1)


resolve()

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

x = N // 2
y = N % 2

if y == 0:
    print(x)
else:
    print(x + 1)

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

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

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):
import math
n = int(input())
 
if n%2 == 0:
  print(n//2)
else:
  print(math.ceil(n/2))

Solution (Python):


import sys
import math
import time

import collections
from collections import deque
import queue
import copy
import bisect


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)





N = int(input())

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

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())

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

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

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

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
import numpy as np

N = int(input())
if N%2==0:
  a = int(N / 2)
else:
  a = int(np.floor(N / 2) + 1)

print(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 == 1:
  print(int((n+1)/2))
else:
  print(int(n/2))

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):
import math
N = int(input())
if( N%2 == 0 ):
  print(int(N/2))
else:
  print(math.ceil((N/2)))

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

else:
  print(int((N+1)/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 math
n = int(input())
print(math.ceil(n/2))

Solution (Python):
i = int(input())
print( i//2 + i % 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 == 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())
print(int(n/2)+n%2)

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

Solution (Python):
print((int(input()) + 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+1)//2)

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

q, mod = divmod(n, 2)

print(q + mod)

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

Solution (Python):
N = int(input())
p = int(N / 2)

if N % 2 == 1:
    p = p + 1

print(p)

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())

ans = int(N/2) + 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())
d, m = divmod(N, 2)
print(d if m == 0 else d + 1)

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

paper = page // 2
a = page % 2
if a != 0:
  paper += 1

print(paper)

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

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

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

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

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):
import math

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

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

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

Solution (Python):
N = int(input())
K = N % 2
S = (N + K) / 2 
I = round(S)
print(I)

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

Solution (Python):
import math 


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

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):
N = int(input())

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

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

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

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(int(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+1)/2))

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())
ans = 0
a = 0
for i in range(1, n+1):
    if ans % 2 == 0:
        a += 1
    ans += 1

print(a)

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

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

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

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

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

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

print(N//2+N%2)

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

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

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

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

ans = math.ceil(N/2)

print(ans)

Solution (Python):
import math

N = int(input())
ans = N /2

print(math.ceil(ans))

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

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

if n % 2 == 0:
    ans = n / 2
else:
    ans = n // 2 + 1

print(int(ans))

Solution (Python):
import os

def main():
    n = int(input())
    syo = n / 2
    amari = n % 2
    print(int(syo + amari))

if __name__ == "__main__":
    main()

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

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

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

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

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):

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

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

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):
from sys import stdin

n = int(stdin.readline().rstrip())

print(-(-n // 2))

Solution (Python):

import sys
input = sys.stdin.buffer.readline


from collections import defaultdict

con = 10 ** 9 + 7

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


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


if __name__ == '__main__':
	main()

Solution (Python):

N=int(input())


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

Solution (Python):


n = int(input())

ans = -(-n//2)

print(ans)

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

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

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

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

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

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

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

    q, mod = divmod(N, 2)

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

if __name__ == "__main__":
    main()

Solution (Python):
def main():
  n=int(input())
  print((n+1)//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:
  s=(n+1)//2
else:
  s=n//2
print(s)

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 == 0:
  print(int(n/2))
else:
  print((n//2) +1)

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

Solution (Python):
n=int(input())
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())
print(-(-n//2))

Solution (Python):
import sys
from io import StringIO
import unittest
import math

def resolve():
    n = int(input().strip())

    n = round(n/2 + 0.1)
    print(int(n))
    return

resolve()

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):
N = int(input())
print((N+1)//2)

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

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

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

print(ans)

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

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

Solution (Python):

import sys

f = sys.stdin
N = int(f.readline())

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(ans)

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

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

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

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

Solution (Python):
N = int(input())
if N%2==0:
    print("{}".format((N//2)))
else:
    print("{}".format((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):
a = int(input())

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

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

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

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

Solution (Python):

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

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

print(N // 2 + N % 2)

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

ans = n//2 + n%2

print(ans)

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

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

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

Solution (Python):
import math
n = int(input())
if n < 3:
    print(1)
else:
    print(math.ceil(n / 2))

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

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

print((n+1)//2)

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

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

print(-(-n // 2))

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

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):
import math
print(math.ceil(int(input()) / 2))

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

print(-1 * (-1 * N // 2))

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

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

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

print(math.ceil(N / 2))

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

q = N // 2
m = N % 2
print(q + m)

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

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

Solution (Python):
n = input()
n = int(n)
a = n % 2

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

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

Solution (Python):

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

print(m)

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

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

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

Solution (Python):
N = int(input())
print(int(N/2) if N%2 == 0 else 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))

Solution (Python):
import math

N=int(input())

print(math.ceil(N/2))

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

res += n // 2
if n % 2 == 1:
    res += 1

print(res)

Solution (Python):
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

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

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

Solution (Python):
n = int(input())
b = True
cnt = 0
while b:
    if n > 0:
        cnt += 1
        n -= 2
    else:
        b = False

print(cnt)

Solution (Python):
a=int(input())
q,mod = divmod(a,2)
if mod == 0:
  print(q)
else:
  print(q + 1)

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

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

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

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

Solution (Python):
a = int(input())
if a%2==0:
    ans = int(a/2)
else:
    ans = int(a/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):
a = int(input())
print(a//2 + a%2)

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

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

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

Solution (Python):
print(int((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())

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

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

sign = int(num%2)

if sign == 0:
  ans = num//2
elif sign == 1:
  ans = (num+1)//2

print(ans)

Solution (Python):
n = int(input())
count = 1
a = 2
while True:
    if n>a:
        a += 2
        count += 1
    else :
        break
print(count)

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

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

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

Solution (Python):


from fractions import gcd
import math
from math import ceil,floor
import collections







N=int(input())

print(math.ceil(N/2))

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

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

print(n)

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

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

Solution (Python):
N=int(input())
print((N+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):
import math
N = int(input())
ans = math.ceil(N/2)
print(ans)

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

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

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

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

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

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

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

if N % 2 == 0:
    R = N // 2
else:
    R = N // 2 + 1

print(R)

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

print(int(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 == 1:
	print((N // 2) + 1)
else:
  print(N // 2)

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

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

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

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

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

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

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

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):
k = int(input())
if k % 2 == 0:
  print(k//2)
else:
  print(k//2 + 1)

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

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

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

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

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

n = int(input())

if n % 2 == 0:
    ans = n/2
else:
    ans = n/2 + 0.5

print(int(ans))

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

d, m = divmod(n, 2)

print(d+m)

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

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

print((N+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==1):
  ans = N//2 + 1
else:
  ans = N//2
print(ans)

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

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

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)))

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

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

res = math.ceil(n/2)
print(res)

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

print(r)

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):
N = int(input())
print((N//2)+(N%2))

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

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

d = n % 2

print(n // 2 + d)

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

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

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 not N % 2:
  print(int(N / 2))
else:
  print(int(N // 2 + 1))

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(int(n/2))
else:
    print(int((n/2) + 1))

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

Solution (Python):
import numpy as np

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))

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(int(N/2))
else:
  print(int(N//2 +1))

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

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

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

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

Solution (Python):



n = int(input())

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

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

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

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

import math
papers = math.ceil(n / 2)

print(papers)

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:
    s = int(n/2)
else:
    s = n // 2 + 1

print(s)

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

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

Solution (Python):

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

if __name__ == '__main__':
    main()

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

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

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

print(int(n))

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

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

ans = n / 2
print(math.ceil(ans))

Solution (Python):
import math
N=input()
N=int(N)
NN=N+1
print(math.floor(NN/2))

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())
answer=N/2
if N%2==1:
  answer=N//2+1

  
print(int(answer))

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

Solution (Python):
N= int(input().split()[0])

print((N//2)+(N%2))

Solution (Python):
import math

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

Solution (Python):
import math

n = int(input())


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

Solution (Python):
import bisect, collections

def solution():
    n = input().strip()
    print((int(n)+1)//2)
    

    

def main():    
    
    for _ in range(1):
        solution()
    

main()

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

Solution (Python):
import sys

def main():
    tmp = input().replace('\n','').split(' ')[0]
    res = int(tmp)//2 + int(tmp)%2
    print(res)
if __name__ == '__main__':
    input = sys.stdin.readline
    main()

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

Solution (Python):






import math
import statistics
import numpy as np
import queue
import itertools
import functools 

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

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N / 2))

Solution (Python):
a = int(input())
ans = int((a+1)/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(-1*(-n//2))

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

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

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

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


if __name__ == "__main__":
    resolve()

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 sys


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



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):
class Solution:
    def solve(self, N: int) -> str:

        return N // 2 + N % 2


if __name__ == '__main__':

    
    N = int(input())

    
    solution = Solution()
    print(solution.solve(N))

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

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=input()
n=float(n)
if n%2==0:
    print(int(n/2))
elif n%2==1:
    print(int(n/2+0.5))

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

print(a//2+a%2)

Solution (Python):
import numpy as np

N=int(input())

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

Solution (Python):
import math

N=int(input())

ans=math.ceil(N/2)

print(ans)

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

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 + 1)//2)

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