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



Sample input:
1 3


Sample output:
3

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#import numpy as np
def cin():
    return map(int, input().split())


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

Submission status: Accepted

Solution code:
#import numpy as np
def cin():
    return map(int, input().split())


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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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



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

Submission status: Accepted

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



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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

    apple, apple_piece = (int(val) for val in input().split())

    apple_piece += apple * 3
    apple_pie = int(apple_piece / 2)

    print(apple_pie)

if __name__ == '__main__':

    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
# gcd
from fractions import gcd
# 切り上げ，切り捨て
# from math import ceil, floor
# リストの真のコピー（変更が伝播しない）
# from copy import deepcopy
# 累積和。list(accumulate(A))としてAの累積和
from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', 'c', 'b', 'c', 'b', 'a']
# S = Counter(l)  # カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
# print(S.most_common(2))  # [('b', 5), ('c', 4)]
# print(S.keys())  # dict_keys(['a', 'b', 'c'])
# print(S.values())  # dict_values([3, 5, 4])
# print(S.items())  # dict_items([('a', 3), ('b', 5), ('c', 4)])
# from collections import Counter
# import math
# from functools import reduce
#
# input関係の定義
# fin = open('in_1.txt', 'r')
# sys.stdin = fin
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


if __name__ == '__main__':

    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    P = int(next(tokens))  # type: int

    # write code
    P += 3 * A
    print(P//2)

Submission status: Accepted

Solution code:
import sys
# gcd
from fractions import gcd
# 切り上げ，切り捨て
# from math import ceil, floor
# リストの真のコピー（変更が伝播しない）
# from copy import deepcopy
# 累積和。list(accumulate(A))としてAの累積和
from itertools import accumulate
# l = ['a', 'b', 'b', 'c', 'b', 'a', 'c', 'c', 'b', 'c', 'b', 'a']
# S = Counter(l)  # カウンタークラスが作られる。S=Counter({'b': 5, 'c': 4, 'a': 3})
# print(S.most_common(2))  # [('b', 5), ('c', 4)]
# print(S.keys())  # dict_keys(['a', 'b', 'c'])
# print(S.values())  # dict_values([3, 5, 4])
# print(S.items())  # dict_items([('a', 3), ('b', 5), ('c', 4)])
# from collections import Counter
# import math
# from functools import reduce
#
# input関係の定義
# fin = open('in_1.txt', 'r')
# sys.stdin = fin
input = sys.stdin.readline
def ii(): return int(input())
def mi(): return map(int, input().rstrip().split())
def lmi(): return list(map(int, input().rstrip().split()))
def li(): return list(input().rstrip())
# template


def iterate_tokens():
    for line in sys.stdin:
        for word in line.split():
            yield word


if __name__ == '__main__':

    tokens = iterate_tokens()
    A = int(next(tokens))  # type: int
    P = int(next(tokens))  # type: int

    # write code
    P += 3 * A
    print(P//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/Library/Frameworks/Python.framework/Versions/3.5/bin/python3

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import math


def main():
    inp = input().split()
    a = int(inp[0])
    p = int(inp[1])
    return math.floor((a * 3 + p) / 2)


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

s = input().split()
A = int(s[0])
P = int(s[1])

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

Submission status: Accepted

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

p_all = a*3 + p
max_pi = p_all // 2

print(max_pi)

Submission status: Accepted

Solution code:

a, p = [int(e) for e in input().split()]
pieces = a*3 + p

print(int(pieces/2))

Submission status: Accepted

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

Submission status: Accepted

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

s = 3*a + p
pies = s // 2

print(pies)

Submission status: Accepted

Solution code:
import math
a,p = list(map(int,input().split()))

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

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
A_pi = 1.5 * A
P_pi = P / 2.0
pi = int(A_pi + P_pi)
print(pi)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
"""
Created on Sun Jun  9 13:38:41 2019

@author: YudNK
"""

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
A, P = map(int, input().strip().split(' '))

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

Submission status: Accepted

Solution code:
i = map(int, raw_input().split())
print(int((i[0]*3+i[1]))/2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

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

Submission status: Accepted

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

pie=0
kakera=0

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

Submission status: Accepted

Solution code:
#!/usr/local/bin/python3
import sys, os

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

def solve():

    'ss'
    a, p = f()
    print((a*3 +p)//2)

solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
apple, frag = map(int, input().split())
         
pie = ((apple*3) + frag) / 2
         
print(int(pie))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
apple, piece = map(int, input().split())
print((apple*3+piece)//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, p = (int(e) for e in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#! /usr/bin/env python3
# -*- coding: utf-8 -*-

a = input()
b = a.split()
c,d =b
A=int(c)
P = int(d)

e = 3*A+P

answer = e//2

print(answer)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
apple_one, apple_kakera = (int(i) for i in input().split())  
apple_kakera += apple_one * 3
print(math.floor(apple_kakera / 2) )

Submission status: Accepted

Solution code:
import math


def main(x,y):
    P = 3*x+y
    num = math.floor(P/2)
    print(num)


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

Submission status: Accepted

Solution code:
N = input()
N = N.split()
A = int(N[0])
P = int(N[1])
W = 0

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A, B= [int(x) for x in stdin.readline().rstrip().split()]
C = (A*3+B)//2
print(C)

Submission status: Accepted

Solution code:
# A 
# Apple Pie

a_p = input()

a = a_p.split(" ")[0]
p = a_p.split(" ")[1]

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

Submission status: Accepted

Solution code:
a, p = map(int, input().split())
c = int((3*a+p) / 2)
print("{}".format(c))

Submission status: Accepted

Solution code:
import math

a,p = (int(i) for i in input().split(" "))

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

total = A*3 + P

print(total//2)

Submission status: Accepted

Solution code:
str = input().split()

a = int(str[0])
p = int(str[1])

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A,PA = map(int,input().split())
PA += A*3
AP = PA/2
print(int(AP))

Submission status: Accepted

Solution code:
# a,pに値が代入される
a,p = map(int,input().split())

# a個の林檎が0の場合、pの欠片分で計算
if a == 0:
 print(p // 2)
# a個の林檎が0以外の場合、a個の林檎からできる欠片分とpの欠片分を足して計算
else:
  print(((a * 3) + p) // 2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a,p = input().split()
A = int(a)
P = int(p)
total_p = A * 3 + P
print(int(total_p / 2))

Submission status: Accepted

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

print(int(c))

Submission status: Accepted

Solution code:
A,P = input().split()
p = 3*int(A) + int(P)
pi_num = p//2
print(pi_num)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a,p=map(int,input().split())
p=p+3*a
print(p//2)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

pieces = A * 3 + P

apple_pie = pieces // 2

print(apple_pie)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# your code goes here
import math
a, p = map(int, input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Jun  5 09:53:48 2019

@author: Enya
"""

input_code = input()
A = int(input_code.split()[0])
P = int(input_code.split()[1])

X = A*3 + P

print(X//2)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(sum([v*3**(1-i)for i,v in enumerate(map(int,input().split()))])//2)

Submission status: Accepted

Solution code:
import math
from sys import stdin, stdout

readline = stdin.readline
write = stdout.write
a, p = map(int, readline().split())
write('{}\n'.format(math.floor(((a * 3) + p) / 2)))

Submission status: Accepted

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

ap_piece = A*3+P

max_pi = ap_piece//2

print(max_pi)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
a,p = map(int,input().split())
print((a*3+p)//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
ri = lambda: int(input())
rl = lambda: list(map(int,input().split()))
rr = lambda N: [ri() for _ in range(N)]
YN = lambda b: print('YES') if b else print('NO')
yn = lambda b: print('Yes') if b else print('No')
OE = lambda x: print('Odd') if x%2 else print('Even')
INF = 10**18
MOD=10**9+7

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, p = map(int, input().split())

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

Submission status: Accepted

Solution code:
a,p = (int(x) for x in input().split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
A, P= input().split()
A = int(A)
P = int(P)
x = (3 * A + P) // 2
print(x)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

for l in sys.stdin:
  a, p = l.rstrip('\n').split(' ')
pies = (int(a) * 3 + int(p)) //2
print(pies)

Submission status: Accepted

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

z=3*x+y
a=(z-z%2)/2

print(int(a))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
apple, peace = map(int, input().split())
print((apple * 3 + peace) // 2)

Submission status: Accepted

Solution code:
data=input().split()
sum=int(data[0])*3+int(data[1])
print(sum//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python
def pie():
    a, b = raw_input().split(' ')
    pie = (int(a)*3 + int(b))/2
    return pie

print(pie())

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
argv = [int(i) for i in input().split()]

A = argv[0]
P = argv[1]
AP = A * 3

print(int((P + AP )/2))

Submission status: Accepted

Solution code:
import sys

def main():
    input = [int(n) for n in sys.stdin.readline().split()]

    pieces = input[0] * 3 + input[1]

    print(pieces // 2)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import math
input_data = input().split(' ')
input_data_int = [int(x) for x in input_data]
A = input_data_int[0]
P = input_data_int[1]
apple_pices = A * 3 + P

print(math.floor(apple_pices/2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nums = [int(e) for e in input().split()]

a = nums[0]
p = nums[1]

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

print(int(ans))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
#Python標準入出力

import numpy as np

# 1行に複数の文字列（数字）を取得，整数に直す
# In[0] = A, [1] = P
In = list(map(int, input().split()))

A = In[0]
P = In[1]

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

print(pie)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

fragment = 3 * A + P

print(fragment // 2)

Submission status: Accepted

Solution code:
z=list(map(int,input().split()))
a=z[0]
p=z[1]
cut=a*3+p
rest=cut%2
pie=int((cut-rest)/2)
print(pie)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n=input().split(" ")
A=int(n[0])
P=int(n[1])

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#りんごの数とかけらの数
A, P = map(int, input().split())
#合計のかけらの数
sum_p = A*3 + P
print(sum_p // 2)

Submission status: Accepted

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

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

print(result)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3.4

# abc128_a

def main():
    # Input
    a, p = [int(s) for s in input().split()]
    # Get ans
    p += a*3
    ans = p//2
    # Output
    print(ans)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
A, P = map(int, input().split())
p = 0
if A >= 1:
      p += A * 3  

p += P
print(p // 2)

Submission status: Accepted

Solution code:
import math

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

print(math.floor((A * 3 + P) / 2))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

pieces = P + (A * 3)

print(pieces // 2)

Submission status: Accepted

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

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
A, P = map(int, input().split())
print(math.floor((A * 3 + P) / 2))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
arg = stdin.readline().rstrip().split()
a = int(arg[0])
p = int(arg[1])
a1 = a*3
print (int((a1+p)/2))

Submission status: Accepted

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

b += 3 * a

print(b // 2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
a, b = map(int, input().split())
print((3*a+b)//2)

Submission status: Accepted

Solution code:
import sys

a, p = map(int, sys.stdin.readlines()[0].strip().split())
print((p + a * 3) // 2)

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-

[A, P] = [int(i) for i in input().split()]

piece_number = A * 3 + P

pie_number = piece_number // 2

print(pie_number)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a, p = [int(val) for val in input().split()]

piece = 3 * a + p
pie = piece // 2

print(pie)

Submission status: Accepted

Solution code:
a,b=map(int,input().split())
d=0
c=a*3
if c>=1:
    d=(c+b)//2
elif c==0 and b>1:
    d=b//2
print(int(d))

Submission status: Accepted

Solution code:
new_str = input()
new_list = new_str.split(" ")
a = int(new_list[0])
b = int(new_list[1])
sum = a*3+b
sum = int(sum/2)
print(sum)

Submission status: Accepted

Solution code:

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

p=3*a+p

ap=int(p/2)

print(ap)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A, P = map(float, input().split())

ans = (A * 3 + P)/2

print (int(ans))

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math

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

apple = 3 * a + p

ans = (math.floor(apple / 2))

print(ans)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
str = input().split()
A = int(str[0])
P = int(str[1])

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

Submission status: Accepted

Solution code:
def method1():
    nums = list(map(int, input().split()))
    result = int((nums[0]*3 + nums[1])/2)
    print(result)



if __name__ == "__main__":
    method1()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve(a, p):
    return (a * 3 + p) // 2

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A, P = nl()
print((A*3+P)//2)

Submission status: Accepted

Solution code:

nl = lambda: list(map(int, input().split()))
sl = lambda: input().split()
n = lambda: int(input())
s = lambda: input()

A, P = nl()
print((A*3+P)//2)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

a, p = map(int,sys.stdin.readline().rstrip().split())

print (a * 3 + p) // 2

Submission status: Accepted

Solution code:
a, p = [int(elem) for elem in input().split()]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding utf-8 -*-
A, P = map(int, input().split())

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Thu May 30 17:13:37 2019

@author: またの
"""

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

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

print(ans)

Submission status: Accepted

Solution code:
import sys, os

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

def solve():
    a, p = f()
    print((a*3 +p)//2)

solve()

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    _input = input().split()

    pie = int((int(_input[0]) * 3 + int(_input[1]))/2)
    print(pie)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!usr/bin/env python3
from collections import defaultdict
from collections import deque
from heapq import heappush, heappop
import sys
import math
import bisect
import random
import itertools
sys.setrecursionlimit(10**5)
stdin = sys.stdin
bisect_left = bisect.bisect_left
bisect_right = bisect.bisect_right
def LI(): return list(map(int, stdin.readline().split()))
def LF(): return list(map(float, stdin.readline().split()))
def LI_(): return list(map(lambda x: int(x)-1, stdin.readline().split()))
def II(): return int(stdin.readline())
def IF(): return float(stdin.readline())
def LS(): return list(map(list, stdin.readline().split()))
def S(): return list(stdin.readline().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#A
def A():
    a, p = LI()
    print((a*3+p)//2)
    return

#B
def B():
    return

#C
def C():
    return

#D
def D():
    return

#E
def E():
    return

#F
def F():
    return

#G
def G():
    return

#H
def H():
    return

#Solve
if __name__ == '__main__':
    A()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-

import sys

input = sys.stdin.readline

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

main()

Submission status: Accepted

Solution code:
A,P=map(int,input().split())
#print(3*A)
#print(P)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#ABC 128 A
A,P=map(int,input().split())
print((A*3+P)//2)