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

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

print(math.ceil(n/2))

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



n = int(input())

solve()

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

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

Solution (Python):
page=int(input())
re=int((page/2.0)+0.5)
print(re)

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

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

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

def RD(): return sys.stdin.read()
def II(): return int(input())
def MI(): return map(int,input().split())
def LI(): return list(map(int,input().split()))
def TI(): return tuple(map(int,input().split()))


def main():
    N = II()
    p = -(-N // 2)
    print(p)




if __name__ == "__main__":
	main()

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

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

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

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

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

print(N//2+N%2)

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

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

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

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

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

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

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

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

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

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

Solution (Python):


N = int(input())

print(-(-N // 2))

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

Solution (Python):
import math

n = int(input())

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

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

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

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

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

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


if n%2 ==0:

    print(int(n/2))

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

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

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

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

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

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

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

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

print(n%2 + n//2)

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

Solution (Python):
n = int(input())
rem = n // 2
div = n % 2

if div == 0:
  print(rem)
else:
  print(rem+1)

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

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

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())
if n%2==1:
  n+=1
print("{0}".format(int(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((((-1)*n)//2)*(-1))

Solution (Python):
import math

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

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

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

print((N+1)// 2)

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

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

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

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

  print(b)

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 10**9 + 7

N = ri()

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

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

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

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

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

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

Solution (Python):

url = "https://atcoder.jp//contests/abc157/tasks/abc157_a"

def main():
    inp = int(input())
    a, b = divmod(inp, 2)
    print(a+b)


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

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

Solution (Python):
num =int(input())
ans = num//2
ans +=max(num%2,0)
print(ans)

Solution (Python):
from collections import deque, Counter as cnt
from collections import defaultdict as dd
from operator import itemgetter as ig
from bisect import bisect_right as bsr
from math import factorial, ceil, floor
import sys
sys.setrecursionlimit(1000000)


args = None
INF = float("inf")
MOD = int(1e9 + 7)


def input(*ps):
    if type(ps[0]) is list:
        return [input(*ps[0][:-1]) for _ in range(ps[0][-1])]
    elif len(ps) == 1:
        return ps[0](next(args))
    else:
        return [p(next(args)) for p in ps]


def nlist(n, v):
    if not n:
        return [] if type(v) is list else v
    return [nlist(n[1:], v) for _ in range(n[0])]


def yesno(v):
    print(["Yes", "No"][not v])



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


if __name__ == '__main__':
    args = iter(sys.stdin.read().split())
    main()

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

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

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

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

Solution (Python):


import sys



















def main():
    mod = 1000000007                  
    inf = float('inf')
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():  return int(input())
    def mi():  return map(int, input().split())
    def mi_0(): return map(lambda x: int(x)-1, input().split())
    def lmi(): return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():  return list(input())
    
    
    
    n = ii()
    print((n+1)//2)

if __name__ == "__main__":
    main()

Solution (Python):

def main():
    n = int(input())
    if n % 2 == 0:
        print(n//2)
    else:
        print(int(n//2) + 1)
            
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):
from sys import stdin
N=list(map(int,stdin.readline().strip().split()))[0]
print(N//2+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((n+1)//2)

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

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

print(N//2 + N%2)

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

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

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

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

ans = n//2 +n%2

print(ans)

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

if __name__ == '__main__':
  main()

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

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

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

ans = n // 2 + n % 2;

print(ans);

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

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

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

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

ans = N/2

if ans.is_integer():
    print(int(ans))
else:
    print(int(ans)+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):


def main():
    *N, = map(int, open(0).read().split())
    N = N[0]
    N = -(-N // 2)
    print(N)


main()

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

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

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

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

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

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

Solution (Python):
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

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

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

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

    print(n//2 + n%2)

main()

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

print(N // 2 + (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 accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

N = INT()

print(-(-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 accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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

N = INT()

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

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


if __name__ == "__main__":
    main()

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

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

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

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

from math import ceil

print(int(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):
from functools import reduce
from fractions import gcd
import math
import bisect
import itertools
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline
INF = float("inf")


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


if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

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

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

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

print(a//2 + a % 2)

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

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

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

print(-(-N//2))

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

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

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

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, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product, groupby
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
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()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

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

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

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

Solution (Python):
import os

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

if __name__ == "__main__":
    main()

Solution (Python):
n=int(input())
l=n//2
if n%2==0:
  print(str(l))

else:
  print(str(l+1))

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

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

Solution (Python):
from math import floor,ceil,sqrt,factorial,log
from collections import Counter, deque
def S(): return input()
def I(): return int(input())
def MS(): return map(str,input().split())
def MI(): return map(int,input().split())
def LLS(): return [list(map(str, l.split() )) for l in input()]
def LLI(): return [list(map(int, l.split() )) for l in input()]

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

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

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

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

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

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

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

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

Solution (Python):
import sys

input = sys.stdin.readline
sys.setrecursionlimit(10 ** 6)



def in_int():
    return (int(input()))


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


def in_str():
    s = input()
    return (list(s[:len(s) - 1]))


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


n = in_int()

print((n+1)//2)

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

ans = N//2 + N%2

print(ans)

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

ans = math.ceil(n / 2)

print(ans)

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

div = n//2
rest = n%2

ans = div + rest

print(ans)

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

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

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

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

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

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

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

import math

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

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

Solution (Python):
import math

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

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())
num = x // 2

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

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

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

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

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

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

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

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

Solution (Python):
import math

N = int(input())

number_of_pages = math.ceil(N / 2)

print(number_of_pages)

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

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

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

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())
c,d=divmod(n,2)
if d != 0:
  c+=1

print(c)

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

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

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

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

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

Solution (Python):
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    n = int(readline())
    print((n + 2 - 1) // 2)


if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

Solution (Python):

def main():
    import sys
    N = int(sys.stdin.readline())
    print(N//2 + N%2)


if __name__ == '__main__':
    main()

Solution (Python):

N =  int(input())

print(N//2+N%2)

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

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

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

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

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

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

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

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

Solution (Python):
answer = divmod(int(input()), 2)
print(answer[0]+answer[1])

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

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

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

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

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

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

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

print((p+1) // 2)

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

print(p // 2 + p % 2)

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

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

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

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

Solution (Python):
i = int(input())
ryou = i//2
kata = i%2
print(ryou+kata)

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

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

Solution (Python):

N = int(input())
if N % 2 ==0:
    print(N // 2) 
else:
    print(N // 2 +1) 
"""
N % 2は割ったときの余りを見る
"""

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

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

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

page = (N - N%2)/2 + N%2

print(int(page))

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

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

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

if N%2 == 1:
 ans = N//2 +1
else:
 ans = N//2

print(ans)

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

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

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

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