Problem:
 Score : 100 points    Problem Statement You are given two positive integers a and b .
Let x be the average of a and b .
Print x rounded up to the nearest integer.      Constraints  a and b are integers.  1 \leq a, b \leq 100         Input Input is given from Standard Input in the following format:  a  b       Output Print x rounded up to the nearest integer.        Sample Input 1 1 3      Sample Output 1 2  The average of 1 and 3 is 2.0 , and it will be rounded up to the nearest integer, 2 .       Sample Input 2 7 4      Sample Output 2 6  The average of 7 and 4 is 5.5 , and it will be rounded up to the nearest integer, 6 .       Sample Input 3 5 5      Sample Output 3 5

Solution (Python):
import math
a, b = map(int, input().split())
ans = math.ceil((a + b) / 2)
print(ans)

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

A,B,=LI()
x=A+B

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

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

a, b = LI()
x = a + b

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

Solution (Python):
a,b=map(int,input().split())
import math
print(math.ceil((a+b)/2))

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

a,b = I()
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
a , b = map(int,input().split())
print(-(-(a+b)//2))

Solution (Python):
import math
x,y = map(int,input().split())
print(math.ceil((x+y)/2))

Solution (Python):
a,b = map(int,input().split())
if (a+b) % 2 == 0:
    print((a+b)//2)
else:
    print((a+b)//2 + 1)

Solution (Python):
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):

import math
import sys
sys.setrecursionlimit(10**6)

a, b = list(map(int, input().split()))


print(math.ceil((a+b)/2))

Solution (Python):
from math import ceil
a,b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
lst = input().split()
a = int(lst[0])
b = int(lst[1])

v1 = (a + b) / 2
v2 = (a + b) // 2

if v1 == v2:
   print(v2)
else:
   print(v2 + 1)

Solution (Python):
import math
a, b = map(int , input().split())
print(math.ceil((a + b)/2) )

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
ans = (-(a+b))//2

print(-ans)

Solution (Python):
a, b = map(int, input().split())
from math import ceil
print(ceil((a+b)/2))

Solution (Python):
a,b = map(int,input().split())
print((a+b)//2 if (a+b)%2==0 else (a+b)//2+1)

Solution (Python):
a,b=map(int,input().split(" "))
print((a+b)//2+(a+b)%2)

Solution (Python):
a, b = map(int, input().split())

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

Solution (Python):
import math

a, b = map(int, input().split())
avg = (a + b) / 2
print(math.ceil(avg))

Solution (Python):

a,b=map(int,input().split())
import math
print(math.ceil((a+b)/2))

Solution (Python):
print((sum(map(int,input().split()))-1)//2+1)

Solution (Python):
import math
a,b = map(int,input().split())
avg=(a+b)/2
print(math.ceil(avg))

Solution (Python):
a, b = map(int, input().split())
import math
print(math.ceil((a + b) / 2))

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
import math






e1,e2 = map(int,input().split())


print(math.ceil((e1+e2)/2))

Solution (Python):
a,b=map(int,input().split())
print(-(-(a+b)//2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
a, b = map(int, input().split())
print(int((a+b+1)/2))

Solution (Python):
import math
print(math.ceil((eval(input().replace(' ','+'))/2)))

Solution (Python):
import math

a, b = map(int, input().split())
print(math.ceil((a + b) / 2))

Solution (Python):
from math import ceil
a,b = map(int,input().split())
print(ceil((a+b)/2))

Solution (Python):
a,b = map(int,input().split())
import math
print(math.ceil((a+b)/2))

Solution (Python):
import math

a, b = map(int, input().split())
result = math.ceil((a + b) / 2)
print(result)

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = [int(x) for x in input().split()]
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
res = (a + b + 2 - 1) // 2
print(res)

Solution (Python):
a, b = map(int, input().split())
import math
c = math.ceil((a+b) /2)
print(c , flush=True)

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)>>1)

Solution (Python):
import sys

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


def main():
    a, b = map(int, readline().split())

    print((a + b + 1) // 2)


if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
x = a + b
if x % 2 == 0:
  print(int(x/2))
else:
  print(int((x + 1)/2))

Solution (Python):
a, b = map(int, input().split())
if (a+b)%2 == 0:
  print((a+b)//2)
else:
  print((a+b)//2 + 1)

Solution (Python):
import math

a, b = map(int, input().split())
x = (a + b) / 2

print(math.ceil(x))

Solution (Python):
a,b=map(int,input().split())
if (a%2 == 0 and b%2 == 0) or (a%2 == 1 and b%2 == 1):
    print((a+b)//2)
else:
    print(((a+b)//2) + 1)

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
A, B = map(int, input().split())
if (A+B)%2 == 1:
    print((A+B)//2+1)
else:
    print((A+B)//2)

Solution (Python):
a,b = map(int,input().split())
print((a+b+1)//2)

Solution (Python):
import numpy as np
X = np.array([int(x) for x in input().split()])
ans = np.ceil(np.mean(X))
print(int(ans))

Solution (Python):
a,b=map(int,input().split())
ans=(a+b)//2
print(ans if (a+b)&1!=1 else ans+1)

Solution (Python):
a,b=map(int,input().split())
c=a+b
if c%2==0:
  print(c//2)
else:
  print(c//2+1)

Solution (Python):
a,b = map(int,input().split())

import math
print(math.ceil((a + b) / 2))

Solution (Python):
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b = map(int,input().split())
print((a+b+1)//2)

Solution (Python):
import math

a, b = map(int, input().split())
x = (a + b) / 2
print(math.ceil(x))

Solution (Python):
a, b = map(int, input().split())
print(-(-(a + b) // 2))

Solution (Python):
a,b = map(int,input().split())
print(-(-(a+b)//2))

Solution (Python):
a,b = map(int,input().split())

print(-(-(a+b)//2))

Solution (Python):

a, b = map(int, input().split())


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

Solution (Python):
from math import *
l=list(map(int,input().split()))
print(ceil(sum(l)/2))

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
if (a+b)%2==0 :
  print((a+b)//2)
else :
  print((a+b)//2+1)

Solution (Python):
a,b=map(int,input().split())
print(-(-(a+b)//2))

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

Solution (Python):
a,b=map(int,input().split())
c=(a+b)/2
if c%1>0:
  print(int(c+1))
else:
  print(int(c))

Solution (Python):

import sys, math
from itertools import permutations, combinations
from collections import defaultdict, Counter, deque
from math import factorial, gcd
from bisect import bisect_left, bisect_right

sys.setrecursionlimit(10 ** 7)
enu = enumerate
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline()[:-1]
pl = lambda x: print(*x, sep="\n")

a, b = map(int, input().split())

val = (a+b+2-1)//2
print(val)

Solution (Python):
import math


a, b = map(int, input().split())
x = (a + b) / 2
print(math.ceil(x))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/ 2))

Solution (Python):
a,b = map(int,input().split())
from math import ceil
print(ceil((a+b)/2))

Solution (Python):
import math
a, b = (int(t) for t in input().split())
x = (a + b) / 2
print(math.ceil(x))

Solution (Python):
a, b = map(int, input().split())
print(((a + b) + (2 - 1)) // 2)

Solution (Python):
import sys
import math

sys.setrecursionlimit(10 ** 8)
ini = lambda: int(sys.stdin.readline())
inl = lambda: [int(x) for x in sys.stdin.readline().split()]
ins = lambda: sys.stdin.readline().rstrip()
debug = lambda *a, **kw: print("\033[33m", *a, "\033[0m", **dict(file=sys.stderr, **kw))

a, b = inl()

x = (a + b + 1) // 2
print(x)

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
a,b=map(int,input().split())
print(abs(-(a+b)//2))

Solution (Python):
import math
a,b=map(int,input().split())
x=(a+b)/2
print(math.ceil(x))

Solution (Python):
a, b = [int(i) for i in input().split()]

x = a + b

ans = (x // 2) + (x % 2)
print(ans)

Solution (Python):
import math

a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
from math import ceil

a, b = map(int, input().split())
print(ceil((a + b) / 2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):

import math
a, b = map(int, input().split())
multi = math.ceil((a + b) / 2)

print(str(multi))

Solution (Python):
import math


def main():
    a, b = map(int, input().split())
    print(math.ceil((a+b)/2))
        

if __name__ == "__main__":
    main()

Solution (Python):
a,b=map(int,input().split())
print(-(-(a+b)//2))

Solution (Python):
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print(((a+b+1)//2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a,b=map(int,input().split());print(math.ceil((a+b)/2))

Solution (Python):
import decimal

a, b = map(int, input().split())

num = decimal.Decimal((a + b) / 2)

ans = int(num)
if num % 1 != 0:
    ans += 1

print(ans)

Solution (Python):
a, b = map(int,input().split())
if (a+b) % 2 == 0:
  ans = (a+b) // 2
else:
  ans = (a+b) // 2 + 1
print(ans)

Solution (Python):
a,b = map(int,input().split())

if (a+b)%2==0:
  print("{:.0f}".format((a+b)/2))
else:
  print("{:.0f}".format((a+b)/2-0.5+1))

Solution (Python):
a, b =map(int, input().split())
print(int((a+b+1)/2))

Solution (Python):
a, b = map(int, (input().split()))
print(-((-a-b)//2))

Solution (Python):
import math

a, b = map(int, input().split())

sum_ceil = math.ceil((a+b)/2)

print(sum_ceil)

Solution (Python):
import math
x, y = map(int, input().split())
print(math.ceil((x + y) / 2))

Solution (Python):
a,b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
import math
a, b = map(int, input().split())
ave = (a+b) / 2
print(math.ceil(ave))

Solution (Python):




import sys
from io import StringIO
import unittest


class TestClass(unittest.TestCase):
    def assertIO(self, input, output):
        stdout, stdin = sys.stdout, sys.stdin
        sys.stdout, sys.stdin = StringIO(), StringIO(input)
        resolve()
        sys.stdout.seek(0)
        out = sys.stdout.read()[:-1]
        sys.stdout, sys.stdin = stdout, stdin
        self.assertEqual(out, output)

    def test_入力例_1(self):
        input = """1 3"""
        output = """2"""
        self.assertIO(input, output)

    def test_入力例_2(self):
        input = """7 4"""
        output = """6"""
        self.assertIO(input, output)

    def test_入力例_3(self):
        input = """5 5"""
        output = """5"""
        self.assertIO(input, output)


def resolve():
    a, b = map(int, input().split())
    print((a+b+1)//2)


if __name__ == "__main__":
    
    resolve()

Solution (Python):
a, b = map(int, (input().split()))

c = (a + b) // 2
d = (a + b) % 2

if d != 0:
    print(c + 1)
else:
    print(c)

Solution (Python):
import math
a, b = map(int, input().split())
x = (a+b) / 2
print(math.ceil(x))

Solution (Python):
a, b = map(int, input().split())
if (a+b) % 2 == 0 :
  ans = (a + b) // 2
else: 
  ans = (a + b) // 2 + 1
print(ans)

Solution (Python):
a, b = map(int, input().split())
if (a+b) % 2 == 0:
    ans = (a+b) / 2
else:
    ans = (a+b) // 2 + 1
print(int(ans))

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
a,b = map(int,input().split())
tmp = (a+b)/2
print(int(tmp+0.5))

Solution (Python):
a,b=map(int,input().split())

if a%2==0 and b%2==0:
  print(int((a+b)/2))
elif a%2==1 and b%2==1:
  print(int((a+b)/2))
elif a%2==0 and b%2==1:
  print(int((a+b+1)/2))
else:
  print(int((a+b+1)/2))

Solution (Python):
a,b = map(int, input().split())
if (a+b)%2 == 0:
    print((a+b)//2)
else:
    print(((a+b)//2)+1)

Solution (Python):
def main():
	a, b = map(int, input().split())

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


  
if __name__ == "__main__":
  	main()

Solution (Python):
import math

a,b = map(int,input().split())

print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
num =input().split(" ")

X = (int(num[0]) + int(num[1]))/2
print(math.ceil(X))

Solution (Python):
import math
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
x,y = map(int, input().split())
import math
print(math.ceil((x+y)/2))

Solution (Python):
x,y = map(int, input().split())
z =x+y
import math
print(math.ceil(z/2))

Solution (Python):
a,b=map(int,input().split())
ans=-(-(a + b)//2)
print(ans)

Solution (Python):
a, b = map(int, input().split())
ans = - (- (a + b) // 2)
print(ans)

Solution (Python):
a, b = map(int, input().split())
ans = (-(-(a+b)//2))
print(ans)

Solution (Python):

a,b = map(int, input().split())

print((a+b+1)//2)

Solution (Python):
import math
a,b = (int(x) for x in input().split())
print (abs (math.ceil ((a+b)/2)))

Solution (Python):
a,b=map(int, input().split())
if (a+b)/2>(a+b)//2:
  print((a+b)//2+1)
elif (a+b)/2==(a+b)//2:
  print((a+b)//2)

Solution (Python):
a, b = map(int, input().split())
x = (a + b + 1) // 2
print(x)

Solution (Python):
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())

mean = (a+b)/2
if mean > int(mean):
  print(int(mean)+1)
else:
  print(int(mean))

Solution (Python):

import math


def main():
    x, y = map(int, input().split())
    print(math.ceil((x + y) / 2))


if __name__ == "__main__":
    main()

Solution (Python):
import sys

read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7


def main():
    A, B = map(int, readline().split())
    print((A+B+1)//2)


if __name__ == '__main__':
    main()

Solution (Python):
a,b =map(int,input().split())
if (a+b)%2 ==0:
  print((a+b)//2)
else:
  print(((a+b)//2)+1)

Solution (Python):
a,b = map(int, input().split())

x = (a+b)/2
 
if x == int(x):
  print(int(x))
 
else:
  x += 1
  print(int(x))

Solution (Python):
a,b=map(int,input().split())
print(a+b-(a+b)//2)

Solution (Python):
a, b = map(int, input().split())
c = (a + b) / 2
n = str(c)
if n[len(n) - 1] == '0':
    print(int(c))
else:
    print(int(c) + 1)

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
import numpy as np
a, b = map(int, input().split())
print(int(np.ceil((a + b) / 2)))

Solution (Python):
import math
ab = sum(list(map(int, input().split())))
print(math.ceil(ab/2))

Solution (Python):
ans=sum(map(int,input().split()))
ans=ans//2+ans%2
print(ans)

Solution (Python):
a,b = map(int, input().split())

import math
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
a,b=map(int,input().split())
print(int((a+b+1)/2))

Solution (Python):
import math
a, b = map(int, input().split())

print(math.ceil((a+b)/2))

Solution (Python):
import sys
sys.setrecursionlimit(4100000)
import math
import itertools
INF = float('inf')
from heapq import heapify, heappop, heappush

def main():
    a,b = map(int, input().split())

    print(math.ceil((a+b)/2))


if __name__ == '__main__':
    main()

Solution (Python):
import math
a, b = map(int, input().split())

print(math.ceil((a + b) / 2))

Solution (Python):
a, b = map(int, raw_input().split())
print (a + b)/2 + (1 if (a+b) % 2 else 0)

Solution (Python):
a, b = map(int, input().split())
ave=(a+b)/2
if ave-int(ave)==0:
    print(int(ave))
else:
    print(int(ave)+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():
    a, b = map(int, readline().split())

    print((a + b + 1) // 2)

    return


if __name__ == '__main__':
    main()

Solution (Python):
a,b=map(int,input().split())
print(int((a+b+1)/2))

Solution (Python):
a, b = list(map(int, input().split()))
n = a + b
k = n % 2
my_result = (n + k) / 2
print(int(my_result))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
a,b = list(map(int, input().split()))
avg=a+b
if avg%2==1:
  avg+=1
print(int(avg/2))

Solution (Python):
a, b = map(int, input().split())

x = (a+b+2-1)//2

print(x)

Solution (Python):
print((sum(map(int, input().split()))+1)//2)

Solution (Python):
print((sum(map(int, input().split()))+1)//2)

Solution (Python):
a, b = list(map(int, input().split()))

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

Solution (Python):
a,b = map(int,input().split())

u = (a+b)
x = (a+b) // 2 

if u % 2 > 0:
    x = x + 1

print(str(x))

Solution (Python):
import  math
A,B = map(int, input().split())
print(math.ceil((A+B)/2))

Solution (Python):

















import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import accumulate, permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from bisect import bisect, bisect_left
from fractions import gcd
from heapq import heappush, heappop
from functools import reduce
import numpy as np
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def ZIP(n): return zip(*(MAP() for _ in range(n)))
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

import math
a, b = MAP()
print(math.ceil((a + b) / 2.0))

Solution (Python):
a,b = map(int, input().split())
print((a+1+b)//2)

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math 
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
a,b = map(int,input().split())

import math

print(math.ceil((a+b)/2))

Solution (Python):
import numpy as np
ab = input().split(" ")
print(int(np.ceil(np.mean([int(ab[0]), int(ab[1])]))))

Solution (Python):
import math
a,b=map(int,input().split())
gou=((a+b)/2)
print(math.ceil(gou))

Solution (Python):
import math
A,B = (int(T) for T in input().split())
print(math.ceil((A+B)/2))

Solution (Python):

import math

a,b=map(int,input().split())

print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())

print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
import math
from statistics import mean
import math



a,b = map(int, input().split())
list1 = [a, b]


ave = mean(list1)
print(math.ceil(ave))

Solution (Python):
a,b = map(int,input().split())
if int((a+b)/2) == (a+b)/2:
    print(int((a+b)/2))
else:
    print((a+b)//2+1)

Solution (Python):
a, b = map(int, input().split())
if (a + b) % 2 == 0:
  print((a + b) // 2)
else:
  print((a + b) // 2 + 1)

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

a,b = map(int,input().split())

x = (a+b)/2
y = x//1
mod = x%1
if mod == 0:
  print(int(y))
else:
  print(int(y+1))

Solution (Python):
import math
N, M = [int(i) for i in input().split()]
print(math.ceil((N + M) / 2))

Solution (Python):
a,b=map(int,input().split()) 

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

Solution (Python):
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print(-((-a-b)//2))

Solution (Python):
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
a,b = map(int,input().split())
import math
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())

import math
print(math.ceil((a + b) / 2))

Solution (Python):
import sys
from math import ceil
def input(): return sys.stdin.readline().strip()


def main():
    a, b = map(int, input().split())
    print(ceil((a + b) / 2))



if __name__ == "__main__":
    main()

Solution (Python):
import math
a, b = map(int, input().split())

print(math.ceil((a+b)/2))

Solution (Python):
a,b = input().split(' ')
a = int(a)
b = int(b)
print((a+b-1)//2+1)

Solution (Python):
from math import ceil
a, b = map(int, input().split())
print(ceil(0.5 * (a + b)))

Solution (Python):
import math
a,b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())
x = math.ceil((a+b)/2)
print(x)

Solution (Python):
import statistics
import math

a = list(map(int,input().split()))
print( math.ceil(statistics.mean(a)))

Solution (Python):
import math

a,b = map(int, input().split())

print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b) / 2))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
def resolve():
    a, b = map(int,input().split())
    x = (a+b) / 2
    if x % 1 == 0:
        print(int(x))
    else:
        print(int(x)+1)
resolve()

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print(int((a+b)/2+0.9))

Solution (Python):
a, b = map(int, input().split())
print(-(-(a+b)//2))

Solution (Python):
a,b = map(int, input().split())

print(-(-(a + b)//2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print(-(-(a+b)//2))

Solution (Python):
a,b = map(int,input().split())
if (a + b)%2 ==0:
    print(round((a + b) / 2))
else:
    print(round((a + b + 1) / 2))

Solution (Python):
from math import ceil
a, b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
c = (a+b)/2
d = int(c)
if c-d>0:
  print(d+1)
else:
  print(d)

Solution (Python):
a, b = map(int, input().split())
import math
print(math.ceil((a + b) / 2))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
import math
a, b = map(int, input().split())
mean = float((a + b) / 2)
print(math.ceil(mean))

Solution (Python):
import math
a, b = map(int, input().split())
mean = (a + b) / 2.0
print(math.ceil(mean))

Solution (Python):
x,y = map(int,input().split())

print((x+y+1) // 2)

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a, b = list(map(int, input().split()))

import math
print(math.ceil((a+b)/2))

Solution (Python):
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
a, b = map(int, input().split(" "))
sum = a + b
avg = sum / 2
if sum % 2 == 1:
    avg += 1

print(int(avg))

Solution (Python):
import math
a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int, input().split())
print(math.ceil((a + b) / 2))

Solution (Python):
import math
print(math.ceil(sum(map(int,input().split())) / 2))

Solution (Python):
a,b=map(int,input().split())
if (a+b)%2!=0:
    print((a+b)//2+1)
else:
    print((a+b)//2)

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a, b = map(int,input().split())
print(math.ceil((a + b)/2))

Solution (Python):
import math

a, b = map(int, input().split())

print(math.ceil((a + b) / 2))

Solution (Python):
a, b = map(int, input().split())

print((a + b + 1) // 2)

Solution (Python):
a, b = list(map(int, input().split()))

c = (a+b)/2

if int(c) == c:
    print(int(c))
else:
    print(int(c+1))

Solution (Python):
from math import ceil 
 
a, b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
a,b = map(int,input().split())

ans = a+b


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

Solution (Python):
from statistics import mean
from math import ceil


ab = list(map(int, input().split()))

print(ceil(mean(ab)))

Solution (Python):
a, b=map(int, input().split())
print((a+b+1)//2)

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

a,b = list(map(int,input().split()))
print(math.ceil((a+b)/2))

Solution (Python):

from math import ceil

a, b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
import sys
import math
import itertools
import collections
import heapq
import re
import numpy as np

rr = lambda: sys.stdin.readline().rstrip()
rs = lambda: sys.stdin.readline().split()
ri = lambda: int(sys.stdin.readline())
rm = lambda: map(int, sys.stdin.readline().split())
rl = lambda: list(map(int, sys.stdin.readline().split()))
inf = float('inf')
mod = 10**9 + 7


a, b = rm()
print(math.ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print(-(-(a+b)//2))

Solution (Python):
a,b = map(int,input().split())
result = (a+b)/2
print(int(result)+1 if result % int(result) != 0 else int(result))

Solution (Python):
print((sum([int(i) for i in input().split()])+1)//2)

Solution (Python):
from math import ceil

a, b = map(int, input().split())

print(ceil((a+b)/2))

Solution (Python):
a,b=map(int,input().split())
print((a+b+1)//2)

Solution (Python):
a,b=map(int,input().split())
from math import ceil
print(ceil((a+b)/2))

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)

from math import ceil
a, b = mapint()
print(ceil((a+b)/2))

Solution (Python):
a,b = map(int, input().split())
print((a+b)//2 if (a+b)/2-int((a+b)/2) <0.5 else (a+b)//2+1)

Solution (Python):
def resolve():
  a, b = map(int, input().split())
  ans = (a + b + 1) // 2
  print(ans)
  return

if __name__ == "__main__":
  resolve()

Solution (Python):
a,b = map(int,input().split())
m = (a+b+2-1)//2
print(m)

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
import math
import collections
import fractions
import itertools
import functools
import  operator

def solve():
    a, b = map(int, input().split())
    print(math.ceil((a+b)/2))
    return 0

if __name__ == "__main__":
    solve()

Solution (Python):
import math
a,b = map(int,input().split())
x = math.ceil((a+b)/2)
print(x)

Solution (Python):
from math import ceil
a, b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
a, b = input().split()
a = int(a)
b = int(b)

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

Solution (Python):
from math import ceil
a, b = map(int, input().split())
print(ceil((a+b)/2))

Solution (Python):
a, b = list(map(int, input().split()))
print((a + b + 1) // 2)

Solution (Python):


import math

input_ = input().split()

a = float(input_[0])
b = float(input_[1])

ave = (a + b) / 2.0

print(math.ceil(ave))

Solution (Python):
A, B = map(int,input().split())
print(-( (-A-B)//2 ) )

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):

import math

a,b = map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
x,y = map(int,input().split())
 
m = (x+y)/2
 
print(math.ceil(m))

Solution (Python):
a, b = map(int, input().split())
print((a + b + 1) // 2)

Solution (Python):
import math
a,b = map(int, input().split())
mean = (a+b)/2
ans = math.ceil(mean)

print(ans)

Solution (Python):
a, b = map(int,input().split())
ave = int((a+b+1)/2)
print(ave)

Solution (Python):
a, b = map(int, input().split())
print((a+b+1)//2)

Solution (Python):
import math
print(math.ceil(eval(input().replace(" ","+"))/2))

Solution (Python):
import sys
import math
a,b = map(int,input().split())
if not (1 <= a <= 100 and 1 <= b <= 100):
    sys.exit()

print(math.ceil( (a + b) / 2) )

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
import math
a,b = map(int, input().split())
print(math.ceil((a+b)/2))

Solution (Python):
a,b = map(int,input().split())
x = (a+b+1)//2
print(x)

Solution (Python):
a,b=[int(i) for i in input().split()]
mean_ab=(a+b)/2
if (a+b)%2==0:
    print(int(mean_ab))
else:
    print(int(mean_ab)+1)

Solution (Python):
import math

a,b=map(int,input().split())

print(math.ceil((a+b)/2))

Solution (Python):
import math
print(math.ceil(sum(map(int,input().split()))/2))

Solution (Python):
a,b=map(int,input().split());print((a+b+1)//2)

Solution (Python):
a, b = map(int, input().split())
c = (a+b-1)/2+1
print(int(c))

Solution (Python):
a,b=map(int,input().split())
c=(a+b)/2
if c%1==0:
  print(int(c))
else:
  print(int((c//1)+1))

Solution (Python):
a, b = map(int, input().split())
if (a+b) % 2 == 0:
  print((a+b)//2)
else:
  print(((a+b)//2)+1)

Solution (Python):
a, b = map(int, input().split())
print((a+b)//2 + (a+b)%2)

Solution (Python):
a,b=map(int, input().split())
m=(a+b)//2
if (a+b)%2==1:
  print(m+1)
else:
  print(m)

Solution (Python):
import math


a, b = input().split()
print(math.ceil((int(a) + int(b)) / 2))

Solution (Python):
import math
a,b=map(int,input().split())
print(math.ceil((a+b)/2))

Solution (Python):
print(eval(input().replace(*' +'))+1>>1)

Solution (Python):
print(eval(input().replace(*' +'))+1>>1)

Solution (Python):
import math

x,y = map(int,input().split())
print(math.ceil((x+y)/2))