peterverebics/CodeNet_Python_118 huggingface dataset:
import math
s = int(input())
print(math.ceil(s / 2))
# coding: utf-8
n = int(input())
if n % 2 == 0:
    print(int(n/2))
else:
    print(int((n+1)/2))
n = int(input())
if n%2 == 1:
    print((n+1)//2)
else:
    print(n//2)
N = int(input())
if N % 2 == 0:
  print(N//2)
else:
  print((N//2)+1)
import math
n = int(input(""))
print(int(math.ceil(n/2)))
ans = 0
N = int(input())

if(N%2):
    ans = N//2 +1
else:
    ans = N//2
print(ans)
n=int(input())
if n%2==0:
    print(n//2)
else:
    print(n//2+1)
a = int(input())
n = a // 2
if 2*n == a:
    print(n)
else:
    print(n + 1)
import numpy as np
import math as m

def main(**kwargs):
    r = int(n / 2 + 0.5)
    return r

if __name__ == "__main__":
    cin = np.array(input().split(" ")).astype("int")
    n, *_ = cin

    cout = main(n=n)
    print(cout)
N = int(input())

if N%2 == 0:
	print(int(N/2))
else:
	print(int(N/2) + 1)
N=int(input())
if(N%2==1):
  print(N//2+1)
else:
  print(N//2)
n = int(input())
if n%2 == 0:
    print(n//2)
else:
    print(n//2+1)
n = input()
n = int(n)
if n % 2 == 0:
    print(int(n/2))
else:
    print(int((n/2)+1))
import sys
import math
input = sys.stdin.readline

#N, M, L  = (int(i) for i in input().split())
#ABC = [[int(i) for i in input().split()] for i in range(N)]
N = int(input())

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

ans = (N + 1) // 2
print(ans)
n = int(input())
if n%2 == 0:
    print(int(n/2))
else:
    print(int(n/2)+1)
import sys
import math
input = sys.stdin.readline
n=int(input())
print(math.ceil(n/2))
N = int(input())
       
if N%2 == 0:
  print(N//2)
else:
  print(N//2 +1)
import math
n = int(input())
print(math.floor((n+1)/2))
N = int(input())
Num = int(N/2)
perseNum = N%2
if perseNum != 0:
    print(Num+perseNum)
else:
    print(Num)
N = int(input())
if N % 2 == 0:
    N /=2
    print(int(N))
else:
    N /=2
    N+=1
    N = int(N)
    print(N)
n = int(input())

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

paper = page // 2
a = page % 2
if a != 0:
  paper += 1

print(paper)
import math

X = int(input())
Y = X/2
print(math.ceil(Y))
N = int(input())
if N % 2 == 0:
    ans = N // 2
else:
    ans = N // 2 + 1
print(ans)
n = int(input())

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

if int(x) % 2:
    print(int(int(x)/2+0.5))
else:
    print(int(int(x)/2))
n = int(input())
if n % 2 == 0:
  print(n // 2)
else:
  print(n // 2 + 1)
N = int(input())

if N%2==0:
  print(N//2)
else:
  print(N//2+1)
N = int(input())
if N%2 == 0:
    print(int(N/2))
else:
    print(int(N//2) + 1)
def main():
    N = int(input())
    print((N // 2) + (N % 2))
main()
n=int(input())
if n&1:
    print((n+1)//2)
else:
    print(n//2)
N = int(input())
if N % 2 == 1:
  ans = int(N / 2) + 1
else:
  ans = int(N / 2)
  
print(ans)
import sys
from collections import *
import heapq
import math
import bisect
from itertools import permutations,accumulate,combinations,product
from fractions import gcd
def input():
    return sys.stdin.readline()[:-1]
def ruiseki(lst):
    return [0]+list(accumulate(lst))
mod=pow(10,9)+7

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

def main():
    tmp = input().replace('\n','').split(' ')[0]
    res = int(tmp)//2 + int(tmp)%2
    print(res)
if __name__ == '__main__':
    input = sys.stdin.readline
    main()
# abc 157
import sys
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
read = sys.stdin.buffer.read
sys.setrecursionlimit(10 ** 7)

N = int(readline().strip())

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

print(answer)
N = int(input())
if N%2 ==1:
    N += 1
print(int(N/2))
import math
n = int(input())

res = math.ceil(n/2)
print(res)
N = int(input())
print(N // 2) if N % 2 == 0 else print(N // 2 + 1)
N=int(input())

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

if N % 2 == 0:
    print(S)
elif N % 2 == 1:
    print(S+1)
N=int(input())
M=N/2+N%2
print(int(M))
a = int(input())
if a % 2 == 0:
    print(a // 2)
else:
    print(a // 2 + 1)
N = int(input())
 
print(N//2 + N % 2)
import itertools
import fractions
def main():
  n = int(input())
  print(n//2 + n%2)
  
if __name__ == '__main__':
  main()
import math
pageNum = int(input())
print(int(math.ceil(pageNum/2)))
N = int(input())

if N % 2 == 0:
    print(N//2)
else:
    print(N//2+1)
n = int(input())
ans = (n + 1) // 2
print(ans)
import math 
n = int(input())
print(math.ceil(n/2))
n=int(input())
if n%2==0:
  print(n//2)
else:
  print(n//2+1)
# cook your dish here
import math
x = int(input())
print (math.ceil(x/2))
n = int(input())
import math
print(math.ceil(n / 2))
n = int(input())
if n%2==0:
  print(n//2)
else:
  print(n//2+1)
N = int(input())
ans = (N-1)//2 + 1
print(int(ans))
n = int(input())
if n%2 == 0:
    print(n//2)
else:
    print(n//2 + 1)
a=int(input())
if a%2==0:
    print(int(a/2))
else:
    print(int((a+1)/2))
n = int(input())
if (n%2 == 1):
  n = n + 1
print(int(n/2))
import math
n = int(input())
ans = math.ceil(n/2)
print(ans)
N = int(input())

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

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

if N % 2 == 1:
  print(int(N/2+1))
elif N % 2 == 0:
  print(int(N/2))
import math
from sys import stdin


def get_result(data):
    N = data[0]
    return math.ceil(N / 2.0)

if __name__ == '__main__':
    data = list(map(int, stdin.readline().split(' ')))
    result = get_result(data)
    print(result)
import math
N=input()
N=int(N)
NN=N+1
print(math.floor(NN/2))
N = input()
N = int(N)
if N%2 ==0:
    amari = 0
else:
    amari = 1

N  = N/2
N = int(N)

print(N+ amari)
# coding: utf-8
import sys

sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))

N = ir()
answer = (N+1) // 2
print(answer)
n = int(input())
print(n // 2 if n % 2 == 0 else n // 2 + 1)
# ABC157A

n = int(input())
print((n + 1) // 2)
N = int(input())
q, r = divmod(N, 2)
print(q + r)
n = int(input())
if n % 2:
    print(n // 2 + 1)
else:
    print(n // 2)
N=int(input())
if N%2==1:
  print(N//2+1)
else:
  print(N//2)
import math

N = int(input())
num = math.ceil(N/2)
print(num)
N = int(input())
if N % 2 == 0:
  print(N//2)
else:
  print(N//2+1)
import sys
from math import floor, ceil
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
def input(): return sys.stdin.readline().strip()

n = int(input())
print(int(ceil(n/2)))
N = int(input())
if N%2 == 1:
    print(N//2+1)
else:
    print(N//2)
n = int(input())
if n % 2 == 1:
  print(n//2 + 1)
else:
  print(n//2)
N = int(input())
if N % 2 == 0:
  n = N / 2
else:
  n = int((N+1) / 2)
print(int(n))
n = int(input())
print((n // 2) + (n % 2) )
import math
N = int(input())
print(math.ceil(N / 2))
N= [int(i) for i in input().split()][0]
print((N+1)//2)
n=int(input()) 

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

n = int(input())

n = math.ceil(n/2)

print(n)
N = int(input())

import math

print(math.ceil(N / 2))
n = int(input())
pages = 0
if n%2 == 1:
    pages += 1
pages += n//2
print(pages)
N = int(input())
num = N + (N % 2)
print(int(num/2))
N = int(input())
 
if N % 2 == 0:
  print(int(N / 2))
else:
  print(int(N // 2 + 1))
#coding:utf-8
import sys,os
sys.setrecursionlimit(10**6)
write = sys.stdout.write
dbg = (lambda *something: print(*something)) if 'TERM_PROGRAM' in os.environ else lambda *x: 0
def main(given=sys.stdin.readline):
    input = lambda: given().rstrip()
    LMIIS = lambda: list(map(int,input().split()))
    II = lambda: int(input())
    XLMIIS = lambda x: [LMIIS() for _ in range(x)]
    YN = lambda c : print('Yes') if c else print('No')
    MOD = 10**9+7

    N = II()
    from math import ceil
    print(ceil(N/2))
    

if __name__ == '__main__':
    main()
N = int(input())

if N % 2 == 0:
    print(N // 2)
else:
    print(N // 2 + 1)
n = int(input())
print(n // 2 if n % 2 == 0 else 1 + (n // 2))
import math
n = int(input())
print(math.ceil(n / 2))
from math import ceil

N = int(input())
print(ceil(N / 2))
# encoding:utf-8
import copy
import random
import bisect #bisect_left　これで二部探索の大小検索が行える
import fractions #最小公倍数などはこっち
import math
import sys
import collections

mod = 10**9+7
sys.setrecursionlimit(mod) # 再帰回数上限はでdefault1000

d = collections.deque()
def LI(): return list(map(int, sys.stdin.readline().split()))

N = int(input())
print(math.ceil(N/2))
# coding: utf-8

n = int(input())
print((n + 1) // 2)
N = int(input())
ans = -(-N // 2)
print(ans)
import math
N = int(input())


print(math.ceil(N / 2))
# -*- coding: utf-8 -*-
import sys
import math
#import collections
#sys.setrecursionlimit(100000)

n=int(input())
#tmp = input().split()
#hoge = list(map(lambda a: int(a), tmp))

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

ans = n // 2

if n % 2 == 0:
    print(ans)
else:
    print(ans+1)
#!/usr/bin/python3

n = int(input())

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

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

elif N%2==1:
    print(int(int(N/2)+1))
#ABC157-A
n=int(input())
if n%2==0:
  print(int(n/2))
else:
  print(int(n/2)+1)
inputs = list(map(int, (input().split())))

a = inputs[0]

b = a % 2
c = int(a / 2)

print(b + c)
n = int(input())
print(int(n/2) if n%2 == 0 else n//2+1)
k = int(input())

q = k // 2
mod = k % 2

if mod != 0:
  ans = q + 1
else:
  ans = q

print(ans)
N = int(input())
A = N / 2
A = int(A)
B = (N + 1) / 2
B = int(B)
if N % 2 == 0:
  print(A)
else:
  print(B)
# coding: utf-8
import math
N = int(input())
ans = math.ceil(N / 2)
print(ans)
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10 ** 7)

from math import ceil

n = int(readline())
print(ceil(n / 2))
n = int(input()) / 2 + 0.01

print(int(round(n)))
N = int(input())

ans = N // 2
if N % 2 != 0:
    ans += 1

print(ans)
from sys import stdin


def main():
    input = lambda: stdin.readline()[:-1]
    N = int(input())
    print((N + 1) // 2)


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

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

    q, mod = divmod(N, 2)

    if mod != 0:
      print(q+1)
    else:
      print(q)

if __name__ == "__main__":
    main()
n=int(input())

ans=int(n/2)

if n%2==0:
    print(ans)
else:
    print(ans+1)
import math
n = int(input())

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

if N % 2 == 0:
    print(N//2)
else :
    print((N+1)//2)
import sys
readline = sys.stdin.buffer.readline

n = int(readline())

if n%2 == 0:
    print(n//2)
else:
    print(n//2+1)
# coding:utf-8

import sys
import math
import time
#import numpy as np
import collections
from collections import deque
import queue
import copy
import bisect


def dfs(s, prev, pre):
  val[s] += Ope[s] + prev
  for i in G[s]:
    if(i == pre):
      continue
    dfs(i, val[s], s)

#X = str(input()).split()
#a = [int(x) for x in input().split()]
#sys.setrecursionlimit(10**7)
#N, Q = map(int, input().split())
N = int(input())

if(N%2==0):
  print(int(N/2))
else:
  print(int(math.floor(N/2)+1))
import sys

# S = input()
# N, M = map(int, input().split())
# nums = list(map(int, input().split()))
# nums_2d = [list(map(int, input().split())) for _ in range(N)]


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

    print((N+1)//2)


if __name__ == '__main__':
    main()
N = int(input())
q = N//2
mod = N%2
if mod >0:
    print(q+1)
else:
    print(q)
#import math
#import bisect
#import numpy as np
#import itertools
#import copy
import sys

ipti = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)

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

if __name__ == '__main__':
    main()
#!/usr/bin/env python

from sys import stdin, stderr

def main():
   N = int(stdin.readline())
   res = (N+1)//2
   print(res)

   return 0

if __name__ == '__main__': main()
n = int(input())

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


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


if __name__ == '__main__':
    main()
N = int(input())
if N % 2 == 1:
    N = N+1
N = int(N / 2)
print(N)
N = int(input())
ans = N//2 + N%2
print(ans)
n = int(input())
if n % 2 == 0:
    print(n // 2)
else:
    print(n // 2 + 1)
a = int(input())
if(a%2 == 1):
  print((a+1)//2)
if(a%2 == 0):
  print(a//2)
def main():
    #from sys import stdin, setrecursionlimit
    #setrecursionlimit(10**9)
    #r = input()
    #n = int(input())
    #a, b = map(int, input().split())
    #s, y = input().split()
    #a = input().split()
    #a = [int(input()) for i in range(n)]
    #a = list(map(int, input().split()))
    #a = [list(map(int, input().split())) for i in range(n)]
    #a = [int(s) - 1 for s in input().split()]
    #l=[int(input()) for _ in range(int(input()))]
    #res = 0
    n = int(input())
    print((n+1)//2)

if __name__ == '__main__':
    main()
N=input()
N=int(N)

ans=0
#print(N)

if N>=1 and N<=100 :
  ans =N/2
  if N%2==1:
    ans = ans+1
    
print(int(ans))
N=int(input())

if N%2==0:
	print(int(N/2))
if N%2==1:
	print(int(N/2+1))
num = int(input())
res = int(num / 2)
if num % 2 == 1:
    print(res + 1)
else:
    print(res)
# import numpy as np
# import math
# import copy
# from collections import deque
import sys
input = sys.stdin.readline
# sys.setrecursionlimit(10000)


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

    if N % 2 == 0:
        res = N // 2
    else:
        res = N // 2 + 1

    print(res)



main()
import os

n = int(input())

if n % 2 == 0 :
    page = int(n/2)
elif n % 2 == 1 :
    page = int(n/2) + 1
print(int(page))
N=int(input())
answer=N/2
if N%2==1:
  answer=N//2+1

  
print(int(answer))
n = int(input())
x = n//2
n =n%2 
print(x+n)
N = int(input())
print(int(N/2) if N % 2 == 0 else int((N+1)/2))
n=int(input())

amari=n%2

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

else:
    print(int(n/2+1))
pages = int(input())
a = pages // 2
b = 1 if pages % 2 == 1 else 0
print(a + b)
import math
n = int(input())
if n % 2 == 0:
    print(int(n / 2))
elif n % 2 == 1:
    print(math.ceil(n / 2))
n = int(input())

if n % 2 == 0:
  ans = n // 2
else:
  ans = n // 2 + 1
  
print(ans)
N = int(input())
if N%2==0:
  print(int(N/2))
else:
  print(int(N/2)+1)
import sys
from math import ceil


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


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

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

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

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

if n%2==0:
    print(int(n/2))
if n%2==1:
    print(int((n+1)/2))
N=int(input())
import math
ans=math.ceil(N/2)
print(ans)
n = int(input())
if n % 2 == 0:
  print(n//2)
else:
  print(n // 2 + 1)
n = int(input())

if n % 2 == 0:
    print(n//2)
else:
    print(n//2+1)
#A
import math
n = int(input())
print(math.ceil(n / 2))
# -*- coding: utf-8 -*-
n = int(input())
if n%2 == 0:
    print(int(n/2))
else:
    print(int((n+1)/2))
N = int(input())
if N % 2 == 0:
    answer = N /2
else:
    answer = (N + 1) / 2

print(int(answer))
n = int(input())

if n % 2 == 0:
  print(int(n//2))
else:
  print(int(n//2 + 1))
# -*- coding: utf-8 -*-

N = int(input())

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

q = N // 2
m = N % 2
print(q + m)
import itertools
import functools
import math
from collections import Counter
from itertools import combinations


N=int(input())

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

print(n//2 + 1 if n % 2 else n //2)
N = int(input())
  
if N % 2 == 0:
  print(N // 2)
else:
  print(N//2 + 1)
# -*- coding: utf-8 -*-
N = int(input())
g = N // 2
k = ( N + 1 ) // 2
if N % 2 == 0:
    print(g)
else:
    print(k)
n = int(input())
if n % 2 == 0:print(n//2)
else: print(n//2 + 1)
# N = int(input())
# N = map(int,input().split())
# N = list(map(int,input().split()))

N = int(input())
print(((N-1)//2)+1)
n=int(input())
if n % 2 == 0:
    print(n//2)
else:
    print(n//2+1)
import sys,collections,math,random,fractions,bisect;sys.setrecursionlimit(10**7)
sr = sys.stdin.readline; P = print; P2 = lambda x: print(*x, sep="\n")
def I(i=0): t = [int(x)-i for x in sr().split()];return t
def S(): t = sr().split(); return t if len(t) > 1 else t[0]
L1,L2,L3,L4, = [],[],[],[]
 
a, = I()
print(math.ceil(a/2))
import sys
N = int(sys.stdin.buffer.read())
print(-(-N // 2))
n = int(input())
ans = n//2
if n%2 == 1:
  ans += 1
print(ans)
import math

pages = input()
count = int(pages)

if count %2 == 0 :
    print(count/2)
else :
    print((count + 1)/2)
N = int(input())
print(N//2 if N%2 == 0 else (N+1)//2)
# 157 A

n = int(input())

print((n//2) + (n%2))
import numpy as np

N=int(input())
#a = list(map(int, input().split()))
m = N%2 
if (m == 0):
    print(int(N/2))
else:
    print(int(N/2+1))
#for x in range(0,N,1):
N= int(input())
answer=N//2+ N%2
print(answer)
import math

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

ans=N//2
if(N % 2 >0):
    ans=ans+1
print(ans)
n=int(input())
 
if n%2==0:
  print(n//2)
else:
  print(n//2+1)
N = int(input())
if N%2==0:
    print("{}".format((N//2)))
else:
    print("{}".format((N//2)+1))
import math
def main():
    N = int(input())
    print(math.ceil(N/2))
    

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

n = int(input())

print(math.ceil(n / 2))
import math
page = int(input())
print(math.ceil(page / 2))
import numpy as np
n = int(input())
print(int(np.ceil(n / 2)))
N = int(input())
if N % 2 == 0:
    ans = int(N / 2)
else:
    ans = int(N / 2)+1
print(ans)
N = int(input())
if N%2 == 0:
  ans = int(N/2)
else:
  ans = int(N/2)+1
  
print(ans)
import sys
import math
def i():return int(sys.stdin.readline().replace("\n",""))
def i2():return map(int,sys.stdin.readline().replace("\n","").split())
def s():return str(sys.stdin.readline().replace("\n",""))
def l():return list(sys.stdin.readline().replace("\n",""))
def intl():return [int(k) for k in sys.stdin.readline().replace("\n","").split()]
def lx():return list(map(lambda x:int(x)*-1,sys.stdin.readline().replace("\n","").split()))
def t():return tuple(map(int,sys.stdin.readline().replace("\n","").split()))

if __name__ == "__main__":pass

n = i()
print(n//2 if n%2==0 else n//2+1)
n = int(input())
if n % 2 == 0:
  print(n // 2)
else:
  print((n+1) // 2)
if __name__ == '__main__':
    n = int(input())
    if n % 2 == 0:
        print(int(n / 2))
    else:
        print(int(n / 2 + 1))
def main():
    N = int(input())
    ans = N // 2 if N % 2 == 0 else (N // 2) + 1
    print(ans)


if __name__ == "__main__":
    main()
import math

n = int(input())

if n%2 == 0:
    print(n//2)
else:
    print(math.floor(n//2)+1)
# -*- coding: utf-8 -*-


def main():
    n = int(input())
    ans = n // 2

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

    print(ans)


if __name__ == '__main__':
    main()
n=int(input())
if n%2!=0:
  s=(n+1)//2
else:
  s=n//2
print(s)
n=int(input())
print(n//2 if n%2==0 else n//2+1)
temp = ((int(input()) + 2)-1)/2

print(int(temp))
import sys
import numpy as np

# input = sys.stdin.readline

n = int(input())

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

page = n // 2
page += n % 2

print(page)
n = int(input())
print(n//2 if n % 2 == 0 else (n+1)//2)
import itertools
import sys
import math
import numpy as np
from collections import deque
from itertools import combinations
from functools import reduce
from functools import lru_cache
sys.setrecursionlimit(10**9)

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

if __name__ == "__main__":
  main()
import sys
import math
import collections
n = int(input())
#n, a, b = map(int, input().split())
#s = input()
#x = list(map(int, input().split()))

print(math.ceil(n/2))
# ABC 157 A
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nms = lambda: map(str, input().split())
nl = lambda: list(map(int, input().split()))
n=int(input())
if n%2==1:
    print(n//2+1)
else:
    print(n//2)
N = int(input())
if N % 2 == 0:
  print(N // 2)
else:
  print(N // 2 + 1)
N = int(input())
a, b = divmod(N, 2)
print(a+b)
import sys

stdin = sys.stdin

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

n = ni()
print((n + 1) // 2)
N = int(input())
if N%2 == 0:
  print(N//2)
else:
  print((N//2)+1)
import math
if __name__ == '__main__':
    n = input()
    n = int(n)
    ans = math.ceil(n/2)
    print(ans)
n = int(input())


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

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

sec = (s+1) >> 1
print(sec)
s = list(map(int, input().split()))
if s[0]%2==1:
    print(int(s[0]/2)+1)
else:
    print(int(s[0]/2))
N=int(input())
if N % 2==0:
    print(int(N/2))
else:
    print(int(N/2+0.5))
N = int(input())
if N % 2 == 0:
  print(round(N/2))
else:
  print(round((N+1)/2))
n=int(input())

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

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

if n % 2:
    print(ans)
else:
    print(ans + 1)
n = int(input())
if n % 2 == 0:
    print(n/2)
else:
    print((n+1)/2)
N=input("")
N=int(N)
if 1<=N<=100:
  if N%2==0:
    N=N/2
    print(N)
  else:
    N=(N+1)/2
    print(N)
else:
  None
N=int(input())


if(N%2==0):
    print(N/2)
else:
    print(N//2+1)
N = int(input())
res = 0
if N % 2 == 0:
  res = N / 2
else:
  res = N // 2 + 1
  
print(res)
import sys
import math

for line in sys.stdin.readline():
    n = float(line.rstrip())
    ans = math.ceil(n / 2)
    print(ans, end="")
    break
N = int(input())
ans = N / 2
if type(ans) == int:
  print(ans)
else:
  print(int(ans)+1)
N = int(input())
if N % 2 == 1:
   print((N+1)/2)
else:
    print(N/2)
import math

N = int(input())

if N % 2 == 0:
    M = N/2
    print(M)
else:
    M = N/2 + 1
    print(math.floor(M))
N = int(input())
N = N / 2 + N % 2
print(N)
N = int(input())
if N%2 == 0:
    a = N/2
else:
    a = N//2+1

print(a)
N = int(input())

ans = N//2
ans = ans+1
print(ans)
a=int(input())
if a%2==0:
  print(a/2)
else:
  print((a+1)/2)
N=int(input())
if N%2==0:
	print(N/2)
else:
	print(N+1/2)
a = int(input())
b = a / 2
c = a % 2
if c == 1 :
    b = b + 0.5
print(b)
n = int(input())

if 1 <= n and n <= 100 :
    if type(n/2) == int :
        page = int(n/2)
    elif type(n/2) == float :
        page = int(n/2) + 1
    print(page)
N=int(input())
if N%2==0:
    print(N/2)
else:
    print((N-1)/2+1)