from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

a,p = inpl()
print((a*3+p)//2) from collections import Counter,defaultdict,deque from heapq import heappop,heappush,heapify import sys,bisect,math,itertools,fractions,pprint sys bisect math itertools fractions pprint sys.setrecursionlimit(10**8) sys.setrecursionlimit sys setrecursionlimit 10**8 10 8 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 mod2 = 998244353 mod2 998244353 INF = float('inf') INF float('inf') float 'inf' def inp(): return int(sys.stdin.readline()) inp def inpl(): return list(map(int, sys.stdin.readline().split())) inpl def inpln(n): return list(int(sys.stdin.readline()) for i in range(n)) inpln n n a,p = inpl() a inpl() inpl p print((a*3+p)//2) print (a*3+p)//2 a*3+p a*3 a 3 p 2 def inpl(): return list(map(int, sys.stdin.readline().split())) def inpl(): return list(map(int, sys.stdin.readline().split())) inpl mod = 10**9+7 10**9+7 mod def inpln(n): return list(int(sys.stdin.readline()) for i in range(n)) def inpln(n): return list(int(sys.stdin.readline()) for i in range(n)) inpln a,p = inpl() inpl() a mod2 = 998244353 998244353 mod2 def inp(): return int(sys.stdin.readline()) def inp(): return int(sys.stdin.readline()) inp INF = float('inf') float('inf') INF p = inpl() inpl() p
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
mod2 = 998244353
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
def inpln(n): return list(int(sys.stdin.readline()) for i in range(n))

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