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):
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
import math
import numpy as np
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
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 ** 9)
INF = 10**9
mod = 10**9+7

a,b = I()
print((a+b+1)//2)

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

Solution (Python):
import numpy as np

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

print(int(np.ceil(np.mean(Alist))))

Solution (Python):
import math

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

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

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

ab = a + b

x = ab // 2

xmod = ab % 2

if (xmod == 0):
    print(x)

else:
    print(x + 1)

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

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

print(x)

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

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

Solution (Python):
import math
a= list(map(int,input().split()))
print(math.ceil(sum(a) / 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 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):
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i for _ in range(j)]





A, B = mi()
print((A+B+1)//2)

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

Solution (Python):
print((eval(input().replace(" ","+"))+1)//2)

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

Solution (Python):
import math

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

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

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

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

Solution (Python):
import sys
INF = 1 << 60
MOD = 10**9 + 7 
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
def resolve():
    a, b = map(int, input().split())
    print((a + b + 1) // 2)
resolve()

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

Solution (Python):
import math

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

Solution (Python):


import bisect
from collections import Counter, deque, defaultdict
from copy import deepcopy
from fractions import gcd
from functools import reduce
from heapq import heappush, heappop
import itertools
import math
import sys

def input(): return sys.stdin.readline()
def iIn(): return int(input())
def iInM(): return map(int, input().split())
def iInM1(): return map(int1, input().split())
def iInLH(): return list(map(int, input().split()))
def iInLH1(): return list(map(int1, input().split()))
def iInLV(n): return [iIn() for _ in range(n)]
def iInLV1(n): return [iIn()-1 for _ in range(n)]
def iInLD(n): return [iInLH() for _ in range(n)]
def iInLD1(n): return [iInLH1() for _ in range(n)]
def sInLH(): return list(input().split())
def sInLV(n): return [input().rstrip('\n') for _ in range(n)]
def sInLD(n): return [sInLH() for _ in range(n)]



sys.setrecursionlimit(10 ** 6)

int1 = lambda x: int(x) - 1



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

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

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

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

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

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

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

Solution (Python):
from math import ceil
a, b = [int(x) for x in 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):
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 sys

input = sys.stdin.readline


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

    x = (a + b) / 2
    if x.is_integer():
        ans = int(x)
    else:
        ans = int(x) + 1

    print(ans)


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


def actual(a, b):
    mean = (a + b) / 2

    return math.ceil(mean)

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

Solution (Python):
print((sum(list(map(int, input().split()))) + 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())
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):
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(list(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(' '))

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

Solution (Python):
import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
a, b = M()
print(math.ceil((a+b)/2))

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

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())
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):
import numpy as np
A,B = map(int,input().split())
ans = int(np.ceil((A+B)/2))
print(ans)

Solution (Python):
import math
a,b=[int(i) for i in 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())

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)/2
if x*10%10==5:
    print(int(x*10//10+1))
else:
    print(int(x))

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

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

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

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

Solution (Python):
n,k = map(int, input().split())

print((n+k)//2+(n+k)%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) // 2))

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

Solution (Python):
import math

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

Solution (Python):
a,b =  list(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 math

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

c=(a+b)/2

print(math.ceil(c))

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)

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

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

print(x)

Solution (Python):
print(eval('-(-('+input().replace(' ','+')+')//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):
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):
a,b=map(int,input().split())

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

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

print(m)

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(int(ave+0.5))

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

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

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

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

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

Solution (Python):


import sys






























def main():
    mod = 1000000007                
    inf = float('inf')              
    
    sys.setrecursionlimit(10**6)    
    def input(): return sys.stdin.readline().rstrip()
    def ii():    return int(input())
    def mi():    return map(int, input().split())
    def mi_0():  return map(lambda x: int(x)-1, input().split())
    def lmi():   return list(map(int, input().split()))
    def lmi_0(): return list(map(lambda x: int(x)-1, input().split()))
    def li():    return list(input())
    
    
    a, b = mi()
    if (a + b) % 2 == 0:
        print((a + b) // 2)
    else:
        print((a + b) // 2 + 1)


if __name__ == "__main__":
    main()

Solution (Python):

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

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

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

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

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

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

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

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

n = (a+b) / 2

print(math.ceil(n))

Solution (Python):
import math
x = input().split()
a = int(x[0])
b = int(x[1])
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 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())

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

print(x)

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

s=a+b
ss=s//2
s2=s%2

if s2==1:
    print(ss+1)
    exit()
print(ss)

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

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

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

Solution (Python):
import sys
import math
 
sys.setrecursionlimit(10 ** 8)
input = sys.stdin.readline
 
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())
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):
x, y = map(int, input().split())
if (x + y) % 2 != 0:
    print((x + y) // 2 + 1)
else:
    print((x + y) // 2)

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

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

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

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

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

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

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

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

print(mu)

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

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

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

Solution (Python):

total = sum(map(int, input().split()))
print(-(-total // 2))

Solution (Python):
import math

def main():
    nums = [int(x) for x in input().split()]
    ave = sum(nums)/len(nums)
    print(math.ceil(ave))

if __name__=='__main__':
    main()

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

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

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

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

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

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

print(c)

Solution (Python):
import sys
sys.setrecursionlimit(10 ** 5 + 10)
def input(): return sys.stdin.readline().strip()

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

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

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

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

Solution (Python):






import sys
input = sys.stdin.readline

import math
from collections import deque
from fractions import gcd
from functools import lru_cache






MOD = 10**9+7
INF = float('inf')






def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]


def inv(n): return pow(n, MOD-2, MOD)


kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr


def lcm(a, b):
    return a * b // gcd (a, b)




a,b = inputIL()

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 sys
sys.setrecursionlimit(10**9)
INF=10**18
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
YesNo=lambda b: bool([print('Yes')] if b else print('No'))
YESNO=lambda b: bool([print('YES')] if b else print('NO'))
int1=lambda x:int(x)-1

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import bisect

def main():
    a, b = map(int, input().split())
    ans = (a + b + 1) // 2
    print(ans)
    
if __name__ == "__main__":
    main()

Solution (Python):


import math

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

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

if __name__ == '__main__':
    main()

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

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

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

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

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
C=math.ceil((A+B)/2)
print(int(C))

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):
s = input().split()
a = int(s[0])
b = int(s[1])
result = int((a + b + 1) / 2)

print(result)

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

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

Solution (Python):
import math

def resolve():
	n = list(map(int, input().split()))
	print(math.ceil(sum(n)/2))
resolve()

Solution (Python):
import math

def makelist(n, m):
    return [[0 for _ in range(m)] for _ in range(n)]





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

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

if __name__ == '__main__':

    ABC_82_A()

Solution (Python):
from math import ceil

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

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

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

Solution (Python):
from math import ceil

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

if __name__ == '__main__':
    main()

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 = 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 sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumulate, groupby, product, permutations, combinations, combinations_with_replacement
from math import ceil, floor, factorial, log, sqrt, sin, cos
from operator import itemgetter
from string import ascii_lowercase, ascii_uppercase, digits
sys.setrecursionlimit(10**7)
rs = lambda: sys.stdin.readline().rstrip()
ri = lambda: int(rs())
rf = lambda: float(rs())
rs_ = lambda: [_ for _ in rs().split()]
ri_ = lambda: [int(_) for _ in rs().split()]
rf_ = lambda: [float(_) for _ in rs().split()]
INF = float('inf')
MOD = 10 ** 9 + 7
PI = math.pi

a, b = ri_()
print(ceil((a + b) / 2))

Solution (Python):
def actual(a, b):
    return (a + b + 1) // 2


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

print(actual(a,b))

Solution (Python):
s = sum(map(int, input().split()))

d, m = divmod(s, 2)
if m != 0:
    d += 1
print(d)

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

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

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

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

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

Solution (Python):

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

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

Solution (Python):
from sys import stdin
import math


if __name__ == "__main__":
    _in = [_.rstrip() for _ in stdin.readlines()]
    a,b = list(map(int,_in[0].split(' ')))  
    
    cnt = math.ceil((a+b)/2)
    
    print(cnt)

Solution (Python):

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

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

x = (a+b)/2
ans = ceil(x)
print(ans)

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

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

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

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

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

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

Solution (Python):
a, b = map(int, input().split())
print(- (- (a + 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):
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
import itertools
sys.setrecursionlimit(1000000000)
from heapq import heapify,heappop,heappush,heappushpop
import math
import collections

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

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

Solution (Python):
A = list(map(int,input().split()))
B = (A[0]+A[1])/2
if B > int(B):
  print(int(B)+1)
else:
  print(int(B))

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

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


print((data[0]+data[1]+2-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
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) / 2 + 1))