peterverebics/CodeNet_Python_118 huggingface dataset:
from collections import defaultdict,deque
from sys import stdin,setrecursionlimit
import heapq,bisect,math,itertools,string,queue,datetime,copy
setrecursionlimit(10**8)
INF = float('inf')
mod = 10**9+7
eps = 10**-7
def inpl(): return list(map(int, stdin.readline().split()))

a,v = inpl()
b,w = inpl()
t = int(input())

if a+v*t >= b+w*t:
    print('YES')
else:
    print('NO')
a,v = map(int,input().split())
b,w=map(int,input().split())
t=int(input())

x=b-a
y=v-w

if y*t>=x:
    print("YES")
else:
    print("NO")
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if W>=V:
  print('No')
else:
  key=abs(A-B)
  if key+W*T>V*T:
    print('No')
  else:
    print('Yes')
[a,v] = [int(i) for i in input().split()]
[b,w] = [int(i) for i in input().split()]
t = int(input())
if w >= v:
    print("NO")
else:
    if  abs(a-b)/(w-v)  <= t:
        print("YES")
    else:
        print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V-W <= 0:
  print("NO")
elif B-A <= 0:
  print("NO")
else:
  if ((B-A)/(V-W)) <= T:
    q, mod= divmod(B-A, V-W)
    if mod == 0:
      print("YES")
    else:
      print("NO")
  else:
    print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if A > B:
  result = "YES"
else:
  if V - W > 0:
    if B - A - T * (V - W) <= 0:
      result = "YES"
    elif B - A - T * (V - W) > 0:
      result = "NO"
  else:
    result = "NO"
print(result)
import sys

a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())

for i in range(1,t+1):
    if a+i*v==b+i*w:
        print("YES")
        sys.exit()

print("NO")
import math

def a():
    s = input()
    print(s[:3])


def b():
    a, v = map(int, input().split())
    b, w = map(int, input().split())
    t = int(input())
    if v > w:
        print('YES')
    else:
        print('NO')


def c():
    print('')



def d():
    print('')


b()
N,S = map(int,input().split())
n,s = map(int,input().split())
T = int(input())

ans1 = N + S*T
ans2 = n + s*T

if n < N:
  print("NO")
elif ans1 >= ans2:
  print("YES")
else:
  print("NO")
import sys

a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if w >= v:
    print("NO")
    sys.exit()

d = abs(b-a)
if (v-w)*t >= d and d%(v-w) == 0:
    print("YES")
    sys.exit()
print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

ans = "No"

move = v*t - w*t
distance = abs(b - a)

if move > 0 and move >= distance:
    ans = "YES"

print(ans)
s,t = map(int,input().split())
m,n = map(int,input().split())
k = int(input())
if((k*t) == (k*n+m)):
  print('Yes')
else:
  print('No')
A, V = map(int,input().split())
B, W = map(int,input().split())
T = int(input())
if A + V * T >= B + W * T:
    print('YES')
else:
    print('NO')
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

X = B-A
Y = V-W

if Y == 0 or X%Y != 0:
    print('NO')
else:
    if Y*T >= X:
        print('YES')
    else:
        print('NO')
a, v = map(int, input().split())
b,w = map(int, input().split())
t = int(input())

a = a + t*v
b = b + t*w
        
if a >= b:
    print('YES')
else:
    print('NO')
A, V = map(int, input().split())
B, W = map(int, input().split())
T=int(input())

if T*(V-W) >= B-A:
    print('YES')
else:
    print('NO')
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
z=(v*t)+a
y=(w*t)+b
if z-y>=0:
    print("YES")
else:
    print("NO")
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if (V > W):
    if (-(V-W)*T <= A - B <= (V-W)*T):
        print("YES")
else:
    print("NO")
a,v=input().split()
b,w=input().split()
t=int(input())
a=int(a)
v=int(v)
b=int(b)
w=int(w)

l=b-a
k=v-w
if w<v:

    if l/k <=t:
        print('Yes')

    else:
        print('No')
else:
    print('No')
#-*-coding:utf-8-*-

import sys

def main():
    a,v = map(int,input().split())
    b,w = map(int,input().split())
    t = int(input())
    if (w*t+b)-(v*t+a) <= 0:
        print("YES")
    else:
        print("NO")
if __name__ == "__main__":
    main()
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if B > A:
    Dis = B - A
    VtoW = V - W
else:
    Dis = A - B
    VtoW = W - V

result = VtoW * T

if Dis <= result:
    print('YES')
else:
    print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if a >=0 and b>=0 :
    if a+v*t >= b+ w*t:
        print("YES")
    else:
        print("NO")
elif a < 0 and b >= 0 :
    if -a+v*t >= b + w*t:
        print("YES")
    else :
        print("NO")
else :
    if a+v*t>=b+w*t:
        print("YES")
    else :
        print("NO")
line1 = input().split()
a = int(line1[0])
a_move = int(line1[1])

line2 = input().split()
b = int(line2[0])
b_move = int(line2[1])

time = int(input())

for count in range(time):
    a += a_move
    b += b_move
    if (a == b):
        print("YES")
        break
    elif (count == time - 1):
        print("NO")
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())
if A == B:
  print("YES")

elif A < B:
  if V <= W:
    print("NO")
  else:
    if abs(A - B)/(W-V) <= T:
      print("YES")
    else:
      print("NO")

elif B < A:
  if W <= V:
    print("NO")
  else:
    if abs(A - B)/(V-W) <= T:
      print("YES")
    else:
      print("NO")
a = input().split(" ")
b = input().split(" ")
c = int(input())
l = int(a[0])
r = int(a[1])
k = int(b[0])
s = int(b[1])
if ((r * c) + l) > ((s * c) + k) :
    print("YES")
else:
    print("NO")
a,v=map(int,input().split())
b,w=map(int,input().split())
t=int(input())
x1=a+t*v
y1=b+t*w
if(x1>=y1 or a+v>=(b+w)):
    print('YES')
else:
    print("NO")
A, V = map(int, input().split()) # oni
B, W = map(int, input().split()) # nige
T = int(input())

pos_oni = A + V * T
pos_nige = B + W * T

if A == B:
    print("YES")
elif A < B:
    if pos_nige <= pos_oni:
        print("YES")
    else:
        print("NO")
elif B < A:
    if pos_oni <= pos_nige:
        print("YES")
    else:
        print("NO")
from sys import stdin
rs = lambda : stdin.readline().strip()
ri = lambda : int(rs())
ril = lambda : list(map(int, rs().split()))

def main():
    A, V = ril()
    B, W = ril()
    T = ri()
    print('Yes' if abs(A - B) <= T * (V - W) else 'No')

if __name__ == '__main__':
    main()
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v < w:
    print('NO')
    exit()

if abs(abs(a)-abs(b)) <= (v-w)*t:
    print('YES')
else:
    print('NO')
a = input().split()
b = input().split()
c = input()

if(int(b[1])>=int(a[1])):
	print("NO")
else:
	length = int(a[0]) - int(b[0])
	v = int(a[1]) - int(b[1])
	times = length / v
	if(times <= int(c)):
		print("YES")
	else:
		print("NO")
# B - Tag

A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

ans = 'NO'
dist = abs(A - B)
diff = V - W
for i in range(T):
    if dist == 0:
        ans = 'YES'
        break
    else:
        dist -= diff

print(ans)
AV = list(map(int,input().split()))
BW = list(map(int,input().split()))
T = int(input())

A = AV[0]
V = AV[1]
B = BW[0]
W = BW[1]

pos_A = A
pos_B = B

if A <= B:
    pos_B = B + T*W
    pos_A = A + T*V
else:
    pos_B = B - T*W
    pos_A = A - T*V


if abs(pos_A) >= abs(pos_B):
    print('Yes')
else:
    print('No')
def calc(oniend, kid , pase):
  if (pase <= 0) or ((oniend * pase) < kid):
    return "NO"
  #elif ((oniend - kid) % pase) == 0:
  else:
    return "YES"

in1 = input().split()
in2 = input().split()
in3 = input()
oni = int(in1[0])
onispeed = int(in1[1])
kid = int(in2[0])
kidspeed = int(in2[1])
time = int(in3)

pase = onispeed - kidspeed
oniend = (pase * time) + oni

if (pase <= 0) or (oniend < kid):
  print("NO")
elif ((oniend - kid) % pase) == 0:
  print("YES")
else:
  print("NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

  
if v>=w:
  if b-a<=(v-w)*t:
    print('YES')
    exit()
print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if (v - w) * t >= (b - a):
  print('YES')
else:
  print('NO')
a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
a = a + v * t
b = b + w * t
if a >= b :
    print("YES")
else:
    print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if abs(a-b) <= t* abs(v-w):
    print('YES')
else:
    print('NO')
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

dis = abs(A-B)
mob = W-V

if A == B:
    print("Yes")
else:
    if mob >= 0:
        print("No")
    else:
        if dis % mob != 0:
            print("No")
        else:
            if dis + (mob*(T+1)) <= 0:
                print("Yes")
            else:
                print("No")
A,V = map(int,input().split())
B,W = map(int,input().split())
T=int(input())
if A==B:
  print("YES")
elif V<=W:
  print("NO")
elif (B-A)/(V-W) <= T:
  print("YES")
else:
  print("NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if v < w:
    print('NO')
    exit()

if abs(abs(a)-abs(b)) < (v-w)*t:
    print('YES')
else:
    print('NO')
A,V = [int(v) for v in input().split()]
B,W = [int(v) for v in input().split()]
T = int(input())

A += int(1e9)
B += int(1e9)

if A < B:
    if V * T + A >= W * T + B:
        print("YES")
    else:
        print("NO")
elif A > B:
    if V * T + A <= W * T + B:
        print("YES")
    else:
        print("NO")
else:
    print("YES")
a_par = list(map(int, input().rsplit())) 
b_par = list(map(int, input().rsplit()))
sec = int(input())

num = 0

for i in range(sec):
    if a_par[0] + a_par[1] * i == b_par[0] + b_par[1] * i:
        num += 1

if num > 0:
    print("YES")
else:
    print("NO")
A, S_A = map(int, input().split(' '))
B, S_B = map(int, input().split(' '))
T = int(input())

distance = B - A

is_catchable = (S_A - S_B) * T > distance
if is_catchable:
    print('YES')
else:
    print('NO')
a, v = list(map(int, input("").split()))
b, w = list(map(int, input("").split()))
t = int(input(""))

gaki1 = a + v * t
gaki2 = b + w * t


if b > a:
    if gaki1 >= gaki2:
        print("YES")
    else:
        print("NO")
else:
    if gaki2 >= gaki1:
        print("YES")
    else:
        print("NO")
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())
if V<=W:
    print("NO")
else:
    distance = abs(A-B)
    time = distance/V-W
    if T>=time:
        print("YES")
    else:
        print("NO")
A,V = list(map(int,input().split()))
B,W = list(map(int,input().split()))
T = int(input())

kyori = B-A
s = V-W
if kyori <= s*T:
    print('YES')
else:
    print('NO')
a,v=map(int, input().split())
b,w=map(int, input().split())
t=int(input())

n=b-a
if n+((w-v)*(t+1))<=0:
    print('YES')
else:
    print('NO')
(A, V) = map(lambda a: int(a), input().split())
(B, W) = map(lambda a: int(a), input().split())
T = int(input())

D = abs(A - B)
X = abs(V - W)

if (X*T >= D):
  print("OK")
else:
  print("NG")
a, v = list(map(int,input().strip().split()))
b, w = list(map(int,input().strip().split()))
t = int(input())

if w - v >= 0:
  print("NO")
else:
  time = abs(a-b)/(v-w)
  if t <= time:
    print("YES")
  else:
    print("NO")
A,V = map(int,input().split())
B,W = map(int,input().split())

T = int(input())

flag = False
if A < B:
  cnt = 0
  while cnt < T:
    A+=V
    B+=W
    if A > B:
      flag=True
      break
    cnt+=1

else:
    cnt=0
    while cnt < T:
      A-=V
      B-=W
      if A<B:
        flag=True
        break
      cnt+=1
    
if flag:
  print("YES")
else:
  print("NO")
A,V=map(int,input().split())
B,W=map(int,input().split())
T=int(input())

import math

def check():
  deltaD=B-A
  deltaV=V-W
  if deltaD<0:
    return 'NO'  
  if deltaV==0:
    return 'NO'
  if deltaD % abs(deltaV)==0:
    if T*deltaV>=deltaD:
      return 'YES'
    else:
      return 'NO'    
  return 'NO'
print(check())
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if V > W:
  if T >= (B - A) % (V - W):
    print('YES')
else:
  print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if a-b <= t*(v-w):
    print('YES')
else:
    print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if b >= a:
  if (b-a) < (v-w)*t:
      print("YES")
  else:
      print("NO")
else:
  if b-w*t <= 0:
    print("YES")
  else:
    print("NO")
def main():
    A, V = map(int, input().split())
    B, W = map(int, input().split())
    T = int(input())

    if A + (V*T) < B + (W*T):
        print('NO')
        return
    print('YES')
main()
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if ((b + w * t) + 1000000000) - ((a + v * t) + 1000000000) <= 0:
    print ("YES")
else:
    print ("NO")
la = list(map(int, input().split()))
lb = list(map(int, input().split()))
t = int(input())


dis = lb[0] - la[0]
a = la[1]*t
b = lb[1]*t
speed = (b-a)

if b-a >= 0:
    print("NO")
else:
    if dis / (a-b) <= t:
        print("YES")
    else:
        print("NO")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

x = a+v*t
y = b+w*t
if x < y:
    print('NO')
else:
    print('YES')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
if (b-a) <= (v-w)*t:
    print("YES")
else:
    print("NO")
import sys
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())

if A < B and V <= W:
    print('NO')
    sys.exit()
elif B < A and W <= V:
    print('NO')
    sys.exit()    

ans = (B-A)/(V-W)

if ans <= T:
    print('YES')
elif ans > T:
    print('NO')
A, V = map(int, input().split())
B, W = map(int, input().split())
T = int(input())
if V == W:
    print("NO")
else:
    if abs(B - A) // (V - W) > 0 and abs(B - A) // (V - W) <= T:
        print("YES")
    elif B + W * T >= 10 ** 9 or B - W * T <= -1 * (10 ** 9):
        print("YES")
    else:
        print("NO")
a, v = map(int,input().split())
b, w = map(int,input().split())
t = int(input())
 
 
if abs(a-b) <= (v- w)*t:
    print('YES')
else:
    print('No')
a,w=map(int,input().split())
b,v=map(int,input().split())
t=int(input())
if(((w*t)+a)>=((t*v)+b)):
    print("YES")
else:
    print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

if v <= w:
    print('NO')
    exit()

if a > b:
    d1 = a + v * t
    d2 = b + w * t
    if d1 < d2:
        print('NO')
        exit()
else:
    d1 = a - v * t
    d2 = b - w * t
    if d1 > d2:
        print('NO')
        exit()

print('YES')
a,v = map(int,input().split())
b,w = map(int,input().split())
t=int(input())
c=a-b
g=v-w
if g<=0:
    print("NO")
    exit()
if c%g==0 and abs(c)<=g*t:
    print("YES")
else:
    print("NO")
a, v = list(map(int,input().split()))
b, w = list(map(int,input().split()))

distance = abs(a-b)
speed = v - w

if speed <= 0:
  print('NO')
  exit()
  
if distance % speed == 0:
  print('YES')
else:
  print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
l = a+v*t
r = b+w*t
if l >= r:
    print("YES")
else:
    print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if abs(b - a) - t * abs(w - v) > 0:
    print("NO")
else:
    print("YES")
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())
# if (v-w)*t>=(b-a):print("YES")
# else:print("NO")

if a<b:
	if (a-b)+(v-w)*t>=0:print("YES")
	else:print("NO")
else:
	if (b-a)+(w-v)*t>=0:print("YES")
	else:print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())

flag = False

for i in range(1, t + 1):
    at = a + v * i
    bt = b + w*i
    if at == b:
        flag = True
        break
if flag:
    print("YES")
else:
    print("NO")
a,v  = map(int,input().split())
b,w  = map(int,input().split())
t = int(input())
if a>b:
    a,b = b,a
    v,w = w,v
if v<=w:
    print('NO')
elif (b-a)/(v-w)<=t and (b-a)/(v-w)==(b-a)//(v-w):
    print('YES')
else:
    print('NO')
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if w >= v:
    print('NO')
    exit()
ans = (b-a) / (t*(w-v))
if ans <= 0:
    print('YES')
else:
    print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

if v <= w:
  print('NO')
  exit()
elif a > b:
  print('YES')
  exit()
  
oni = a + (v*t)
child = b + (w*t)

if (a < b) and (oni < child):
  print('NO')
elif (a > b) and (oni < child):
  print('YES')
elif oni >= child:
  print('YES')
else:
  print('NO')
A, V = map(int, input().split())
B, W = map(int, input().split())
T=int(input())

if W >= V:
    print('NO')
    exit()

if T*(V-W) >= B-A:
    print('YES')
else:
    print('NO')
a,v = map(int,input().split())
b,w = map(int,input().split())
t = int(input())

a = a+v*t
b = b+w*t

if a >= b:
    print("YES")

else:
    print("NO")
A,V = map(int,input().split())
B,W = map(int,input().split())
T = int(input())

if V-W == 0:
  print("NO")
elif abs(B-A)/(V-W) <= T:
  print("YES")
else:
  print("NO")
A,V = list(map(int, input().split()))
B, W = list(map(int, input().split()))
T = int(input())
 
  
if A < B:
  if (A + V*T) >= (B + W*T):
    print("YES")
  else:
    print("NO")
a, v = map(int, input().split())
b, w = map(int, input().split())
t = int(input())
if v <= w:
  print('No')
  exit(0)

if abs(a-b)%(v-w) == 0:
  f = abs(a-b)//(v-w)
  if f <= t:
    print('Yes')
    exit(0)
print('No')
def main():
    hoge = int(input())
    print(-(-hoge // 2))

if __name__ == '__main__':
    main()
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(N//2)
else:
    print(N//2+1)
a=int(input())
if a%2==0:
  print(int(a/2))
else:
  print(int((a+1)/2))
import math
N = int(input())
O = N // 2 + N % 2
print(O)
def main():
    N = int(input())
    print(-(-N // 2))
    return


main()
# ANSHUL GAUTAM
# IIIT-D

from math import *
from copy import *
from string import *				# alpha = ascii_lowercase
from random import *				# l.sort(key=lambda l1:l1[0]-l1[1]) => ex: sort on the basis difference
from sys import stdin
from sys import maxsize
from operator import *				# d = sorted(d.items(), key=itemgetter(1))
from itertools import *
from collections import Counter		# d = dict(Counter(l))
from collections import defaultdict # d = defaultdict(list)

'''

'''

def solve(l):
	n = len(l)
	

N = int(stdin.readline())
print(ceil(N/2))
a = int(input())
b = int(a / 2)
c = int((a + 1) / 2)

if a % 2 == 0:
    print(b)
else:
    print(c)
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))
N = int(input())
# N, X = [int(i) for i in input().split()]

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

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

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


def main():

    N = int(input())

    N = math.ceil(N / 2)

    print(N)


if __name__ == "__main__":
    main()
n=int(input())
if n%2==0:
  print(int(n/2))
elif n%2==1:
  print(int((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 ==1:
  ans=round((a+1)/2)
else:
  ans=round(a/2)
print(ans)
N=int(input())
if N/2.0>int(N/2.0):
    print(int(N/2.0)+1)
else: print(int((N/2.0)))
x = int(input())
if x%2 != 1:
  print(x//2)
else:
  print(x//2+1)
def main():
    n = int(input())
    result = 0
    while True:
        if n > 0:
            n = n - 2
            result += 1
        else:
            break
    print(result)


if __name__ == "__main__":
    main()
n=int(input())
q,mod=divmod(n,2)

print(q+mod)
N = int(input())
if N % 2 == 0:
  print(int(N / 2))
else:
  print(int(N / 2) + 1)
n = int(input())
print(((n % 2 == 0) and (n // 2)) or (n // 2 + 1))
import math

N = int(input())
print(math.ceil(N / 2))
N = int(input())
div, mod = divmod(N, 2)

if mod > 0:
    div = div + 1

print(div)
N = int(input())

q = N //2
r = N % 2
print(q + r)
def main():
    import sys
    input = sys.stdin.readline
    N = int(input())
    if N % 2 == 1:
        print(N//2+1)
    else:
        print(int(N/2))

if __name__ == "__main__":
    main()
N = int(input())
amari = N % 2
count = int( N // 2 )
print( count + amari )
N = int(input())
if N % 2 == 0:
  ans = N//2
else:
  ans = N//2 + 1
print(ans)
n=int(input())
if n%2:
  print(n//2 + 1)
else:
  print(n//2)
import math

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

if __name__ == "__main__":
    N = int(input())
    ret = math .floor(N / 2)
    if N % 2 == 1:
       ret = ret + 1
    print(ret)
# A - Duplex Printing

N = int(input())

print((N+(2-1))//2)
#!/usr/bin/env python
from collections import deque, defaultdict
import bisect
from math import factorial

def main():
    N = int(input())
    #Xs = list(map(int, input().split()))

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


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

a = n // 2
b = n % 2

print(a+b)
# -*- coding: utf-8 -*-

N = int(input())

print((N + 1) // 2)
N=int(input())
if N%2==0:
  print(N//2)
else:
  print(N//2+1)
N = int(input())
print(N // 2 + 1 if N % 2 else N // 2)
N = input()
N = int(N) //2 + int(N)%2
print(N)
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#l = list(map(int, input().split()))

n = int(input())

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

import sys
sys.setrecursionlimit(300000)


def solve(N: int):
    ret = (N + 1) // 2 
    print(ret)
    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))  # type: int
    solve(N)

if __name__ == '__main__':
    main()
n = int(input())
ans = n//2
if n%2==1:
    ans+=1
print(ans)
import sys
import itertools
input = sys.stdin.readline
sys.setrecursionlimit(100000)


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


def read_index():
    return map(lambda x: x - 1, map(int, input().split()))


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def functional(N, mod):
    F = [1] * (N + 1)
    for i in range(N):
        F[i + 1] = (i + 1) * F[i] % mod
    return F


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


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

line = sys.stdin.readline().strip()
n = int(line)
print(n//2+n%2)
import math 

n = int(input())

print(math.ceil(n/2))
# coding: utf-8
# Your code here!
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)
#Macで実行する時
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))
import sys
input = sys.stdin.readline
print(-(-int(input()) // 2))
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)
i = int(input())
result = i // 2
if i % 2 != 0:
    result = result + 1
print (result)
N = int(input())
 
if N % 2 == 0:
  print(int(N / 2))
else:
  print(int((N + 1) / 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//2 + 1)
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 N//2+1)