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


def get_input() -> int:
    """
    標準入力の取得

    Returns:\n
        int: 標準入力
    """
    N = int(input())

    return N


def main(N: int) -> None:
    """
    求解処理

    Args:
        N (int): ページ数
    """
    result = math.ceil(N/2)

    
    print(result)


if __name__ == "__main__":
    N = get_input()
    main(N)

Solution (Python):


import math

N = int(input())


result = math.ceil(N/2)


print(result)

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

ans = -(-N//2)

print(ans)

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

Solution (Python):
S = int(input())
q , mod = divmod(S , 2)
print(q+mod)

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

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

print(math.ceil(n/2))

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

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP

n = int(input())
print(Decimal(n/2).quantize(Decimal(0), rounding=ROUND_HALF_UP))

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

Solution (Python):
from sys import stdin
N = stdin.readline().rstrip()
N = int(N)
print(N//2 + N%2)

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

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

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

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

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

ans = 0

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

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

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

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

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

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

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

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

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

print((n+1)//2)

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

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

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

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

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

main()

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

print(N//2+N%2)

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

x = int(n/2)

if n%2 == 1:
    ans = x + 1
else:
    ans = x

print(ans)

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

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

main()

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

Solution (Python):
import math

n = int(input())

print(math.floor((n+1)/2))

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

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

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

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

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

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


if __name__ == '__main__':
    main()

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

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

print(ans)

Solution (Python):
div, rem = divmod(int(input()), 2)
print(div + bool(rem))

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

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

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

ans = n//2
ans += n%2

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):
from math import factorial as fact
import math
import sys
import itertools
import numpy as np
from collections import Counter
import datetime
from collections import deque



def input1():
	return int(input())


def input2():
	return map(int,input().split())


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

def keta(N):
	return len(str(N))


def input_daytime(input_time):
	time,distance=input_time.split()
	t=time.split(":")
	se=str(t[-1]).split(".")
	dt1 = datetime.timedelta(hours=int(t[0]),minutes=int(t[1]),seconds=int(se[0]),milliseconds=int(se[1]))
	return dt1

def combinations(n,r):
	return list(itertools.combinations(range(n),r))



def all_sets(num_list):
	subsets=[]
	for i in range(2,len(num_list) + 1):
		for c in combinations(num_list, i):
			subsets.append(c) 
	return subsets


def ch(x1):
	cf=[]
	for i in range(2,math.sqrt(x1)+1):
		if x1 % i==0:
			cf.append(i)
	return cf

def CountOneRoots(x,y):
	
	return fact(x+y)/fact(x)/fact(y)


def prime_factorize(n):
    a = []
    while n % 2 == 0:
        a.append(2)
        n //= 2
    f = 3
    while f * f <= n:
        if n % f == 0:
            a.append(f)
            n //= f
        else:
            f += 2
    if n != 1:
        a.append(n)
    return a
	
def count_str(m):
	tmp={}
	for i in range(10):
		if i in tmp:
			tmp[i]=1
		else:
			tmp[i]+=1
	return tmp

def is_prime(n):
	if n==1: return True

	for i in range(2,int(math.sqrt(n))+1):
		if n%i==0:
			return False
	return True


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

Solution (Python):


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

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

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

Solution (Python):

class abc_157:
    
    def __init__(self):
        pass
    
    def A(self):
       N=int(input())
       print(int(N/2)+(N%2))
    
    def B(self):
        A=[list(map(int,input().split())) for i in range(3)]
        N=int(input())
        
        B=[]
        for i in range(N):B.append(int(input()))
        
        
            
    def C(self):
        NM=list(map(int,input().split()))
        sc=[list(map(int,input().split())) for i in range(NM[1])]
        farst,second,third,full=[],[],[],[]
        division_list=[10**i for i in range(3)]
        ans=0
        
        for i in sc:
            if i[0]==1:farst.append(i)
            elif i[0]==2:second.append(i)
            else :third.append(i)
        
        sort_func=lambda val:val[1]
        farst.sort(key=sort_func)
        second.sort(key=sort_func)
        third.sort(key=sort_func)
        
        if farst:ans+=(10**(3-farst[0][0]))*farst[0][1]
        if second:ans+=(10**(3-second[0][0]))*second[0][1]
        if third:ans+=(10**(3-third[0][0]))*third[0][1]
        
        if int(ans/division_list[NM[0]-1])!=0:print(ans)
        else:print("-1")
            
    def D(self):
        S=input()
        Q=int(input())
        Q_list=[list(input().split()) for i in range(Q)]
        
        d=deque()
        top=True
        end=False
        count_revers=0
        
        d.append(S)
        for i in Q_list:
            
            if int(i[0])==1:
                count_revers+=1
                if top==True:
                    top=False
                    end=True
                else:
                    top=True
                    end=False
            
            else:
                
                if int(i[1])==1 :
                    if top==True:d.appendleft(i[2])
                    else:d.append(i[2])
                
                else :
                    if top==True:d.append(i[2])
                    else:d.appendleft(i[2])
                
                
        ans = "".join(list(d)) if count_revers%2==0 else  "".join(list(d))[::-1]
        print(ans)
        
    def E(self):
        pass
    
    def F(self):
        pass
    
    
if __name__=='__main__':
    obj=abc_157()
    obj.A()

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

ans=divmod(n,2)
A=ans[0]+ans[1]

print(A)

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

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


import math
S = int(input())

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

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

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

print(N//2 + N%2)

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

import math
print(math.ceil(n/2))

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

Solution (Python):
from sys import stdin, setrecursionlimit


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


if __name__ == "__main__":
    setrecursionlimit(10000)
    main()

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

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

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

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

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

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

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

if __name__ == '__main__':

    ABC_157_A()

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

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

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

Solution (Python):



n = int(input())

print(n // 2 + n % 2)

Solution (Python):
n = int(raw_input())
print max(1, (n+1)/2)

Solution (Python):
import itertools
import math
import fractions
import functools
n = int(input())
if n % 2 == 1:
    print(n//2+1)
else: print(n//2)

Solution (Python):
s=int(input())
if s%2==0:
  print(int(s/2))
else:
  print(int((s+1)/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):
from math import ceil
n = int(input())
print(ceil(n/2))

Solution (Python):
import math

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

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
B = N % 2

print(A + B)

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

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


def main():
    N = int(input())
    print(N//2+1) if N % 2 else print(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 == 1:
  print(n//2 + 1)
else:
  print(n//2)

Solution (Python):
import sys










stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

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




print(n//2 + n%2)

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

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

Solution (Python):

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

Solution (Python):
n = input()

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

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

Solution (Python):

"""
Created on Thu May  7 13:56:42 2020

@author: shinba
"""
N = int(input())

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

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

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

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

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

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

print(math.ceil(N/2))

Solution (Python):
import sys
import math
from math import ceil

input = sys.stdin.readline

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop
from itertools import permutations, accumulate
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right
from copy import deepcopy
from operator import itemgetter
from fractions import gcd
import sys
def I(): return int(input())  
def Is(): return map(int, input().split())  
def LI(): return list(map(int, input().split()))  
def TI(): return tuple(map(int, input().split()))  
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()  
def LS(): return list(input())  
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(1000000)
MOD = 1000000007
INF = float('inf')

n = I()
print(ceil(n/2))

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**6) 
import math
from copy import copy, deepcopy
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque 


from collections import Counter

from itertools import accumulate

from heapq import heapify,heappop,heappush



def input(): return sys.stdin.readline()[:-1]
def printl(li): print(*li, sep="\n")
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds

def main():
    mod = 10**9+7
    

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1
def II(): return int(input())

def MI(): return map(int, input().split())
def MI1(): return map(int1, input().split())

def LI(): return list(map(int, input().split()))
def LI1(): return list(map(int1, input().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

INF = float('inf')

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


if __name__ == '__main__':
    solve()

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):
import sys
sys.setrecursionlimit(10**6)
readline = sys.stdin.readline
n = int(readline())

print(n//2+n%2)

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

Solution (Python):
import math
import queue
from collections import defaultdict
 
def readInt():
	return int(input())
def readInts():
	return list(map(int, input().split()))
def readChar():
	return input()
def readChars():
	return input().split()
def factorization(n):
	res = []
	if n%2==0:
		res.append(2)
	for i in range(3,math.floor(n//2)+1,2):
		if n%i==0:
			c = 0
			for j in res:
				if i%j==0:
					c=1
			if c==0:
				res.append(i)
	return res
def fact2(n):
	p = factorization(n)
	res = []
	for i in p:
		c=0
		z=n
		while 1:
			if z%i==0:
				c+=1
				z/=i
			else:
				break
		res.append([i,c])
	return res
def fact(n):
	ans = 1
	m=n
	for _i in range(n-1):
		ans*=m
		m-=1
	return ans
def comb(n,r):
	if n<r:
		return 0
	l = min(r,n-r)
	m=n
	u=1
	for _i in range(l):
		u*=m
		m-=1
	return u//fact(l)
def printQueue(q):
	r=q
	ans=[0]*r.qsize()
	for i in range(r.qsize()-1,-1,-1):
		ans[i] = r.get()
	print(ans)

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

Solution (Python):

import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = ir()
answer = (N+1) // 2
print(answer)

Solution (Python):


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

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

Solution (Python):


n = int(input())

print((n + 1) // 2)

Solution (Python):
def main():
    n = int(input())
    if n%2:
        print(n//2+1)
    else:
        print(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):
import math
N = int(input())
print(math.ceil(N/2))

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

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

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

Solution (Python):
import math

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

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

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

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

s = -( - N // 2 )

print(s)

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

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

ans = N // 2

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

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

solve()

Solution (Python):
def solve(n):
    return (n+1)//2

n = int(input())
print(solve(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):


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

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

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

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

print(int(temp))

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

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

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

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

Solution (Python):
import math
x = input()
page = (int(x)+1) // 2
print(page)

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

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

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

Solution (Python):
from fractions import gcd
from collections import Counter, deque, defaultdict
from heapq import heappush, heappop, heappushpop, heapify, heapreplace, merge
from bisect import bisect_left, bisect_right, bisect, insort_left, insort_right, insort
from itertools import accumulate, product, permutations, combinations

N = int(input())

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

Solution (Python):

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

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

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

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

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

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

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

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

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

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

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

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

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


if __name__ == '__main__':
    solve()

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

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
import sys

s = int(sys.stdin.readline().rstrip())

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

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

print(n//2+1 if n%2 != 0 else 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(-(-N//2))

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

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

print(x//2+x%2)

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

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

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

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

Solution (Python):
def main():
    import sys
    import math
    import collections
    def input():
        return sys.stdin.readline()[:-1]
    N=int(input())
    print(math.ceil(N/2))
if __name__ == '__main__':
    main()

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

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

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

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

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

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

print((N+1)//2)

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

Solution (Python):
from math import ceil

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

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

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

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):
import sys;input=lambda:sys.stdin.readline().rstrip();aint=lambda:int(input());ints=lambda:list(map(int,input().split()))
import math;floor,ceil=math.floor,math.ceil
from collections import deque
Yes=lambda b:print('Yes')if b else print('No');YES=lambda b:print('YES')if b else print('NO')
is_even=lambda x:True if x%2==0 else False

def main():
  n=aint()
  print(int(ceil(0.5*n)))
    
if __name__ == '__main__':
  main()

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

Solution (Python):
print( round( float( input() ) / 2 + .1 ) )

Solution (Python):

N = int(input())



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

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

Solution (Python):
import sys
import math

input = sys.stdin.readline

N=int(input())

q,mod = divmod(N,2)

print(q+mod)

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