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

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

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

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

else:
    print(N//2+1)

Solution (Python):
N=int(input())
M=N+1

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

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

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

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

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

Solution (Python):
import math
if __name__ == '__main__':
    n = input()
    n = int(n)
    ans = math.ceil(n/2)
    print(ans)

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

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

Solution (Python):
import math

n = int(input())

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

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

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

Solution (Python):
import math

n = int(input())

n = math.ceil(n/2)

print(n)

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

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

print((N + 1) // 2)

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

print((N + 1) // 2)

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

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

print(str(j))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math

def func(N):
    ans = math.floor(N / 2) + 1 if N % 2 else math.floor(N / 2)
    return ans
  
  
N = int(input())

print(func(N))

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

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

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

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

print(-(-N//2))

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

Solution (Python):
from sys import stdin
import sys
import numpy as np
import collections
from functools import cmp_to_key
import heapq


def rsa(sep = ''):
    if sep == '' :
        return input().split() 
    else: return input().split(sep)
def rip(sep = ''):
    if sep == '' :
        return map(int, input().split()) 
    else: return map(int, input().split(sep))
def ria(sep = ''): 
    return list(rip(sep))
def ri(): return int(input())
def rd(): return float(input())
def rs(): return input()

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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):

import sys
import math


def solve(N: int):
    return 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))  
    print(solve(N))

if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math
N = int(input())
a=N/2
b=N%2
if b == 0:
  print(math.floor(a))
elif b == 1:
  print(math.floor(a+0.5))
else:
  print("error")

Solution (Python):
import math
 
N = int(input())
 
M = math.floor(N / 2)
if N % 2 != 0:
    M = M+1
print(M)

Solution (Python):

import re
import math
import itertools
from copy import deepcopy
import fractions
import random
from functools import lru_cache
from heapq import heappop,heappush
import time
import sys
readline = sys.stdin.readline
sys.setrecursionlimit(2000)

alphabet="abcdefghijklmnopqrstuvwxyz"
mod=int(10**9+7)
inf=int(10**20)
def yn(b):
    if b:
        print("yes")
    else:
        print("no")
def Yn(b):
    if b:
        print("Yes")
    else:
        print("No")
def YN(b):
    if b:
        print("YES")
    else:
        print("NO")
class union_find():
    def __init__(self,n):
        self.n=n
        self.P=[a for a in range(N)]
        self.rank=[0]*n
 
    def find(self,x):
        if(x!=self.P[x]):self.P[x]=self.find(self.P[x])
        return self.P[x]
 
    def same(self,x,y):
        return self.find(x)==self.find(y)
 
    def link(self,x,y):
        if self.rank[x]<self.rank[y]:
            self.P[x]=y
        elif self.rank[y]<self.rank[x]:
            self.P[y]=x
        else:
            self.P[x]=y
            self.rank[y]+=1
 
    def unite(self,x,y):
        self.link(self.find(x),self.find(y))
 
    def size(self):
        S=set()
        for a in range(self.n):
            S.add(self.find(a))
        return len(S)
def bin_(num,size):
    A=[0]*size
    for a in range(size):
        if (num>>(size-a-1))&1==1:
            A[a]=1
        else:
            A[a]=0
    return A
def fac_list(n,mod_=0):
    A=[1]*(n+1)
    for a in range(2,len(A)):
        A[a]=A[a-1]*a
        if(mod>0):A[a]%=mod_
    return A
def comb(n,r,mod,fac):
    if(n-r<0):return 0
    return (fac[n]*pow(fac[n-r],mod-2,mod)*pow(fac[r],mod-2,mod))%mod
def next_comb(num,size):
    x=num&(-num)
    y=num+x
    z=num&(~y)
    z//=x
    z=z>>1
    num=(y|z)
    if(num>=(1<<size)):return False
    else:
        return num
def get_primes(n,type="int"):
    A=[True]*(n+1)
    A[0]=False
    A[1]=False
    for a in range(2,n+1):
        if A[a]:
            for b in range(a*2,n+1,a):
                A[b]=False
    if(type=="bool"):return A
    B=[]
    for a in range(n+1):
        if(A[a]):B.append(a)
    return B
def is_prime(num):
    if(num<=2):return False
    i=2
    while i*i<=num:
       if(num%i==0):return False
       i+=1
    return True
def join(A,c=" "):
    n=len(A)
    A=list(map(str,A))
    s=""
    for a in range(n):
        s+=A[a]
        if(a<n-1):s+=c
    return s


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

Solution (Python):
N = int(input())
r=N//2
q=N%2

print(str(r+q))

Solution (Python):
def inp():
    return input()
def iinp():
    return int(input())
def inps():
    return input().split()
def miinps():
    return map(int,input().split())
def linps():
    return list(input().split())
def lmiinps():
    return list(map(int,input().split()))
def lmiinpsf(n):
    return [list(map(int,input().split()))for _ in range(n)]

n = iinp()
a = n // 2

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

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

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

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

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

print(ans)

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

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

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

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

Solution (Python):
import math

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

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

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

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

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

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

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())
needs = math.ceil(N/2)
print(needs)

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

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

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

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

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

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

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

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

print(y)

Solution (Python):
import math

n = int(input())

print(math.ceil(n / 2))

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

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

Solution (Python):
N = int(input())
M = N // 2
A = (N / 2) - M
if A == 0:
    A = 0
else:
    A = 1
T = M + A
print(T)

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

print((N+1) // 2)

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

Solution (Python):
x = input()

if int(x) % 2:
    print(int(int(x)/2+0.5))
else:
    print(int(int(x)/2))

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

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

Solution (Python):
if __name__ == "__main__":
    n = int(input())
    print(n//2+n%2)

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

n = int(input())
print(solve(n))

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

Solution (Python):

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

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

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

Solution (Python):
from math import ceil, floor

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

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

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

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

Solution (Python):
def solve(n):
    print(int(n / 2) + int(n % 2))



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

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

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

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

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

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

print(N // 2 + N % 2)

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

b = int(a/2)

if b < a / 2:
  b = b + 1
 
print(b)

Solution (Python):

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

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

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

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



def main():
    n = int(input())
    ans = n // 2

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

    print(ans)


if __name__ == '__main__':
    main()

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

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

if __name__ == '__main__':
  run()

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

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

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

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy,copy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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


if __name__=='__main__':
    main()

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

num = N//2
a = N%2

print(num+a)

Solution (Python):
import sys
from math import *
from collections import deque, Counter, defaultdict
from fractions import gcd
input = lambda: sys.stdin.readline().rstrip()

def eprint(s):
    sys.stderr.write('DEBUG: {}'.format(s))
    return

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

if __name__ == '__main__':
    main()

Solution (Python):

"""
Created on Tue Mar  3 19:08:31 2020

@author: Kanaru Sato
"""

N = int(input())

ans = N//2 + N%2

print(ans)

Solution (Python):
import math

pages = input()
count = int(pages)

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

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

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

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

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

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

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

Solution (Python):
from sys import stdin
def main():
    readline=stdin.readline
    N=int(readline())
    if N%2==0:
        print(N//2)
    else:
        print(N//2+1)
if __name__=="__main__":
    main()

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

Solution (Python):
def solve(string):
    return str((int(string) + 1) // 2)


if __name__ == '__main__':
    import sys
    print(solve(sys.stdin.read().strip()))

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

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

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

else:
    print(N//2+1)

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

num = - (-a//2)

print(num)

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

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

Solution (Python):
from collections import Counter,defaultdict,deque
from bisect import bisect_left
import sys,math,itertools,pprint,fractions
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))

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

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

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

print(n//2 + n%2)

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

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

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

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

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

count = 0
while n> 0:
    count += 1
    n -= 2
print(count)

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

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

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

Solution (Python):










import math
import statistics
import string


def intinput():
    return int(input())
def listintinput():
    return list(map(int, input().split()))
def splitintinput():
    return map(int, input().split())
def factorialsurplus(x, y, z):  
    ret = 1
    for i in range(x, y + 1):
        ret = (ret * i) % z
    return (ret)
def isprime(x):
    if x == 1:
        return False
    if x == 2:
        return True
    sq = int(math.sqrt(x))
    for i in range(2,sq+1):
        if x % i == 0:
            return False
    return True
def hcfnaive(a,b):
    if(b==0):
        return a
    else:
        return hcfnaive(b,a%b)

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

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

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

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

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

Solution (Python):
import sys
from math import ceil

if __name__ == '__main__':
    n = 0
    while n < 1 or n > 100:
        n = int(input())
        if n < 1 or n > 100:
            print("Range of N must be 100 from 1.")

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

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

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

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)
ans = a + b
print(ans)

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

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

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())
print(N//2 if N%2==0 else N//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(sum(divmod(N, 2)))

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

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

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

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

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

ans=int(n/2)

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

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

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

Solution (Python):

import sys
sys.setrecursionlimit(10000000)
INF = 1<<32


def solve(N: int):
    from math import ceil
    print(ceil(N/2))
    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):
N = int(input())
 
print(int((N+N%2)/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):
print((-(-int(input())//2)))

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

Solution (Python):

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

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

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

Solution (Python):

def main():
    info = int(input())
    flag = info / 2
    if flag.is_integer():
        result = int(flag)
    else:
        result = int(flag) + 1
    
    print(result)


if __name__ == "__main__":
    main()

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

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

Solution (Python):


N = int(input())

print((N + 1) // 2)

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

ans = -(-n//2)
print(ans)

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

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

ans=int(n/2)

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

Solution (Python):
print(eval("0--"+input()+"//2"))

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

Solution (Python):


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

if __name__ == "__main__":
    main()

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

Solution (Python):
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


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


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


def main():
    N = read_int()
    res = N // 2
    if N % 2 != 0:
      res += 1
    print(res)


main()

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

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


print((N+1)//2)

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

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

if __name__ == '__main__':
  main()

Solution (Python):

n = input()
n = int(n)
if(n%2 == 0):
	n= n/2
else:
    n = (n+1)/2
   
print(round(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())
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 sys,collections as cl,bisect as bs
sys.setrecursionlimit(100000)
input = sys.stdin.readline
mod = 10**9+7
Max = sys.maxsize
def l(): 
    return list(map(int,input().split()))
def m(): 
    return map(int,input().split())
def onem(): 
    return int(input())
def s(x): 
    a = []
    aa = x[0]
    su = 1
    for i in range(len(x)-1):
        if aa != x[i+1]:
            a.append([aa,su])
            aa = x[i+1]
            su = 1
        else:
            su += 1
    a.append([aa,su])
    return a
def jo(x): 
    return " ".join(map(str,x))
def max2(x): 
    return max(map(max,x))
def In(x,a): 
    k = bs.bisect_left(a,x)
    if k != len(a) and a[k] ==  x:
        return True
    else:
        return False
"""
def nibu(x,n,r):
    ll = 0
    rr = r
    while True:
        mid = (ll+rr)//2

    if rr == mid:
        return ll
    if (ここに評価入れる):
        rr = mid
    else:
        ll = mid+1
"""
n = onem()

print(-(-n//2))

Solution (Python):
import math
def func():
    input_num = int(input(''))
    print(math.ceil(input_num/2))
if __name__ == "__main__":
    func()

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:
    ans += 1

print(ans)

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

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

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

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

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

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

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

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

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

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

print(-(-i//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))

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

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

Solution (Python):
import math
A=int(input())
B=A/2
print(str(math.ceil(B)))

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

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

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

Solution (Python):

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
def solve():
  n = int(input())
  print((n+1)//2)
solve()

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

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

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

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

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

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

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

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

Solution (Python):
import math

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

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

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

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