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

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

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

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

Solution (Python):

import sys
import math


def solve(a: int, b: int):
    print(math.ceil((a+b)/2))
    return



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

if __name__ == '__main__':
    main()

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

Solution (Python):
a,b = input().split()
average = float((int(a)+int(b))*0.5)
rd = average - float(int(average))
plus = 0
if rd >=0.5:
    plus = 1
print(int(average)+plus)

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

ave = -(-(a+b)//2)

print(ave)

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

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

print(ans)

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

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

x = a + b

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

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


abc()

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

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

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):
a,b = map(int,input().split())
x = a+b
if x&1:
  x += 1
print(x//2)

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

import sys
sys.setrecursionlimit(10**7)
INTMAX = 9223372036854775807
INTMIN = -9223372036854775808
MOD = 1000000007
def POW(x, y): return pow(x, y, MOD)
def INV(x, m=MOD): return pow(x, m - 2, m)
def DIV(x, y, m=MOD): return (x * INV(y, m)) % m
def LI(): return [int(x) for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

a,b=LI()

print(math.ceil((a+b)*0.5))

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

Solution (Python):


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

ans = int((a+b)/2+0.9)
print(ans)

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

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

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

Solution (Python):
import math

num = list(map(int,input().split(' ')))

x = math.ceil(sum(num)/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((a + b + 1) // 2)

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

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

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

Solution (Python):
import math
a, b = [int(x) for x 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):
a,b=map(int,input().split())
print(int((a+b)/2+0.5))

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

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

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

print(int(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):
from collections import defaultdict
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 + 1) // 2)

Solution (Python):
import numpy as np
a, b = [int(j) for j in input().split()]

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

Solution (Python):
a, b = map(int, input().split())
print((a+b)//2+(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())
ave = (a + b) / 2
AVE = math.ceil(ave)
print(AVE)

Solution (Python):











import sys
input=sys.stdin.readline
inf=float('inf')
mod = 10**9+7
def INT_(n): return int(n)-1
def MI(): return map(int,input().split())
def MF(): return map(float, input().split())
def MI_(): return map(INT_,input().split())
def LI(): return list(MI())
def LI_(): return [int(x) - 1 for x in input().split()]
def LF(): return list(MF())
def LIN(n:int): return [input() for _ in range(n)]
def LLIN(n: int): return [LI() for _ in range(n)]
def LLIN_(n: int): return [LI_() for _ in range(n)]
def LLI(): return [list(map(int, l.split() )) for l in input()]
def I(): return int(input())
def F(): return float(input())
def ST(): return input().replace('\n', '')
def main():
    from math import ceil
    a, b = MI()
    print(ceil((a+b)/2))
if __name__ == '__main__':
    main()

Solution (Python):
def round_up(divided_number, devide_by_number):
    return (divided_number + devide_by_number - 1)//devide_by_number


if __name__ == '__main__':
    a, b = map(int, input().split())

    x = a + b

    print(round_up(x, 2))

Solution (Python):
if __name__ == '__main__':
    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):
a, b = map(int, input().split())
import math
x = (a+b)/2
print(math.ceil(x))

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

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

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

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

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

if((x - c) > 0):
    print(c + 1)
else:
    print(c)

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

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

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

x = 2
ab = a + b

print(int((ab + x - 1) / x ))

Solution (Python):
import math

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

print(ans)

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

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

print(ans)

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

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

print(ans)

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 = input().split()
x = (int(a) + int(b)) / 2

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

print(ans)

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

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

Solution (Python):
import math

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

s=sum(nums)
n=len(nums)

mean=s/n

print(math.ceil(mean))

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

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())
mean = (a + b) / 2
if mean % 1 != 0:
    mean = (mean // 1)  + 1

print(int(mean))

Solution (Python):

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

ab = a+b
ans = ab//2 + ab%2
print( ans )

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

Solution (Python):
a, b = map(int,input().split())
print((a+b)//2+(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):
import math
a,b=map(int,input().split(" "))
print(math.ceil((a+b)/2))

Solution (Python):
i = list(map(int, input().split()))
sum=i[0]+i[1]
if sum%2==1:
  sum+=1
print(int(sum/2))

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

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

Solution (Python):

import sys
import math
input = sys.stdin.readline

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

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

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

Solution (Python):
import math

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

Solution (Python):
from functools import reduce
import math

def main():
    
    
    
    

    
    
    
    
    
    

    
    

    
    
    
    
    
    
    
    
    
    INF = float("inf")

    
    MOD = 10**9+7
    
    
    
    
    
    
    
    
    
    
    
    
    
    
    

    
    
    
    
    a, b = (int(_) for _ in input().split())
    print(math.ceil((a+b)/2))
    
if __name__ == '__main__':
    main()

Solution (Python):
import sys
from math import ceil
input = sys.stdin.readline
a, b = map(int, input().split())
print(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(int((a + b) / 2))
else:
    print(int((a + b) / 2) + 1)

Solution (Python):

from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
def LI(): return list(map(int, sys.stdin.readline().split()))
def I(): return int(sys.stdin.readline())
def LS():return list(map(list, sys.stdin.readline().split()))
def S(): return list(sys.stdin.readline())[:-1]
def IR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = I()
    return l
def LIR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LI()
    return l
def SR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = S()
    return l
def LSR(n):
    l = [None for i in range(n)]
    for i in range(n):l[i] = LS()
    return l
sys.setrecursionlimit(1000000)
mod = 1000000007


def A():
    a,b = LI()
    print(math.ceil((a+b)/2))
    return


def B():
    s = S()
    t = S()
    s.sort()
    t.sort(reverse = True)
    if s < t:
        print("Yes")
    else:
        print("No")
    return


def C():
    n = I()
    d = [None for i in range(n+1)]
    d[0] = 2
    d[1] = 1
    for i in range(2,n+1):
        d[i] = d[i-1]+d[i-2]
    print(d[n])
    return


def D():
    x,y,z = LI()
    for i in range(1000000)[::-1]:
        if i*y+(i+1)*z <= x:
            print(i)
            quit()
    return


def E():
    d = [(1,0),(-1,0),(0,1),(0,-1)]
    h,w = LI()
    s = SR(h)
    for i in range(h):
        for j in range(w):
            if s[i][j] == "
                su = 0
                for dy,dx in d:
                    y = i+dy
                    x = j+dx
                    if 0 <= y < h and 0 <= x < w:
                        if s[y][x] == "
                            su += 1
                if su == 0:
                    print("No")
                    quit()
    print("Yes")
    return


def F():
    a,b,c,X,Y = LI()
    ans = float("inf")
    for z in range(300001):
        if z%2 == 0:
            m = c*z
            x = z//2
            y = z//2
            m += a*max(0,X-x)
            m += b*max(0,Y-y)
            if m < ans:
                ans = m
    print(ans)
    return


def G():
    n = I()
    x = LI()
    f = [(i,x[i]) for i in range(n)]
    f.sort(key = lambda x:x[1])
    g = [(f[i][0],i) for i in range(n)]
    g.sort(key = lambda x:x[0])
    for i in range(n):
        if g[i][1] < n//2:
            print(f[n//2][1])
        else:
            print(f[n//2-1][1])
    return


def H():
    return


def I_():
    return


def J():
    return


if __name__ == "__main__":
    A()

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

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

Solution (Python):


import math

a,b = list(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

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

print(math.ceil((l[0] + l[1])/2.0))

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

Solution (Python):
a,b=[int(i) for i in 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 math
a,b = map(int,input().split(' '))
print(int(math.ceil((a+b)/2)))

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

Solution (Python):
b, c = map(int, input().split())
sum = b+c
if(sum % 2 == 0):
  print(sum//2)
else:
  print(sum//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):
from math import ceil
a, b = map(int, input().split())
print(ceil((a + b) / 2))

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

Solution (Python):
import math

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

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

print(ans)

Solution (Python):
import math

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

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

print(ans)

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 % 2 != 0 and b % 2 == 0:
  print(int((a+b)/2) + 1)
elif a % 2 == 0 and b % 2 != 0:
  print(int((a+b)/2) + 1)
else:
  print(int((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
import numpy as np
arr = list(map(int, input().split()))
print(math.ceil(np.mean(arr)))

Solution (Python):
import math
import sys


def input():
    return sys.stdin.readline()[:-1]








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

ave = (a+b)/2

aveint = int(ave)

if ave%aveint > 0:
    print(aveint+1)
else:
    print(aveint)

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())
print(int(math.ceil((a+b)/2)))

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

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

Solution (Python):
import math


def main():
    ab = list(map(int, input().split()))
    print(math.ceil(sum(ab) / len(ab)))


main()

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

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

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

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

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

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

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

Solution (Python):
import math

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

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

Solution (Python):
import sys, os

f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
    sys.stdin = open('./input.txt', 'r')

def solve():
    a,b  = f()
    print((a+b)//2 + ((a+b)&1))

solve()

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 = list(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=input().strip().split()
a,b=[int(a), int(b)]
print(math.ceil((a+b)/2))

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

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

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

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

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

Solution (Python):

import math

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

def submit():
    a, b = read_input()

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


if __name__ == '__main__':
    submit()

Solution (Python):
a,b=map(int,input().split())
print((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):
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.99999))

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

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

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())
c = (a+b) / 2
print(math.ceil(c))

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 = [int(i) for i 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 = list(map(int, input().split()))
print(math.ceil((a + b) / 2))

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

Solution (Python):
import sys






"""Template"""


class IP:
    """
    入力を取得するクラス
    """

    def __init__(self):
        self.input = sys.stdin.readline

    def I(self):
        """
        1文字の取得に使います
        :return: int
        """
        return int(self.input())

    def S(self):
        """
        1文字の取得(str
        :return: str
        """
        return self.input()

    def IL(self):
        """
        1行を空白で区切りリストにします(int
        :return: リスト
        """
        return list(map(int, self.input().split()))

    def SL(self):
        """
        1行の文字列を空白区切りでリストにします
        :return: リスト
        """
        return list(map(str, self.input().split()))

    def ILS(self, n):
        """
        1列丸々取得します(int
        :param n: 行数
        :return: リスト
        """
        return [int(self.input()) for _ in range(n)]

    def SLS(self, n):
        """
        1列丸々取得します（str
        :param n: 行数
        :return: リスト
        """
        return [self.input() for _ in range(n)]

    def SILS(self, n):
        """
        Some Int LineS
        横に複数、縦にも複数
        :param n: 行数
        :return: list
        """
        return [self.IL() for _ in range(n)]

    def SSLS(self, n):
        """
        Some String LineS
        :param n: 行数
        :return: list
        """
        return [self.SL() for _ in range(n)]


class Idea:
    def __init__(self):
        pass

    def HF(self, p):
        """
        Half enumeration
        半分全列挙です
        pの要素の和の組み合わせを作ります。
        ソート、重複削除行います
        :param p: list : 元となるリスト
        :return: list : 組み合わせられた和のリスト
        """
        return sorted(set(p[i] + p[j] for i in range(len(p)) for j in range(i, len(p))))

    def Bfs2(self, a):
        """
        bit_full_search2
        bit全探索の改良版
        全探索させたら2進数のリストと10進数のリストを返す
        :return: list２つ : １個目 2進数(16桁)  2個目 10進数
        """
        
        
        
        value = []
        for i in range(1 << len(a)):
            output = []

            for j in range(len(a)):
                if self.bit_o(i, j):
                    """右からj+1番目のiが1かどうか判定"""
                    
                    output.append(a[j])
            value.append([format(i, 'b').zfill(16), sum(output)])

        value.sort(key=lambda x: x[1])
        bin = [value[k][0] for k in range(len(value))]
        val = [value[k][1] for k in range(len(value))]
        return bin, val

    def S(self, s, r=0, m=-1):
        """
        ソート関係行います。色々な設定あります。
        :param s: 元となるリスト
        :param r: reversするかどうか 0=False 1=True
        :param m: （2次元配列）何番目のインデックスのソートなのか
        :return: None
        """
        r = bool(r)
        if m == -1:
            s.sort(reverse=r)
        else:
            s.sort(reverse=r, key=lambda x: x[m])

    def bit_n(self, a, b):
        """
        bit探索で使います。0以上のときにTrue出します
        自然数だからn
        :param a: int
        :param b: int
        :return: bool
        """
        return bool((a >> b & 1) > 0)

    def bit_o(self, a, b):
        """
        bit探索で使います。1のときにTrue出すよ
        oneで1
        :param a: int
        :param b: int
        :return: bool
        """
        return bool(((a >> b) & 1) == 1)

    def ceil(self, x, y):
        """
        Round up
        小数点切り上げ割り算
        :param x: int
        :param y: int
        :return: int
        """
        return -(-x // y)

    def ave(self, a):
        """
        平均を求めます
        :param a: list
        :return: int
        """
        return sum(a) / len(a)

    def gcd(self, x, y):
        if y == 0:
            return x
        else:
            return self.gcd(y, x % y)


"""ここからメインコード"""


def main():
    
    r, e, p = range, enumerate, print
    ip = IP()
    id = Idea()
    mod = 10 ** 9 + 7

    """この下から書いてね"""
    a, b = ip.IL()
    p(id.ceil(a + b, 2))



main()

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

ans = (a+b)/2

print(math.ceil(ans))

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

Solution (Python):
in_list = input().split()

mean = (int(in_list[0])+int(in_list[1]))/2

if (mean-int(mean))==0:
    print(int(mean))
else:
    print(int(mean)+1)

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()))
print((a+b+1)//2)

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

Solution (Python):
import math
a,b = list(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):
a,b=map(int,input().split())
if (a+b)%2==1:
    print((a+b)//2+1)
else:
    print((a+b)//2)

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

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)
c=-((-a-b)//2)
print(c)

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

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

Solution (Python):
a = sum(int(i) for i in input().split())
print(a//2+a%2)

Solution (Python):
import math
print(math.ceil(sum([int(i) for i in input().split()] )/ 2))

Solution (Python):


import sys
import math


a,b = map(int, sys.stdin.readline().rstrip().split())
print(math.ceil(sum([a,b])/2))

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

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

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

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

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

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

Solution (Python):
import functools

import os

INF = float('inf')


def inp():
    return int(input())


def inpf():
    return float(input())


def inps():
    return input()


def inl():
    return list(map(int, input().split()))


def inlf():
    return list(map(float, input().split()))


def inls():
    return input().split()


def inpm(line):
    return [inp() for _ in range(line)]


def inpfm(line):
    return [inpf() for _ in range(line)]


def inpsm(line):
    return [inps() for _ in range(line)]


def inlm(line):
    return [inl() for _ in range(line)]


def inlfm(line):
    return [inlf() for _ in range(line)]


def inlsm(line):
    return [inls() for _ in range(line)]


def debug(fn):
    if not os.getenv('LOCAL'):
        return fn

    @functools.wraps(fn)
    def wrapper(*args, **kwargs):
        print('DEBUG: {}({}) -> '.format(
            fn.__name__,
            ', '.join(
                list(map(str, args)) +
                ['{}={}'.format(k, str(v)) for k, v in kwargs.items()]
            )
        ), end='')
        ret = fn(*args, **kwargs)
        print(ret)
        return ret

    return wrapper

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

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

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

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

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())
x = (a+b)/2
print(math.ceil(x))

Solution (Python):

from math import ceil

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

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

if x%2==0:
    print(x//2)
else:
    print((x+1)//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%2==1 and b%2==0:
    print((a+b)//2+1)
elif a%2==0 and b%2==1:
    print((a+b)//2+1)
else:
    print(int((a+b)/2))

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

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


print(ans)

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.5:
    print(int((a + b) / 2 + 1))
else:
    print(int((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())
if (a+b)%2==0:
	print((a+b)//2)
else:	
	print((a+b)//2+1)

Solution (Python):
import math
import statistics as st

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

print(math.ceil(st.mean((a,b))))

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

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

Solution (Python):
import math

a_b_str = input().split()
a_b_int = [int(s) for s in a_b_str]

a = a_b_int[0]
b = a_b_int[1]

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

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

Solution (Python):
a,b=[int(i) for i in input().split()]
round=lambda x:(x*2+1)//2
print(int(round(float((a+b)/2))))

Solution (Python):
import math

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

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