Problem:
 Score: 100 points    Problem Statement There is a train going from Station A to Station B that costs X yen (the currency of Japan).  Also, there is a bus going from Station B to Station C that costs Y yen.  Joisino got a special ticket. With this ticket, she can take the bus for half the fare if she travels from Station A to Station B by train and then travels from Station B to Station C by bus.  How much does it cost to travel from Station A to Station C if she uses this ticket?      Constraints  1 \leq X,Y \leq 100  Y is an even number.  All values in input are integers.         Input Input is given from Standard Input in the following format:  X  Y       Output If it costs x yen to travel from Station A to Station C , print x .        Sample Input 1 81 58      Sample Output 1 110   The train fare is 81 yen.  The train fare is 58 ⁄ 2=29 yen with the 50 % discount.   Thus, it costs 110 yen to travel from Station A to Station C .       Sample Input 2 4 54      Sample Output 2 31

Solution (Python):


X, Y = map(int, input().split())
print(X + Y // 2)

Solution (Python):
def main():
    X, Y = map(int, input().split())
    print(X + (Y >> 1))


if __name__ == '__main__':
    main()

Solution (Python):


X, Y = map(int, input().split())

print(X + Y//2)

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

Solution (Python):
import itertools
import math
import fractions
import functools
import copy

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

Solution (Python):
X, Y = map(int, input().split())
print(int(X+Y/2))

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

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

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

Solution (Python):
import math
import string
import collections
from collections import Counter


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


def nCr(n, r):
    return math.factorial(n)//(math.factorial(n-r)*math.factorial(r))


def has_duplicates2(seq):
    seen = []
    for item in seq:
        if not(item in seen):
            seen.append(item)
    return len(seq) != len(seen)


def divisor(n):
    divisor = []
    for i in range(1, n+1):
        if n % i == 0:
            divisor.append(i)
    return divisor



dx = [-1, -1, -1, 0, 0, 1, 1, 1]
dy = [-1, 0, 1, -1, 1, -1, 0, 1]
x, y = map(int, input().split())
print(x+int(y/2))

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

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

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

ans = a +b//2

print(ans)

Solution (Python):

X, Y = map(int, input().split())

print(X + Y // 2)

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

Solution (Python):
N, M = map(int, input().split())
print(N+M//2)

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

print(x + y // 2)

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

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

Solution (Python):
X,Y= map(int,input().split())
print(int(X+Y/2))

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

if __name__ == '__main__':
    main()

Solution (Python):
import sys

sys.setrecursionlimit(10 ** 7)
f_inf = float('inf')
mod = 10 ** 9 + 7


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


if __name__ == '__main__':
    resolve()

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

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

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

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

Solution (Python):
from collections import defaultdict, deque, Counter
from heapq import heappush, heappop, heapify
from itertools import permutations, accumulate, combinations, combinations_with_replacement
from math import sqrt, ceil, floor, factorial
from bisect import bisect_left, bisect_right, insort_left, insort_right
from copy import deepcopy
from operator import itemgetter
from functools import reduce
from fractions import gcd
import sys
def input(): return sys.stdin.readline().rstrip()
def I(): return int(input())
def Is(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def TI(): return tuple(map(int, input().split()))
def IR(n): return [I() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def TIR(n): return [TI() for _ in range(n)]
def S(): return input()
def Ss(): return input().split()
def LS(): return list(input())
def SR(n): return [S() for _ in range(n)]
def SsR(n): return [Ss() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
sys.setrecursionlimit(10**6)
MOD = 10**9+7
INF = 10**18


x, y = Is()
print(x+y//2)

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

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

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

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

Solution (Python):
X, Y = map(int, input().split())
print(X + Y // 2)

Solution (Python):

"""
Created on Wed May 13 15:48:53 2020

@author: shinba
"""

x,y = map(int,input().split())

print(x+y//2)

Solution (Python):
X, Y = map(int, input().split())
print( X + Y // 2 )

Solution (Python):
X, Y = map(int, input().split())

print(X + Y//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)





X,Y = inputIL()

print(int(X+Y/2))

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

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

Solution (Python):
def main():
    x, y = map(int, input().split())
    ans = solve(x, y)
    print(ans)


def solve(x, y):
    ans = x + y // 2
    return ans


if __name__ == '__main__':
    main()

Solution (Python):
import sys
import math
import bisect

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

if __name__ == "__main__":
    main()

Solution (Python):
X,Y=map(int,input().split())
print(int(X+Y/2))

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

Solution (Python):
X, Y = map(int, input().split(' '))

print(X + Y // 2)

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

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

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

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

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

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

Solution (Python):
X,Y = map(int, input().split())

print(X + Y // 2)

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

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

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

Solution (Python):
def ABC_113_A():
    X,Y = map(int, input().split())
    print(int(X+Y/2))
   

if __name__ == '__main__':

    ABC_113_A()

Solution (Python):
X,Y=map(int,input().split())
print(X+int(Y/2))

Solution (Python):
import sys

input = sys.stdin.readline


def main():
    X, Y = map(int, input().split())
    print(X + Y // 2)


if __name__ == "__main__":
    main()

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

Solution (Python):
X, Y = map(int, input().split())
print(int(X + Y / 2))

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

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X,Y = map(int, input().split())
print(X+Y//2)

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

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

Solution (Python):
X,Y=map(int,input().split())
print(X+Y//2)

Solution (Python):
X, Y = list(map(int,input().split()))
print(X + Y//2)

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

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

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

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

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

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

Solution (Python):

import sys


def solve(X: int, Y: int):
    print(X + Y // 2)


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


if __name__ == '__main__':
    main()

Solution (Python):
X,Y = map(int,input().split())
print(X+(Y//2))

Solution (Python):
X, Y = map(int, input().split())
print(X+(Y//2))

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

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

Solution (Python):
X, Y = map(int, input().split())
print(int(X + Y / 2))

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

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):


X, Y = map(int, input().split())

print(int(X+Y/2))

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

Solution (Python):


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

Solution (Python):

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

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

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

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

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

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

print(int(x + y/2))

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

Solution (Python):

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

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

Solution (Python):
X,Y=map(int,input().split())
print(int(X+Y/2))

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

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

Solution (Python):
X,Y = map(int,input().split())
print(X+Y//2)

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

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

Solution (Python):
X, Y = map(int, input().split())

print(X + Y // 2)

Solution (Python):
X,Y=map(int,input().split())
print(X+(Y//2))

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

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

resolve()

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

Solution (Python):

X, Y = map(int, input().split())
print(X+(Y//2))

Solution (Python):
X,Y = map(int, input().split())

print(X + Y//2)

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

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

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

Solution (Python):
import math
s = input().split()
x = int(s[0])
y = int(s[1])
print(x+math.floor(y/2))

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

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

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

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

Solution (Python):

import sys

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

X, Y = lr()
answer = X + Y // 2
print(answer)

Solution (Python):
X,Y=map(int, input().split())
print(X+Y//2)

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

Solution (Python):
x,y=map(int,input().split())
print(x + (y//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, groupby
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
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

X, Y = MAP()
print(X + Y//2)

Solution (Python):
X, Y = map(int, input().split())

print(X+Y//2)

Solution (Python):
def main():
    X, Y = map(int, input().split())
    print(X+Y//2)
if __name__ == "__main__":
    main()

Solution (Python):
X, Y = map(int, input().split())
print(X + Y // 2)

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

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

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

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

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

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

Solution (Python):
X,Y = map(int,input().split())
print(X+Y//2)

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

print(x+int(y/2))

Solution (Python):
X, Y = map(int, input().split())

print(X + Y // 2)

Solution (Python):
X, Y = map(int, input().split())
print(int(X+(Y/2)))

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

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

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

Solution (Python):

def solve():
    X, Y = map(int, input().split())
    print(X+(Y//2))


if __name__ == "__main__":
    solve()

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

print(int(x + y/2))

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

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

Solution (Python):

x, y = map(int, input().split()) 

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

Solution (Python):
X, Y = list(map(int,input().split()))
print(X+Y//2)

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

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

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

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

Solution (Python):
X, Y = map(int, input().split())

print(X + Y//2)

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X,Y=map(int,input().split())
print(X+Y//2)

Solution (Python):
X,Y  = map(int, input().split())

print(X+(Y//2))

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

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

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

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

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

Solution (Python):
X, Y = map(int,input().split())
print(X+Y//2)

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

print(math.floor(x + (y/2)))

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

X, Y = map(int, input().split())

print(X + Y//2)

Solution (Python):
icase=0
if icase==0:
    x,y=map(int,input().split())
    print(x+y//2)

Solution (Python):
def DiscountFare(x , y):

    return int(x + (y / 2))

def main():
    x , y = map(int , input().split())
    print(DiscountFare(x , y))

if __name__ == '__main__':
    main()

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

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

Solution (Python):
import math
import collections
import sys


def I(): return int(input())
def MI(): return map(int, input().split())
def LI(): return list(map(int, input().split()))
def LI2(): return [int(input()) for i in range(n)]
def MXI(): return [[LI()]for i in range(n)]

a,b=MI()
print(a+b//2)

Solution (Python):
n,m=map(int,input().split())
print(n+m//2)

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

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

Solution (Python):
import sys
X,Y=map(int,input().split())
ans=int(X+Y/2)
print(ans)

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

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

Solution (Python):
n,m = map(int,input().split())
print(n+(m//2))

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

Solution (Python):

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

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

print(x + y//2)

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

print(x+y//2)

Solution (Python):
X, Y = map(int, input().split())
cost = X + Y / 2
print(int(cost))

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

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

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

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

Solution (Python):
import sys
IS = lambda: sys.stdin.readline().rstrip()
II = lambda: int(IS())
MII = lambda: list(map(int, IS().split()))

def main():
    x, y = MII()
    print(x+y//2)

if __name__ == '__main__':
    main()

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X,Y=map(int,input().split())
print(X+(Y//2))

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

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

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

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

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

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

Solution (Python):
n,m=map(int,input().split())
print(int(n+m/2))

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X, Y = map(int, input().split())
print(int(X+(Y/2)))

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

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

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

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

Solution (Python):
X,Y = map(int,input().split())
print(X + Y // 2)

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

Solution (Python):
X,Y = map(int,input().split())

print(X + Y//2)

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

Solution (Python):
X, Y = map(int, input().split())
print(X+(Y//2))

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

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

Solution (Python):
X,Y = map(int, input().split())
print(int(X+(Y/2)))

Solution (Python):
X, Y = map(int,input().split())
print(X + Y // 2)

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

Solution (Python):

X, Y = map(int, input().split())
print(int(X + Y/2))

Solution (Python):
X,Y = map(int,input().split())
print(X+(Y//2))

Solution (Python):


import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
from itertools import permutations
mod = 10**9 + 7
inf = float('inf')
def I(): return int(sys.stdin.readline())
def LI(): return list(map(int,sys.stdin.readline().split()))

x,y = LI()
print(x+y//2)

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

print(x+int(y/2))

Solution (Python):
MOD = 10 ** 9 + 7
INF = 10 ** 10
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)

def main():
    x,y = map(int,input().split())
    print(x + y//2)
if __name__ =='__main__':
    main()

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

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

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

Solution (Python):
X,Y=map(int,input().split())

print(int(X+Y/2))

Solution (Python):

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

Solution (Python):
X, Y = map(int, input().split())
print(X + Y //2)

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

Solution (Python):
from collections import deque
from collections import Counter
from itertools import product, permutations,combinations
from operator import itemgetter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right, bisect




from fractions import gcd
from math import ceil,floor, sqrt, cos, sin, pi, factorial
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(10**8)
INF = float('inf')
from datetime import datetime as dt

def main():
  x, y = map(int, readline().split())
  print(x+y//2)
  
  
  
  
if __name__ == '__main__':
  main()

Solution (Python):
X,Y=map(int,input().split())
print(int(X+Y/2))

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

Solution (Python):

x, y = [int(s) for s in input().split()]
print(x + y // 2)

Solution (Python):
def main():
  
  
  
  a,b = list(map(int,input().split()))
  
  
  
  
  ans = 0
  count = 0
  lis = []
  
  print(a+b//2)

if __name__ == '__main__':
  main()

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

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

hanbus = y//2
ans = x + hanbus
print(ans)

Solution (Python):
import itertools
import fractions
def main():
  x,y = map(int,input().split())
  print(x + y//2)
if __name__ == '__main__':
  main()

Solution (Python):
def main():
    import sys
    input = sys.stdin.readline
    sys.setrecursionlimit(10**7)
    from collections import Counter, deque
    
    from itertools import combinations, permutations, accumulate, groupby
    
    from bisect import bisect_left,bisect_right
    import heapq
    from math import floor, ceil
    

    
    

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

if __name__ == '__main__':
    main()

Solution (Python):
X,Y = map(int,input().split(" "))
print(X+(Y//2))

Solution (Python):
import sys

x, y = map(int, sys.stdin.readline().split())

def main():
    res = x + y // 2
    print(res)

if __name__ ==  '__main__':
    main()

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

Solution (Python):
import sys
import copy
import math
import bisect
import pprint
import bisect
from functools import reduce
from copy import deepcopy
from collections import deque

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

    print(b+ c//2)

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

Solution (Python):
X,Y = map(int,input().split())
print(int(X+Y/2))

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

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

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

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

Solution (Python):
X,Y = map(int,input().split())
print(int(X+Y/2))

Solution (Python):
def main():
    from builtins import int, map, list, print
    import sys
    sys.setrecursionlimit(10 ** 6)

    input = sys.stdin.readline
    input_list = (lambda: input().rstrip().split())
    input_number = (lambda: int(input()))
    input_number_list = (lambda: list(map(int, input_list())))

    X,Y = input_number_list()
    print(X+Y//2)

if __name__ == '__main__':
    main()

Solution (Python):
x = list(map(int, input().split(' ')))
print(int(x[0]+x[1]/2))

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

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

Solution (Python):


X, Y = map(int, input().split())

ans = X + Y // 2
print(ans)

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

Solution (Python):
X,Y = map(int,input().split())
 
answer = int(X + Y / 2)

print(answer)

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

print(int(x+y/2))

Solution (Python):
X,Y = map(int,input().split())
 
print(int(X+Y/2))

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

Solution (Python):
X,Y = map(int, input().split())
print(X+Y//2)

Solution (Python):
X,Y = map(int,input().split())

print(X+Y//2)

Solution (Python):
X,Y = map(int,input().split())
print(int(X+(Y/2)))

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

print(x + y//2)

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

Solution (Python):
X,Y=map(int,input().split());print(X+Y//2)

Solution (Python):
X, Y = map(int, input().split())
print(int(X+Y/2))

Solution (Python):
X, Y = map(int, input().split())
print(X + Y // 2)

Solution (Python):
X,Y=map(int,input().split())
bus=Y/2
print(X+int(bus))

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

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

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

Solution (Python):

X, Y = [int(str) for str in input().strip().split()]
print(X + Y // 2)

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

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

Solution (Python):
X, Y = map(int, input().split())
print(X + Y // 2)

Solution (Python):
X,Y = map(int,(input().split()))
print(X+Y//2)

Solution (Python):
X,Y= map(int,input().split())

print(X+Y//2)

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

Solution (Python):
X, Y = map(int, input().split())
print(X+Y//2)

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

print(x + int(y / 2))

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

Solution (Python):
X,Y = map(int,input().split())
print(X + Y//2)

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

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

Solution (Python):
X,Y=map(int,input().split())

print(X+Y//2)

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

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

Solution (Python):
A, B = map(int, input().split())

print(A+B//2)

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

print(int(x + y / 2))

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

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

Solution (Python):


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

print(a + y // 2)

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

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

print(x + y//2)

Solution (Python):
def main():
    x, y = map(int, input().split())
    ans = x + y // 2
    print(ans)


if __name__ == "__main__":
    main()

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

Solution (Python):
X,Y = map(int, input().split())

print(X + Y // 2)

Solution (Python):
X,Y = map(int, input().split())

print(X+Y//2)

Solution (Python):

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