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



a = int(N / 2)

if N % 2 == 1:

    a +=1

print(a)

N = int(eval(input()))



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

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

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