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

ans = math.ceil(N / 2.0)
print(ans)

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

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

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

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

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

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

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

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

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

ans = -(-N//2)

print(ans)

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


print((n+1) // 2)

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

Solution (Python):
import math

if __name__ == '__main__':

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

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

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

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

print(N//2 + N%2)

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
N = int(input())
a = 0
b = 0

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

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

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

div, mod = divmod(n, 2)
print(div+mod)

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!=0))

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

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

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

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
input = sys.stdin.readline

n = int(input())

print((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):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


def main():
    N = int(readline())
    
    print((N+1) // 2)
    
    return


if __name__ == '__main__':
    main()

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

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

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

amari=n%2

if amari==0:
    print(int(n/2))

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

Solution (Python):
import math

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

print(result)

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

print(N // 2 + N % 2)

Solution (Python):
print(int(input())+1>>1)

Solution (Python):
n = int(input())
a,b = divmod(n,2)
print(a+b)

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

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

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

Solution (Python):

import sys, re
from decimal import *
from collections import deque, defaultdict, Counter, OrderedDict
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, floor, trunc, log
from heapq import heappush, heappop, heapify, nlargest, nsmallest
def STR(): return list(input())
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def list2d(a, b, c): return [[c] * b for i in range(a)]
def sortListWithIndex(listOfTuples, idx):   return (sorted(listOfTuples, key=lambda x: x[idx]))
def sortDictWithVal(passedDic):
    temp = sorted(passedDic.items(), key=lambda kv: (kv[1], kv[0]))
    toret = {}
    for tup in temp:
        toret[tup[0]] = tup[1]
    return toret
def sortDictWithKey(passedDic):
    return dict(OrderedDict(sorted(passedDic.items())))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

n = INT()

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

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

Solution (Python):




import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right
from heapq import heapify, heappop, heappush
from math import floor, ceil,pi,factorial
from operator import itemgetter
def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]
def SI(): return input().rstrip()
def printns(x): print('\n'.join(x))
def printni(x): print('\n'.join(list(map(str,x))))
inf = 10**17
mod = 10**9 + 7

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

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

Solution (Python):



from fractions import gcd
from itertools import combinations,permutations,accumulate 

from collections import deque,defaultdict,Counter
import decimal
import re











import sys
sys.setrecursionlimit(10000000)
mod = 10**9 + 7

def readInts():
  return list(map(int,input().split()))
def I():
  return int(input())
import math
print(math.ceil(I()/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+1)//2)

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

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

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

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

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

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

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

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

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

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

print(x)

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

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

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

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

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


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

Solution (Python):

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

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

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

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

ans = N // 2

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

print(ans)

Solution (Python):
import math

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

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

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

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

print(ans)

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

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

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

Solution (Python):
import itertools
import functools
import math
from collections import Counter
from itertools import combinations


N=int(input())

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

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

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

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

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

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

Solution (Python):
import numpy as np
import scipy.sparse as sps
import scipy.misc as spm
import collections as col
import functools as func
import itertools as ite
import fractions as frac
import math as ma
from math import cos,sin,tan,sqrt
import cmath as cma
import copy as cp
import sys
import re
import bisect as bs
sys.setrecursionlimit(10**7)
EPS = sys.float_info.epsilon
PI = np.pi; EXP = np.e; INF = np.inf
MOD = 10**9 + 7

def sinput(): return sys.stdin.readline().strip()
def iinput(): return int(sinput())
def imap(): return map(int, sinput().split())
def fmap(): return map(float, sinput().split())
def iarr(n=0):
    if n: return [0 for _ in range(n)]
    else: return list(imap())
def farr(): return list(fmap())
def sarr(n=0):
    if n: return ["" for _ in range(n)]
    else: return sinput().split()
def adj(n): return [[] for _ in range(n)]

n = iinput()
ans = (n + 1)//2
print(ans)

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

Solution (Python):
import sys

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

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

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

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

import math

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

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

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

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

print(n//2+n%2)

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

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

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

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

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

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

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

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

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

Solution (Python):

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

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

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

Solution (Python):
import math

N = int(input())

print(math.ceil(N/2))

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

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


if __name__ == "__main__":
    main()

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



def main():
    N = int(input().strip())
    return (N//2) + N % 2


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

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

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

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

print(N//2+N%2)

Solution (Python):

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

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

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

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

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

print(math.ceil(n/2))

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

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

Solution (Python):

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

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

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

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


if __name__ == '__main__':
    solve()

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

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

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

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

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

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

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

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

print(-(-n//2))

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

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

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

num = int(n / 2)
if n % 2 == 1:
  num += 1

print(num)

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

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

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

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

Solution (Python):
import math

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

Solution (Python):

n = int(open(0).read())
print(n//2+(n%2!=0))

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import math

N=int(input())

print(math.ceil(N/2))

Solution (Python):
import sys

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


def solve():
    N = int(input())
    ans = int(N / 2 + 0.6)
    print(ans)


if __name__ == '__main__':
    solve()

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

print(math.ceil(a/2))

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

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

x, y = divmod(n, 2)

print(x + y)

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

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

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):
import sys
input = lambda: sys.stdin.readline().rstrip()

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

n = int(input())

print(math.ceil(n / 2))

Solution (Python):
import math


def main():

    N = int(input())

    N = math.ceil(N / 2)

    print(N)


if __name__ == "__main__":
    main()

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

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

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

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

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

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):
from decimal import Decimal, ROUND_HALF_UP

N = int(input())

result = Decimal(str(N/2)).quantize(Decimal('0'), rounding=ROUND_HALF_UP)
print(result)

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

main()

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

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

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

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

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

Solution (Python):
N = input()

N = int(N)

ans = (N+1) // 2


print(ans)

Solution (Python):
N = input()

N = int(N)

ans = (N+1)//2


print(ans)

Solution (Python):
N = input()

N = int(N)

ans = (N+1) // 2


print(ans)

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

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

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

r = n // 2
a = n % 2
print(r + a)

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

if n%2 == 0:
  min = n/2
else:
  min = n//2 + 1

print(int(min))

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

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

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

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

print((N+1) // 2)

Solution (Python):
import math

a=int(input())

print(math.ceil(a/2))

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

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

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

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

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

    ans = n // 2 + n % 2
    print(ans)
resolve()

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

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

main()

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

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

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

ans = N//2 + N % 2

print(ans)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
from math import ceil

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