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

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

Solution (Python):
def sep():
    return map(int,input().strip().split(" "))
def lis():
    return list(sep())

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

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

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

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

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

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

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

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

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

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

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

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

resolve()

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

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

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

div = -(-n // 2)

print(div)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math

a = int(input())

print(math.floor((a + 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(-(-N // 2))

Solution (Python):
import sys
from math import ceil as C, floor as F, sqrt, gcd as G
from collections import defaultdict as D, Counter as CNT
from functools import reduce as R
import heapq as HQ

class Heap:
  def __init__(self, data, reverse=False):
    self.reverse = -1 if reverse else 1
    self.data = [self.reverse * d for d in data]
    HQ.heapify(self.data)
  def push(self, x): return HQ.heappush(self.data, self.reverse * x)
  def pop(self): return self.reverse * HQ.heappop(self.data) 

ALP = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'
alp = 'abcdefghijklmnopqrstuvwxyz'
def _X(): return sys.stdin.readline().rstrip().split(' ')
def _S(ss): return tuple(ss) if len(ss) > 1 else ss[0]
def S(): return _S(_X())
def Ss(): return list(S())
def _I(ss): return tuple([int(s) for s in ss]) if isinstance(ss, tuple) else int(ss)
def I(): return _I(S())
def _Is(ss): return list(ss) if isinstance(ss, tuple) else [ss]
def Is(): return _Is(I())

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

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

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

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

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

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

Solution (Python):
from math import ceil

n = int(input())

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

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

print(N//2 + N % 2)

Solution (Python):
n=int(input())
print([n//2+1,n//2][n%2==0])

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

print((n + 1) // 2)

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

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

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

a = n // 2
b = n % 2

print(a+b)

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

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

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


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

    print(math.ceil(n / 2))


if __name__ == '__main__':
    main()

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

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

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

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

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

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

print((x+1)//2)

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

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

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

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

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






print(math.ceil(s/2))

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

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

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

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

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

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

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

if __name__ == "__main__":
    main()

Solution (Python):
import bisect, collections, copy, heapq, itertools, math, string
import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return map(int, sys.stdin.readline().rstrip().split())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

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

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

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

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

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

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

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

Solution (Python):
import sys
n = int(sys.stdin.readline().rstrip("\n"))
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())
from math import ceil
print(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())
print(-(-N // 2))

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

ans = n//2+n%2

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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


main()

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

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

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

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

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

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



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


if __name__ == "__main__":
    main()

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

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

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

a = (N + 2 - 1) // 2
print(a)

Solution (Python):


N = int(input())

page = int((N - 1 + 2) / 2)
print(page)

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

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

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

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

Solution (Python):

n=int(input())

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

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

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

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

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

print(int(round(n)))

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

print((N+1)//2)

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

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

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

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

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

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

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

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

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

if '__main__' == __name__:
    resolve()

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

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

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

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

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

Solution (Python):

n = int(input())
x = n // 2
y = n % 2
print(x + y)

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

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

print(m//2+m%2)

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

Solution (Python):

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


if __name__ == "__main__":
    main()

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

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

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

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

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

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

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

Solution (Python):
import math
n = int(input())
if n % 2 == 0:
    print(int(n / 2))
elif n % 2 == 1:
    print(math.ceil(n / 2))

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

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

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

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

Solution (Python):

N = int(input())
ans = N // 2 + min(1, N % 2)
print(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):
import sys
N = int(sys.stdin.buffer.read())
print(-(-N // 2))

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

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

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

if __name__ == "__main__":
    solve()

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

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

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

Solution (Python):
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
from fractions import gcd
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

n = inp()

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

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

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

Solution (Python):
import numpy as np
n = int(input())
print(int(np.ceil(n / 2)))

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

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

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

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

Solution (Python):
N=input()

N=int(N)

q1, mod = divmod(N,2)

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

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

Solution (Python):

from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    N = int(input())
    print(ceil(N, 2))


def main():
    solve()


if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
import math
print(math.ceil(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())

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

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

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

Solution (Python):


import math

def main():

    N = int(input())

    ans = math.ceil(N / 2)

    print(ans)


if __name__ == "__main__":
    main()

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

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

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

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

print((n + 1) // 2)

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

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

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

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

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

Solution (Python):


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

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

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

import math

print(math.ceil(N / 2))

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

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

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

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

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

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

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

Solution (Python):


from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


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


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    N = int(next(tokens))  
    print(f'{solve(N)}')


if __name__ == '__main__':
    main()

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

print(ans)

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

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

s=n//2
a=n%2

if a==1:
  print(s+1)
else:
  print(s)

Solution (Python):





n = int(input())

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

Solution (Python):












































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    N = int(lines[0])
    
    
    
    
    
    
    
    
    

    result = -(N//(-2))

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['5']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['2']
        lines_export = [1]
    if pattern == 3:
        lines_input = ['100']
        lines_export = [50]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

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

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)

readline = sys.stdin.buffer.readline
def readstr():return readline().rstrip().decode()
def readstrs():return list(readline().decode().split())
def readint():return int(readline())
def readints():return list(map(int,readline().split()))
def printrows(x):print('\n'.join(map(str,x)))
def printline(x):print(' '.join(map(str,x)))

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

Solution (Python):
def main():
    n = int(input())
    div, mod = divmod(n, 2)
    if mod != 0:
        print(div + 1)
    else:
        print(div)


if __name__ == '__main__':
    main()

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

Solution (Python):
def duplex_printing(all_pages):
    
    all_papers = (all_pages + 1) // 2
    
    return all_papers


N = int(input())

result = duplex_printing(N)

print(result)

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

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

if not ( 1 <= N <= 100 ): sys.exit()

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

Solution (Python):
import sys
from math import ceil


def main():
    input = sys.stdin.buffer.readline
    n = int(input())
    print(ceil(n / 2))


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):

import sys
import os
if sys.platform=="darwin":
	base = os.path.dirname(os.path.abspath(__file__))
	name = os.path.normpath(os.path.join(base, '../atcoder/input.txt'))
	sys.stdin = open(name)

from math import ceil

n = int(input())

print(ceil(n/2))

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

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

if N&0b1:
    ans=N//2+1
else:
    ans=N//2

print(ans)

Solution (Python):
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def s(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

n=k()
print(math.ceil(n/2))

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

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

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

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

Solution (Python):

import collections as cl
import math
import sys


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


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


main()

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

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

import collections as cl
import math
import sys


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


def MI():
    return map(int, sys.stdin.readline().split())


def LI():
    return list(map(int, sys.stdin.readline().split()))


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


main()

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

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

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

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

p = n % 2 + n // 2

print(p)

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

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

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

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

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

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

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

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

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