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

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

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

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

if n%2 == 1:
  print((n+1)//2)
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):
import sys
import os
import math


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

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

if __name__ == '__main__':
    main()

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

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

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

Solution (Python):
N = int(input())
num = N // 2
re = N % 2

if re == 0:
  print(num)
else:
  num = num +1
  print(num)

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

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

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

Solution (Python):


n = int(input())

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

Solution (Python):
N = int(input())
answer = divmod(N, 2)

print(answer[0]+answer[1])

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

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

Solution (Python):


N= int(input())
q=N

q, mod = divmod(q, 2)

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

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

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

Solution (Python):

N = input()

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

print(ans)

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

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


if __name__ == '__main__':
    main()

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

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

while N > 2*count:
	count += 1

print(int(count))

Solution (Python):







n = int(input())

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

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

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

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

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

Solution (Python):

n = int(input())

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

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

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

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

Solution (Python):
import math

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

    print(math.ceil(n/2))

if __name__ == '__main__':
    main()

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

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

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


if __name__ == "__main__":
    main()

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

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

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())
ans = n // 2

print(ans if n % 2 == 0 else ans + 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):
import math

x = int(input())

print(math.ceil(x/2))

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())
print(((n % 2 == 0) and (n // 2)) or (n // 2 + 1))

Solution (Python):
n=int(input())
q,mod=divmod(n,2)

print(q+mod)

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

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

page = n // 2
page += n % 2

print(page)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import time,random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
mod2 = 998244353
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)
def JA(a, sep): return sep.join(map(str, a))
def JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)


def main():
    n = I()

    return (n+1) // 2


print(main())

Solution (Python):
import math

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

Solution (Python):
import math

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

Solution (Python):
import math

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

Solution (Python):
import math

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

Solution (Python):
import math
import sys

sys.setrecursionlimit(1000000)
input = lambda: sys.stdin.readline().rstrip()

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

Solution (Python):
import math

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

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

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

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

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

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

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

ans = (n + 1) // 2

print(ans)

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

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

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

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

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

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

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

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

print(ans)

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

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

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

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

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

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

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

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

print((N+1)//2)

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

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

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

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

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

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

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

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

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

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

print((N + 1)// 2)

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

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

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

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

Solution (Python):
a = list(map(int,input().split()))
b=a[0]
print((b+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+N%2)

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

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

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

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

Solution (Python):
import sys


def solve():
    input = sys.stdin.readline
    mod = 10 ** 9 + 7
    s = int(input().rstrip('\n'))
    print((s + 2 - 1) // 2)


if __name__ == '__main__':
    solve()

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

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

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

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

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

print(solve())

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

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

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

Solution (Python):
def main():
    N = int(input())
    a = N // 2
    b = N % 2
    print(a + b)
if __name__ == '__main__':
    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())

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

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

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

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

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

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

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

Solution (Python):
import numpy as np


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


if __name__ == "__main__":
    main()

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

Solution (Python):

N=int(input())

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

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

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

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

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

main()

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

if b is 1:
    a = a + 1
print(a)

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

Solution (Python):
import unittest


class TestA(unittest.TestCase):
    def test_1(self):
        self.assertEqual(think(3), 2)

    def test_2(self):
        self.assertEqual(think(2), 1)

    def test_3(self):
        self.assertEqual(think(100), 50)


def solve():
    n = read()
    result = think(n)
    write(result)


def read():
    return read_int(1)[0]


def read_int(n):
    return read_type(int, n, sep=' ')


def read_float(n):
    return read_type(float, n, sep=' ')


def read_type(t, n, sep):
    return list(map(lambda x: t(x), read_line().split(sep)))[:n]


def read_line(n=0):
    if n == 0:
        return input().rstrip()
    else:
        return input().rstrip()[:n]


def think(n):
    return n // 2 if n % 2 == 0 else n // 2 + 1


def write(result):
    print(result)


if __name__ == '__main__':
    
    solve()

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

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

q, mod = divmod(N, 2)
ans = q+mod

print(ans)

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

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

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

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

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

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

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

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

print((n + 1)//2)

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

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

print(N//2 + N%2)

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

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

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

Solution (Python):
import math

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
  
n = I()

print(n // 2 + n % 2)

Solution (Python):

import collections
import math


class Solution:
    def solve(self, N):
        return math.ceil(N/2)


sol = Solution()

n = int(input().strip())
print(sol.solve(n))

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

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

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

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

Solution (Python):
import sys
def input(): return sys.stdin.readline().rstrip()
sys.setrecursionlimit(10 ** 7)

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

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

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

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

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

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

if __name__ == "__main__":
    main()

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

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

Solution (Python):
import math

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

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

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

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

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

Solution (Python):
from math import ceil

N = int(input());

print(ceil(N / 2))

Solution (Python):
import os

n = int(input())

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

Solution (Python):
import os

n = int(input())

if 1 <= n and n <= 100 :
    if n % 2 == 0 :
        page = int(n/2)
    elif n % 2 == 1 :
        page = int(n/2) + 1
    print(int(page))

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

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

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

ans = N // 2

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

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

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

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

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

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

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

Solution (Python):
import math

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

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

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

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

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

print(answer)

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

Solution (Python):
import sys

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

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

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

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

Solution (Python):


input = raw_input()
n = int(input)

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

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

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

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

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

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

if a % 2 == 0:
    print(b)
else:
    print(c)

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

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

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

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

Solution (Python):

import sys


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



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

if __name__ == '__main__':
    main()

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

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


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

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

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

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

a=int(input())

print(math.ceil(a/2))

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

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

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

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

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

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

if num % 2 == 1:
    num = num // 2 + 1
else:
    num = num // 2

print(num)

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

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

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

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

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

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

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

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

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

Solution (Python):
if __name__ == '__main__':
    r = input()
    r = int(r)
    result = int(r/2+0.5)
    print(result)

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

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

Solution (Python):


n = int(input())

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

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

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

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

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

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

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

ans = a // 2

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

print(ans)

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 7)
read = sys.stdin.buffer.read 
inp = sys.stdin.buffer.readline
def inpS(): return inp().rstrip().decode()
readlines = sys.stdin.buffer.readlines 

N = int(inp())

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

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

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

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

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

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

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

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

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 = input()
if N.isdigit() and int(N) >= 1 and  int(N) <= 100:
  if int(N) % 2 == 0:
    ans = int(N) / 2
  else:
    ans = (int(N) - 1) / 2 + 1
  print(int(ans))
else:
  print('error')

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

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

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

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

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

Solution (Python):
import sys

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

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

print((n+1)//2)

Solution (Python):


n = input()

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

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

Solution (Python):


pages = int(input())
mod = pages % 2

if mod == 1:
    papers = pages // 2 + 1
else:
    papers = pages // 2

print(papers)

Solution (Python):

from collections import defaultdict, deque
from heapq import heappush, heappop
from itertools import permutations
import sys
import math
import bisect


def LI(): return [int(x) for x in sys.stdin.readline().split()]


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


def LS(): return [list(x) for x in sys.stdin.readline().split()]


def S():
    res = list(sys.stdin.readline())
    if res[-1] == "\n":
        return res[:-1]
    return res


def IR(n):
    return [I() for i in range(n)]


def LIR(n):
    return [LI() for i in range(n)]


def SR(n):
    return [S() for i in range(n)]


def LSR(n):
    return [LS() for i in range(n)]


sys.setrecursionlimit(1000000)
mod = 1000000007


def main():
    
    N = I()
    print(math.ceil(N/2))
    return 0



if __name__ == "__main__":
    main()

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

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

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

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

result+=N//2

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

print(result)

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

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

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

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

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

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

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

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

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