Problem:
 Score : 100 points    Problem Statement We have A apples and P pieces of apple.  We can cut an apple into three pieces of apple, and make one apple pie by simmering two pieces of apple in a pan.  Find the maximum number of apple pies we can make with what we have now.      Constraints  All values in input are integers.  0 \leq A, P \leq 100         Input Input is given from Standard Input in the following format:  A  P       Output Print the maximum number of apple pies we can make with what we have.        Sample Input 1 1 3      Sample Output 1 3  We can first make one apple pie by simmering two of the three pieces of apple. Then, we can make two more by simmering the remaining piece and three more pieces obtained by cutting the whole apple.       Sample Input 2 0 1      Sample Output 2 0  We cannot make an apple pie in this case, unfortunately.       Sample Input 3 32 21      Sample Output 3 58

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

print((A * 3 + P) // 2)

Solution (Python):
import math

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

print(math.floor((3 * a + p) / 2))

Solution (Python):
A, P = map(int, input().split())
P += A * 3
ans = P // 2
print(ans)

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

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

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

P += A*3

print(P//2)

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

print((A*3+P) // 2)

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

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

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

p += a * 3
print(p // 2)

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

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

Solution (Python):


A,P = map(int,input().split())
print((3*A + P)//2)

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

n = a * 3 + b

print(int(n // 2))

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

ans = (a*3+p)//2
print(ans)

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

print((A * 3 + P) // 2)

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

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

Solution (Python):
A, P = map(int, input().split())
PP = 3*A + P
print(PP//2)

Solution (Python):
a,p = map(int,input().split())
tmp = a * 3 + p
print(tmp//2)

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

P = P + 3*A

print(P//2)

Solution (Python):
a = input().rstrip().split(" ")
b = int(a[0])
c = int(a[1])
c = b*3 + c
print(int(c/2))

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

Solution (Python):
a,p=map(int, input().split())
hahen=a*3+p
print(hahen//2)

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

print((a * 3 + p) // 2)

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

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

P = P + A*3

apple_pie = 0

while  P>1:
    
    apple_pie = apple_pie + 1
    P = P - 2
    
print(apple_pie)

Solution (Python):
A, P = map(int, input().split())
a = 3 * A + P
print(a // 2)

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

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

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

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

P += A * 3

print(P // 2)

Solution (Python):
A, P = map(int,input().split())
Ap = 3*A+P
print(Ap//2)

Solution (Python):
def main():
    A, P = map(int, input().split())
    print((A*3+P)//2)
    
    
if __name__ == '__main__':
    main()

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

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

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

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

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

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

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

Solution (Python):
hole_apple, piece_apple = map(int, input().split())

total_piece_apple = hole_apple * 3 + piece_apple
print(total_piece_apple // 2)

Solution (Python):
a, p = map(int, input().split())
ans = (3 * a + p) // 2
print(ans)

Solution (Python):
def solver():
    A, P = [int(n) for n in input().split()]
    return (A*3+P)//2

if __name__=='__main__':
  print(solver())

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

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

print((a*3+p)//2)

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

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

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

apple_fragment = A * 3 + P
apple_pie = apple_fragment // 2

print(apple_pie)

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

ans=(3*a+p)//2
print(ans)

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

Solution (Python):
A, P = map(int, input().split())
ans = (3 * A + P) // 2
print(ans)

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

Solution (Python):
A,P=map(int,input().split())
s=A*3+P
print(s//2)

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

print(int(3*a + p)//2)

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

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

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

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

Solution (Python):
a, p = map(int, input().split())
k = a*3+p
print(k//2)

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

Solution (Python):

a,p=map(int,input().split())
a *= 3
a += p
print(a//2)

Solution (Python):
a,p = map(int,input().split())
apples = p + 3*a
print(apples//2)

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

ans = (A*3 + P)//2

print(ans)

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

Solution (Python):


a, p = map(int, input().split())
p = (a * 3) + p
print( p // 2)

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

Solution (Python):

import sys
sys.setrecursionlimit(10**9)


INF=10**20
def solve(A: int, P: int):
    ans = 3*A+P
    ans //= 2

    print(ans)
    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))  
    P = int(next(tokens))  
    solve(A, P)



if __name__ == "__main__":
    main()

Solution (Python):
def mapt(fn, *args):
    return tuple(map(fn, *args))


def Input():
    return mapt(int, input().split(" "))


def main():
    a, p = Input()
    x = a*3 + p
    ans = x//2
    print(ans)

main()

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

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

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

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

print((a * 3 + p) // 2)

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

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

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

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

print((A * 3 + P) // 2)

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

Solution (Python):
n,k=map(int,input().split())
s=n*3+k
print(s//2)

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

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

print((a*3+p)//2)

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

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

Solution (Python):
def main():
    A, P = map(int, input().split())

    pieces = 3 * A + P
    ans = pieces // 2

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
A,P = map(int,input().split())
pieces = A*3 + P
print(pieces//2)

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

Solution (Python):

import sys
import numpy as np


a,p = map(int, input().split())
numP = a * 3 + p
print(numP//2)

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

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

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

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

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

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

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

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

Solution (Python):
a,p=[int(x) for x in input().split()]
ans=(3*a+p)//2
print(ans)

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

Solution (Python):
A,P = (int(x) for x in input().split())

print((3 * A + P) // 2)

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

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

Solution (Python):
a,b = input().split(" ")
total = int(a)*3 + int(b)
print(total//2)

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

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

allpiece = 3*A + P

print(allpiece//2)

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

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

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

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

Solution (Python):
A,P = map (int, input ().split ())
x = A*3+P
print (round (x//2))

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

print((3*a+p)//2)

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

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

print( int(((a*3)+p)/2))

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

print(int((a*3+p)/2))

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

a_p=a*3
p_total=a_p+p
print(p_total//2)

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

print((a*3+p)//2)

Solution (Python):
a,p=map(int,input().split())
g=a*3+p
print(int(g/2))

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

Solution (Python):
a = [int(s) for s in input().split()]
b = int(a[0] * 3 + a[1])
print(int(b // 2))

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

Solution (Python):

def main():
    a, p = map(int, input().split())
    print((a * 3 + p) // 2)


if __name__ == "__main__":
    main()

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

Solution (Python):
a,p=map(int,input().split())
k=a*3+p
ans=k//2
print(ans)

Solution (Python):
a, p = map(int, input().split())
piece = p + 3*a
pie = piece // 2
print(pie)

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

print((a * 3 + p) // 2)

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

P = P + A*3

print(P//2)

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

Solution (Python):
a, p = map(int, input().split())
pieces_count = a * 3 + p
apple_pie = pieces_count // 2
print(apple_pie)

Solution (Python):
a,p = list(map(int, input("").split()))
an=3*a+p
an=an//2
print(an)

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

Solution (Python):
a,p = list(map(int, input("").split()))
suma  = 0
suma = (a * 3 + p) // 2
print(suma)

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

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

A, P = LI()


def main():
    ans = (3 * A + P) // 2
    print(ans)


if __name__ == "__main__":
    main()

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

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

print((3*a+p)//2)

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

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

Solution (Python):





a, p = map(int, input().strip().split())
res = (a * 3 + p) // 2
print(res)

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

print((A*3+P)//2)

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

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

Solution (Python):
a, p = list(map(int, input().split()))
print((3 * a + p) // 2)

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

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

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

sub_apple = 3*a + p
apple_pie = sub_apple//2
print(apple_pie)

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

Solution (Python):
A, P = map(int, input().split())
apple = 3*A + P

print(apple // 2)

Solution (Python):
import sys

stdin = sys.stdin
def ns(): return stdin.readline().rstrip()
def ni(): return int(stdin.readline().rstrip())
def nm(): return map(int, stdin.readline().split())
def nl(): return list(map(int, stdin.readline().split()))


a, p = nm()
p = p + a * 3
print(p // 2)

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

Solution (Python):
import math
A, P = map(int, input().split())

if 3*A + P < 2:
    print('0')
else:
    print(math.floor((3*A + P) / 2))

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

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

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

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

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

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

print((A*3+P)//2)

Solution (Python):
def main():
    import math
    a, p = map(int, input().split())
    print(math.floor((3*a + p)/ 2))





if __name__ == "__main__":
    main()

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

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

Solution (Python):







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

ans = (a*3+p)//2
print(ans)

Solution (Python):



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

z = (3*x + y) // 2


print(z)

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

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

a,p=I()
print((a*3+p)//2)

Solution (Python):
A, P = map(int, input().split(' '))
print((A * 3 + P) // 2)

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

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

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

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

Solution (Python):
a, p = map(int, input().split())
ans = (3*a + p) // 2
print(ans)

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

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

Solution (Python):
ary = list(map(lambda n: int(n), input().split(" ")))

print(int((ary[0] * 3 + ary[1])/2))

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

Solution (Python):
import sys

def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())

A,P= LI()

kakera = A * 3
print((P+kakera)//2)

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

Solution (Python):
import math
a,p=map(int, input().split())
ans=a*3+p
print(math.floor(ans/2))

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

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

Solution (Python):
a,p = map(int,input().split())
all_a =a*3+p
print(all_a//2)

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

print((A * 3 + P) // 2)

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

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

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

Solution (Python):
A,P = [int(i) for i in input().split()]
P = P + 3 * A
pi = P // 2
print(pi)

Solution (Python):
a,p=map(int,input().split())
k=3*a+p
ap=k//2
print(ap)

Solution (Python):
T,O = map(int,input().split())
T *= 3

if (T+O) /2 > 0:
  print(int((T+O)/2))
else:
  print("0")

Solution (Python):


def main():

    A, P = map(int, input().split())

    ans = (A * 3 + P) // 2

    print(ans)


if __name__ == "__main__":
    main()

Solution (Python):
n=input().split()
a=int(n[0])
b=int(n[1])
print(((a*3)+b)//2)

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

Solution (Python):















































global FLAG_LOG
FLAG_LOG = False


def log(value):
    
    
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    
    
    A, P = list(map(int, lines[0].split()))
    
    
    
    
    
    
    
    

    result = (A*3+P) // 2

    return [result]



def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines



def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['1 3']
        lines_export = [3]
    if pattern == 2:
        lines_input = ['0 1']
        lines_export = [0]
    if pattern == 3:
        lines_input = ['32 21']
        lines_export = [58]
    return lines_input, lines_export



def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode



def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    
    
    
    
    
    
    
    
    
    
    



if __name__ == '__main__':
    main()

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

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

Solution (Python):
n, k = (int(x) for x in input().split())

print(int((3*n+k)/2))

Solution (Python):
A, P = map(int, input().split())
print(P//2 + ((P%2+A*3)//2))

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

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

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

print((a * 3 + p) // 2)

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

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

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

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

Solution (Python):
if __name__ == '__main__':
	a,p = map(int,input().split())
	print((a*3+p) // 2)

Solution (Python):
import sys, math
from collections import defaultdict, deque, Counter
from bisect import bisect_left, bisect_right
from itertools import combinations, permutations, product
from heapq import heappush, heappop
from functools import lru_cache
input = sys.stdin.readline
rs = lambda: input().strip()
ri = lambda: int(input())
rl = lambda: list(map(int, input().split()))
mod = 1000000007
sys.setrecursionlimit(1000000)

A, P = rl()

print((A*3+P) // 2)

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

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

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

Solution (Python):


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

print((3*a+p)//2)

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

ans = (3*a + p)//2

print(ans)

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

print((P + A*3)//2)

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

P += 3 * A

x = int(P / 2)
print(x)

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

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

Solution (Python):
a,p = map(int, input().split())
tmp = a*3 + p
print(tmp // 2)

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

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

piece = A * 3
pie = (piece+P) // 2
print(pie)

Solution (Python):
a,p = map(int, input().split())
ans = (a*3+p)//2
print(ans)

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

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

Solution (Python):

def input2():
	return map(int,input().split())
  
a,p=input2()
ans=((a*3)+p)//2
print(ans)

Solution (Python):
a, p = map(int, input().split())
sump = p + a*3

print(sump//2)

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

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

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

Solution (Python):
import sys
A,P = map(int,input().split())

if not ( 0 <= A <= 100 and 0 <= P <= 100 ): sys.exit()

print( (A * 3 + P) // 2)

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

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

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

Solution (Python):
def main():
 a,p = map(int,input().split())
 print((a * 3 + p) // 2)
main()

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

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

print(int((A*3+P)//2))

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

print((P+A*3)//2)

Solution (Python):
A, P = list(map(int, input().split()))
P += A * 3

print(P // 2)

Solution (Python):
a, p = map(int, input().split())
total = a * 3.0 + p
res = int(total // 2)
print(res)

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

print((a * 3 + p) // 2)

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

Solution (Python):
s = input().split(" ")
a,b = int(s[0]), int(s[1])
if (a*3 + b) % 2 == 0:
  print(int((a*3 + b)/2))
else:
  print(int((a*3 + b - 1)/2))

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

total = A*3+P
print(int(total/2))

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

p = p + a*3

print(p//2)

Solution (Python):
a,p = map(int,input().split())
p += a * 3
print(round(p // 2))

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

Solution (Python):
data=input().split()
A=int(data[0])
P=int(data[1])
ans_pre=3*A+P
ans=ans_pre//2
print(ans)

Solution (Python):
A,P=map(int,input().split())
total=3*A+P
print(int(total/2))

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

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

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

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

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

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

Solution (Python):
a,p = map(int, input().split())
print(int(((3*a+p)-(3*a+p)%2)/2))

Solution (Python):
A, P = map(int,input().split())
ans = 3*A +P
print(ans//2)

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

print((3*a+p)//2)

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

def main():
    a, p = map(int, input().split())
    print((a * 3 + p) // 2)
    
if __name__ == '__main__':
    main()

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

Solution (Python):
A, P = map(int, input().split())
P = 3 * A + P

print(int(P / 2))

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

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

A,P = list(map(int,input().split()))

print((A*3+P)//2)

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

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

while(a != 0):
    a -= 1
    p += 3

print(int(p / 2))

Solution (Python):
a,p = map(int,input().split())
sum = (a*3+p)/2
print(int(sum))

Solution (Python):
a,p = map(int,input().split())
ans = (a*3+p)/2
print(int(ans))

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

Solution (Python):
a,p=map(int, input().split())
n=a*3+p
print(int(n/2))

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

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

Solution (Python):
A, P = map(int, input().split())
P = P + A*3
ans = int(P//2)
print(ans)

Solution (Python):
import sys
sys.setrecursionlimit(10**7) 
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right

from collections import deque, defaultdict


from collections import Counter

from itertools import accumulate,combinations,permutations

from heapq import heapify,heappop,heappush


from functools import reduce,lru_cache

from decimal import Decimal

def input(): 
    x=sys.stdin.readline()
    return x[:-1] if x[-1]=="\n" else x
def printe(*x):print("
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def main():
    mod = 1000000007
    

    
    a,p = map(int, input().split())
    
    
    
    print((a*3+p)//2)





if __name__ == "__main__":
    main()

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

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

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

a, b = rm()
print((a*3 + b)//2)

Solution (Python):
a, p = map(int, input().split())
ans = (3 * a + p) // 2
print(ans)

Solution (Python):
def main():
    a,b=map(int,input().split(' '))
    print(int((a*3+b)/2))

main()

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

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

Solution (Python):
A,P = (int(x) for x in input().split())
print((3*A+P)//2)

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

apple = A*3 + P

print(apple // 2)