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 sys


def solve(N: int):
    print((N-1)//2+1)
    return



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

if __name__ == '__main__':
    main()

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

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

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

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

Solution (Python):
import math


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


if __name__ == "__main__":
    main()

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

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

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

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

Solution (Python):

n = int(input())

s= n//(2)
sn = n%(2)

print(s+sn)

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

print(N//2 + N%2)

Solution (Python):

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

Solution (Python):
def q1():
    """ A - Duplex Printing
    高橋君は、全Nページから成る書類を両面印刷します。
    両面印刷では、1枚の紙に2ページ分のデータを印刷することが出来ます。
    最小で何枚の紙が必要か求めてください。
    """
    N = int(input())
    d,m = divmod(N,2)
    print(d+m)


if __name__ == '__main__':
    q1()

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

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

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

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

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

print((n + 1) // 2)

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

Solution (Python):
import math

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

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

Solution (Python):


print(int(input())+1>>1)

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

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

Solution (Python):
import math

S = int(input())

if S %2 ==0:
    a =S/2
else:
    a =math.ceil(S/2)
    
print(int(a))

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

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

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

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

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

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

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

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

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

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

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

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

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

Solution (Python):
import itertools
import fractions
def main():
  n = int(input())
  print(n//2 + n%2)
  
if __name__ == '__main__':
  main()

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 == 1:
    ans = n//2 + 1
else:
    ans = n//2

print(ans)

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


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

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

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

Solution (Python):
import sys
N = int(sys.stdin.readline())
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))

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

Solution (Python):
import sys

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

def main():
    print((n + 1) // 2)

if __name__ ==  '__main__':
    main()

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

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

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

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

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

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

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

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

x = n // 2
y = n % 2

print(x+y)

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

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

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

Solution (Python):

import math


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


if __name__ == '__main__':
    main()

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

paper = (n // 2) + (n % 2)

print(paper)

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

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

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

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

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

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

Solution (Python):


import sys
import math


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

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

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

Solution (Python):
import math

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

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

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

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

print((N+1) // 2)

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

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

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

Solution (Python):
from decimal import Decimal, ROUND_HALF_UP

N = Decimal(input())
sheets = N / 2
result = sheets.quantize(Decimal('0'), rounding=ROUND_HALF_UP)

print(result)

Solution (Python):
import math
N = int(input())
sheets = N / 2

print(math.ceil(sheets))

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

Solution (Python):


N = int(input())

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

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

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

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

Solution (Python):

N = int(input())

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

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

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

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

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

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

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

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):
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())
import math
if N%2 == 0:
    print(round(N/2))
else:
    a = math.floor(N/2)+1
    print(a)

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

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

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

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

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

Solution (Python):


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

print(-(-n//2))

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

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

p = n // 2 

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

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

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

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

Solution (Python):
n = int(input())
print("{}".format(-(-n//2)))

Solution (Python):
import math

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

s = n//2
t = n% 2

if t ==1:
    print(s+1)
if t ==0:
    print(s)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
print(int(int(input().rstrip()) / 2+.9))

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

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

Solution (Python):
def main():

    N = int(input())
    return (N+1) // 2


if __name__ == '__main__':
    print(main())

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

Solution (Python):
import math

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

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

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

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

Solution (Python):
import math
N = float(input())

print(math.ceil(N/2))

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

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

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

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

ans = (N + 1) // 2

print(ans)

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

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

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

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

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

Solution (Python):
import math

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

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

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

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

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

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

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

print(N // 2 + N % 2)

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

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

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

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

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

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

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

print((n + 1) // 2)

Solution (Python):
n = int(input())
x, y = divmod(n, 2)
ans = x + y
print(ans)

Solution (Python):
import math

n = int(input())

print(math.ceil(n/2))

Solution (Python):
import sys
import math
from io import StringIO
import unittest

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

Solution (Python):
def cal(a):
    ans=a/2
    if n%2==0:
        b=int(ans)
        return b
    else :
        ans+=0.5
        b=int(ans)
        return b

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

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

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

print(math.ceil(N/2))

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

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

Solution (Python):
user_input = int(input())
if 1 <= user_input <= 100:
    check = user_input % 2
    if check == 0:
        print(user_input//2)
    else:
        print(user_input//2 + check)

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

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

Solution (Python):

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

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

Solution (Python):


n = int(input())
ans = n // 2 + n % 2
print("{}".format(ans))

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

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

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

Solution (Python):




def main():
    n = int(input().strip())
    print(round((n + 0.5) / 2))

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

print((N+1)//2)

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

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

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

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

print((n+1)//2)

Solution (Python):



n = int(input())

print((n + 1) // 2)

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

Solution (Python):

n = int(input())
if n % 2 == 0:
    print(n//2)
else:
    print(-(-n//2))

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

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

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

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

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

Solution (Python):
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, acos, atan, asin
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
def input(): return sys.stdin.readline().strip()
def STR(): return input()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
sys.setrecursionlimit(10 ** 9)
inf = sys.maxsize
mod = 10 ** 9 + 7

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

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

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

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

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

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

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

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

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

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

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

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

answer = math.ceil(N / 2)

print(answer)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  
nl = lambda: list(map(int, stdin.readline().split()))

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

Solution (Python):
import sys
import os


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

    A = int(sys.stdin.buffer.readline().rstrip())
    print(A//2 if A%2 == 0 else A//2 + 1)


if __name__ == '__main__':
    main()

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

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

print(int(ans))

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

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

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

print((n + 1) // 2)

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

    print((n + 1) // 2)


if __name__ == '__main__':
    main()

Solution (Python):


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

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

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

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

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

print(-(-N // 2))

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

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

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

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

Solution (Python):
import sys

x = sys.stdin.readline()
x = int((int(x)+1)/2)
print(x)

sys.stdout.flush()

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

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

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

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

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

n = int(input())

print(math.floor((n+1)/2))

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

print(n//2 + n%2)

Solution (Python):

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


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


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


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


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


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


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


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


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


sys.setrecursionlimit(1000000)
mod = 1000000007


def solve():
    n = I()
    if n % 2 == 0:
        print(n//2)
    else:
        print(n//2 + 1)
    return



if __name__ == "__main__":
    solve()

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

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

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

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


main()

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


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

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

N = int(input())

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

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

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

if __name__ == "__main__":
    solve()

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

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

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

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

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

Solution (Python):
import sys

def main():
    line = sys.stdin.readline().rstrip('\n')
    N = int(line)
    if (N % 2 == 0):
        print(N/2)
    else:
         print((N/2) + 1)

main()

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