Problem:
 Score : 100 points    Problem Statement Takahashi, who is A years old, is riding a Ferris wheel.  It costs B yen ( B is an even number) to ride the Ferris wheel if you are 13 years old or older, but children between 6 and 12 years old (inclusive) can ride it for half the cost, and children who are 5 years old or younger are free of charge. (Yen is the currency of Japan.)  Find the cost of the Ferris wheel for Takahashi.      Constraints  0 ≤ A ≤ 100  2 ≤ B ≤ 1000  B is an even number.         Input Input is given from Standard Input in the following format:  A  B       Output Print the cost of the Ferris wheel for Takahashi.        Sample Input 1 30 100      Sample Output 1 100  Takahashi is 30 years old now, and the cost of the Ferris wheel is 100 yen.       Sample Input 2 12 100      Sample Output 2 50  Takahashi is 12 years old, and the cost of the Ferris wheel is the half of 100 yen, that is, 50 yen.       Sample Input 3 0 100      Sample Output 3 0  Takahashi is 0 years old, and he can ride the Ferris wheel for free.

Solution (Python):
a,b = map(int,input().split())
if a>= 13:
    print(b)
elif 6 <= a <= 12:
    print(b//2)
else:
    print("0")

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

if A >= 13:
  print(B)
elif A >= 6:
  print(B // 2)
else:
  print(0)

Solution (Python):
A,B=map(int, input().split())
if A>=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):
a, b= map(int, input().split())
if a >= 13:
    print(b)
elif a <= 5:
    print(0)
else:
    print(b//2)

Solution (Python):
a,b = map(int,input().split())
if a >= 13:
  print(b)
elif a >= 6:
  print(b//2)
else:
  print(0)

Solution (Python):
import sys
from collections import deque
import copy
import math
def get_read_func(fileobject):
    if fileobject == None :
        return raw_input
    else:
        return fileobject.readline



def main():
    if len(sys.argv) > 1:
        f = open(sys.argv[1])
    else:
        f = None
    read_func = get_read_func(f);
    input_raw = read_func().strip().split()
    [A, B] = [int(input_raw[0]), int(input_raw[1])]
    if A >= 13:
        print B
    elif A >= 6:
        print B/2
    else:
        print 0

if __name__ == '__main__':
    main()

Solution (Python):
A, B = map(int, input().split())
if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(int(B/2))
else:
    print(B)

Solution (Python):
a,b=map(int,input().split())
print(b if a>=13 else int(b/2) if a>=6 else 0)

Solution (Python):
a,b = map(int,input().split())
if a <= 12:
  b //= 2
if a <= 5:
  b = 0
print(b)

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

if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(int(B/2))
else:
    print(0)

Solution (Python):
import math
import functools
import itertools
import numpy as np
import sys
MAX_INT = int(10e10)
MIN_INT = -MAX_INT
mod = 1000000007
sys.setrecursionlimit(1000000)
def IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

A,B = IL()

if 6 <= A <= 12:
    B //= 2
if A <= 5:
    B = 0
print(B)

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

if A <= 5:
    print(0)
elif A <= 12:
    print(B//2)
else:
    print(B)

Solution (Python):



A, B = map(int, input().rstrip().split(' '))

if A <= 5:
    print(0)
elif A >= 6 and A <= 12:
    print(B // 2)
else:
    print(B)

Solution (Python):
A,B=map(int,input().split())
if A>=13:
    print(B)
elif 6<=A<=12:
    print(B//2)
else:
    print(0)

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0)

Solution (Python):
x,y = map(int,input().split())
if x>=13:
    print(y)
elif x >= 6:
    print(y//2)
else:
    print(0)

Solution (Python):
A,B=map(int,input().split())
if A<=5:
    print('0')
elif A<=12:
    print(int(B/2))
else:
    print(B)

Solution (Python):
a,b = map(int, input().split())
res=b
if a<=5:
    res=0
elif 6<=a<=12:
    res/=2

print(int(res))

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

if A >= 13:
    print(B)
elif A >= 6:
    print(B // 2)
else:
    print(0)

Solution (Python):

a, b = map(int, input().split())
if a >= 13:
    print(b)
elif a >= 6:
    print(int(b/2))
else:
    print(0)

Solution (Python):
a,b=[int(x) for x in input().split()]
if a<=5:
    print(0)
elif 6<=a<=12:
    print(b//2)
else:
    print(b)

Solution (Python):

















import math
import copy
from collections import defaultdict
from collections import Counter
from collections import deque

from itertools import product

from itertools import permutations

from itertools import combinations
from bisect import bisect_left, bisect_right


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


dy = [0, -1, 0, 1]
dx = [1, 0, -1, 0]

def i_inpl(): return int(input())
def s_inpl(): return map(int,input().split())
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")





A, B = l_inpl()

if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print(0)

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

if a >= 13:
    print(b)
elif a >= 6:
    print(b // 2)
else:
    print(0)

Solution (Python):
A,B = map(int, input().split())
if A>=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):
a,b=map(int,input().split())
if a<=5:ans=0
elif 6<=a<=12:ans=b*.5
else:ans=b
print(int(ans))

Solution (Python):
def main():
    A, B = map(int, input().split())
    if A >= 13:
        print(B)
    elif 6 <= A <= 12:
        print(B // 2)
    elif 5 >= A:
        print(0)


main()

Solution (Python):


import sys                                                      
sys.setrecursionlimit(10**6)                                    
from collections import deque, Counter                          
from itertools   import accumulate, permutations, combinations  
from operator    import itemgetter                              
from bisect      import bisect_left, bisect_right, bisect       
from heapq       import heappop, heappush                       
from fractions   import gcd                                     
from math        import ceil, floor, sqrt, cos, sin, tan, pi    
from copy        import deepcopy                                
import numpy         as np                                      


def main():
    
    im = InputManager()
    
    a, b = im.inputMultiple()
    
    if a>=13:
        print(b)
    elif a >= 6:
        print(b // 2)
    else:
        print(0)
    

    
    return


class InputManager(object):
    def __init__(self):
        pass

    @staticmethod
    def inputSingle(dtype=int):
        return dtype(input())
    
    @staticmethod
    def inputMultiple(dtype=int, aslist=False):
        if aslist:
            return list(map(dtype, input().split()))
        else:
            return map(dtype, input().split())

    @staticmethod
    def input2D(h, dtype=int):
        return [list(map(dtype, input().split())) for i in range(h)]


main()

Solution (Python):
A, B = map(int, input().split())
if A <= 5:
    print(0)
elif A <= 12:
    print(B//2)
else:
    print(B)

Solution (Python):
A, B = map(int, input().split())
if A<=5:
    print(0)
elif 6<=A<=12:
    print(int(B/2))
else:
    print(B)

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

if 13 <= A :
    print(B)
elif 6 <= A <= 12 :
    print(B // 2)
else :
    print(0)

Solution (Python):
A, B = [int(c) for c in input().split()]

if A>=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):


import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
MOD = 10 ** 9 + 7

A,B=MAP()

if A<=5:
    print(0)
elif 6<=A<=12:
    print(B//2)
else:
    print(B)

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
  print(b)
elif a >= 6 and a <= 12:
  print(b // 2)
else:
  print(0)

Solution (Python):
a,b = map(int, input().split())
if a <= 5:
    print(0)
elif 6 <= a <= 12:
    print(b//2)
else:
    print(b)

Solution (Python):
A, B = [int(x) for x in input().split()]

if A >= 13:
	print(B)
elif A >= 6 and A <= 12:
	print(int(B/2))
else:
	print(0)

Solution (Python):
A, B = map(int, input().split())
ans = 0
if A >= 13:
    ans = B
elif A >= 6:
    ans = int(B / 2)

print(ans)

Solution (Python):
a,b=map(int,input().split())
if a>=13:
  print(b)
elif 6<=a<=12:
  print(b//2)
else:
  print(0)

Solution (Python):
import sys
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x) - 1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def II(): return int(sys.stdin.readline())
def SI(): return input()

def main():
    A, B = LI()
    if A >= 13:
        ans = B
    elif A >= 6:
        ans = B // 2
    else:
        ans = 0
    return ans

print(main())

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A >=6:
    print(B//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A > 12:
    ans = B
elif 6 <= A <= 12:
    ans = int(B/2)
else:
    ans = 0
print(ans)

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

if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print(0)

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

if a>=13:
    print(b)
elif a>=6:
    print(b//2)
else:
    print(0)

Solution (Python):
from itertools import product
import bisect
import sys


def input():
    return sys.stdin.readline()[:-1]

a, b = map(int, input().split())
if a >= 13:
    print(b)
elif 6 <= a <= 12:
    print(int(b/2))
else:
    print(0)

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

if a>=13:
    print(b)
elif 12>=a>=6:
    print(b//2)
else:
    print(0)

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif a >= 6:
    print(b // 2)
else:
    print(0)

Solution (Python):
def main():
    A, B = map(int, input().split())
    if A <= 5:
        print(0)
    elif A <= 12:
        print(B//2)
    else:
        print(B)


if __name__ == "__main__":
    main()

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

if a >= 13:
    print(b)
if 6 <= a <= 12:
    print(b//2)
if  a <= 5:
    print(0)

Solution (Python):
A,B=map(int,input().split())
if A>=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if (A >= 13):
  print(B)
elif (A >= 6):
  print(B//2)
else:
  print(0)

Solution (Python):
listAB = list(map(int,input().split()))
A = listAB[0]
B = listAB[1]

if A>12:
    output = B
elif A>5:
    output = int(B/2)
else:
    output = 0

print(output)

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

a,b = li
if a<=5:
     print("0")
elif a<=12:
     print(b//2)
else:
     print(b)

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

if A >= 13:
    print(B)
elif A >= 6:
    print(int(B/2))
else:
    print(0)

Solution (Python):
a,b = map(int,input().split())
if a<=5:
    print(0)
elif 6<=a<=12:
    print(b//2)
else:
    print(b)

Solution (Python):
import sys
import collections
ns = lambda: sys.stdin.readline().rstrip()
ni = lambda: int(ns())
nm = lambda: map(int, sys.stdin.readline().split())
nl = lambda: list(nm())
nsm = lambda: map(str, sys.stdin.readline().split())

a, b = nm()

if a >= 13:
    print(b)
elif 6 <= a <= 12:
    print(b // 2)
else:
    print(0)

Solution (Python):
read = input 
rn = lambda :map(int, read().split())
a ,b = rn()
if a >= 13:
    print(b)
elif 6 <= a and a <= 12:
    print(b//2)
else :
    print(0)

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

if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0)

Solution (Python):
a,b = map(int,raw_input().split(' '))
if a>=13:
	print(b)
elif 6<=a<=12:
	print(b/2)
elif a<=5:
	print(0)
else:
	pass

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

print(0 if A <= 5 else (B if A >= 13 else B // 2))

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

if a < 6:
    ans = 0
elif a < 13:
    ans = b//2
else:
    ans = b
print(ans)

Solution (Python):
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  

a,b = na()
if a >=13:
    print(b)
elif 6 <= a and a<=12:
    print(b//2)
else:
    print(0)

Solution (Python):


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

if a < 6:
    print(0)
elif 6 <= a <= 12:
    print(b//2)
else:
    print(b)

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

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

if a >= 13:
    print(b)
elif a >= 6:
    print(int(b/2))
else:
    print(0)

Solution (Python):
from sys import exit

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

if A >= 13:
    print(B)
elif 12 >= A >= 6:
    print(B // 2)
else:
    print(0)

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

if a >= 13:
    print(b)

elif 12 >= a >= 6:
    print(b // 2)

else:
    print(0)

Solution (Python):
a,b = map(int,input().split())
import math 
if a <= 5:
    print(0)
elif 6<=a<=12:
    print(math.floor(b/2))
else:
    print(b)

Solution (Python):
a, b = map(int, input().split())
if a <= 5: print(0)
elif 6 <= a <= 12: print(b//2)
else: print(b)

Solution (Python):
def getlist():
	return list(map(int, input().split()))

A, B = getlist()
if A <= 5:
	print(0)
elif A <= 12:
	print(int(B // 2))
else:
	print(B)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print(0)

Solution (Python):
A,B=map(int,input().split())
if A>=13:
    print(B)
elif 6<=A<=12:
    print(int(B/2))
else:
    print(0)

Solution (Python):
a,b=map(int,input().split())
if a<=5:
    print(0)
elif a<=12:
    print(b//2)
else:
    print(b)

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

if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(int(B / 2))
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A > 5:
    print(B//2)
else:
    print("0")

Solution (Python):

import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, product, permutations
from operator import add, mul, sub

sys.setrecursionlimit(100000)


def read_int():
    return int(input())


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


def read_float():
    return float(input())


def read_float_n():
    return list(map(float, input().split()))


def read_str():
    return input().strip()


def read_str_n():
    return list(map(str, input().split()))


def error_print(*args):
    print(*args, file=sys.stderr)


def mt(f):
    import time

    def wrap(*args, **kwargs):
        s = time.time()
        ret = f(*args, **kwargs)
        e = time.time()

        error_print(e - s, 'sec')
        return ret

    return wrap


@mt
def slv(A, B):
    if A <= 5:
        return 0
    elif A <= 12:
        return B//2
    return B


def main():
    
    A, B = read_int_n()
    
    print(slv(A, B))


if __name__ == '__main__':
    main()

Solution (Python):

n,m = map(int,input().split())

if n>=13:
    print(m)
elif 6<=n<=12:
    print(m//2)
else:
    print(0)

Solution (Python):
a,b=map(int,input().split())
if a<=5:
    print(0)
elif 6<=a<=12:
    print(b//2)
else:
    print(b)

Solution (Python):
A, B = map(int, input().split())
if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B//2)
else:
    print(B)

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

if A>=13:
    Ans = B
elif A>=6:
    Ans = B//2
else:
    Ans = 0

print(Ans)

Solution (Python):

def main():
    a, b = map(int, raw_input().split())
    if a <= 5:
        print 0
    elif a < 13:
        print b // 2
    else:
        print b


if __name__ == '__main__':
    main()

Solution (Python):
A, B= map(int, input().split())
if A <= 5:
  print(0)
elif A <= 12:
  print(B//2)
else:
  print(B)

Solution (Python):
a,b=map(int,input().split())
ans=0
if a>=13:
    ans=b
elif 6<=a<=12:
    ans=b//2
print(ans)

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

if a >= 13:
    print(b)
elif a >= 6 and a <= 12:
    print(int(b/2))
else:
    print("0")

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

if (A >= 13):
    print(B)
elif (A >= 6):
    print(B//2)
else:
    print(0)

Solution (Python):

import copy
import random
import bisect 
import fractions 
import math
import sys

mod = 10**9+7
sys.setrecursionlimit(mod) 

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

if A >= 13:
    ans = B
elif A >= 6:
    ans = B//2
else:
    ans = 0
print(ans)

Solution (Python):
a,b = map(int,input().split())
if a>=13:
    print(b)
elif a>=6 and a<=12:
    print(b//2)
else:
    print(0)

Solution (Python):
a, b = list(map(int, input().split()))
if a <= 5:
    print(0)
elif a <= 12:
    print(b // 2)
else:
    print(b)

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

if A <= 5:
    print(0)
elif A <= 12:
    print(int(B/2))
else:
    print(B)

Solution (Python):
a,b=map(int,input().split())
if a>12:
  print(b)
elif a>5 and a<13:
  print(int(b/2))
else:
  print(0)

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

if a < 6:
  print(0)
elif a < 13:
  print(b//2)
else:
  print(b)

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


A,B=map(int,input().split())
if A >= 13:
  print(B)
elif 12 >= A >= 6:
  print(B//2)
else:
  print(0)

Solution (Python):
a,b=map(int,input().split())
if a>=13:
    print(b)
elif 6<=a<=12:
    print(b//2)
else:
    print(0)

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

if A >= 13:
    print(B)
elif A >= 6:
    print(int(B/2))
else:
    print(0)

Solution (Python):
a,b = map(int,input().split())
if a > 12:
	print(b)
elif 6 <= a <= 12:
	print(b//2)
else:
	print(0)

Solution (Python):
import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools
import random

sys.setrecursionlimit(10**7)
inf = 10**20
eps = 1.0 / 10**10
mod = 10**9+7
dd = [(-1,0),(0,1),(1,0),(0,-1)]
ddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]

def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def LF(): return [float(x) for x in sys.stdin.readline().split()]
def LS(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def F(): return float(sys.stdin.readline())
def S(): return input()
def pf(s): return print(s, flush=True)
def pe(s): return print(str(s), file=sys.stderr)


def main():
    a,b = LI()
    if a >= 13:
        return b
    if a < 6:
        return 0

    return b // 2


print(main())

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

print(0 if (A<=5) else (B//2 if (A<=12) else B))

Solution (Python):
import sys
input = sys.stdin.readline
inf = float('inf')
mod = 10**9+7


def INT_(n): return int(n)-1


def MI(): return map(int, input().split())


def MF(): return map(float, input().split())


def MI_(): return map(INT_, input().split())


def LI(): return list(MI())


def LI_(): return [int(x) - 1 for x in input().split()]


def LF(): return list(MF())


def LIN(n: int): return [input() for _ in range(n)]


def LLIN(n: int): return [LI() for _ in range(n)]


def LLIN_(n: int): return [LI_() for _ in range(n)]


def LLI(): return [list(map(int, l.split())) for l in input()]


def I(): return int(input())


def F(): return float(input())


def ST(): return input().replace('\n', '')


def main():
    A, B = MI()

    if A >= 13:
        print(B)
    elif A < 6:
        print(0)
    else:
        print(B//2)


if __name__ == '__main__':
    main()

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

if(a >= 13):
    print(b)
elif (6 <= a <= 12):
    print(b//2)
else:
    print(0)

Solution (Python):
a,b = map(int,input().split())
print(b if a >= 13 else int(b/2) if 6<=a<=12 else 0)

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

if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(0)

Solution (Python):
A,B = map(int, input().split())
if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B//2)
else:
    print(B)

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

ans = b

if 6 <= a <= 12:
    ans = b // 2
elif a < 6:
    ans = 0

print(ans)

Solution (Python):
def main():
    from sys import stdin, stdout

    def read():
        return stdin.readline().rstrip('\n')

    def read_array(sep=None, maxsplit=-1):
        return read().split(sep, maxsplit)

    def read_int():
        return int(read())

    def read_int_array(sep=None, maxsplit=-1):
        return [int(a) for a in read_array(sep, maxsplit)]

    def write(*args, **kwargs):
        sep = kwargs.get('sep', ' ')
        end = kwargs.get('end', '\n')
        stdout.write(sep.join(str(a) for a in args) + end)

    def write_array(array, **kwargs):
        sep = kwargs.get('sep', ' ')
        end = kwargs.get('end', '\n')
        stdout.write(sep.join(str(a) for a in array) + end)

    a, b = read_int_array()
    if a >= 13:
        write(b)
    elif a >= 6:
        write(b // 2)
    else:
        write(0)

main()

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A >= 6:
    print(B // 2)
else:
    print(0)

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

if A >= 13:
    print(B)
elif A < 13 and A >=6:
    print(int(B/2))
else:
    print(0)

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
  print(b)
elif 6 <= a <= 12:
  print(int(b/2))
else:
  print(0)

Solution (Python):
a,b = map(int, input().split())
print(b if a>12 else int(b/2) if a>5 else  0)

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

if 13 <= A:
    print(B)
elif 6 <= A:
    print(B//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(0)

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

if a >= 13:
    print(b)
elif 6 <= a <= 12:
    print(b//2)
else:
    print(0)

Solution (Python):
def main(A,B):
    if 13 <= A:
        return B
    elif 6 <= A <= 12:
        return B//2
    else:
        return 0

A,B = map(int,input().split(" "))
print(main(A,B))

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

if A >= 13:
        print(B)
elif 6 <= A:
        print(B//2)
else:
        print(0)

Solution (Python):
import sys


s2nn = lambda s: [int(c) for c in s.split(' ')]
ss2nn = lambda ss: [int(s) for s in ss]
ss2nnn = lambda ss: [s2nn(s) for s in ss]
i2s = lambda: sys.stdin.readline().rstrip()
i2n = lambda: int(i2s())
i2nn = lambda: s2nn(i2s())
ii2ss = lambda n: [sys.stdin.readline().rstrip() for _ in range(n)]
ii2nn = lambda n: ss2nn(ii2ss(n))
ii2nnn = lambda n: ss2nnn(ii2ss(n))

def main():
    A, B = i2nn()
    n = B
    if 6 <= A and A <= 12:
        n = B / 2
    elif A <= 5:
        n = 0
    n = int(n)
    print(n)

main()

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

if a <= 5:
  print(0)
elif a <= 12:
  print(int(b/2))
else:
  print(b)

Solution (Python):
A, B = map(int, input().split(" "))
if A >= 13:
    print(B)
elif A < 6:
    print(0)
else:
    print(B//2)

Solution (Python):
a,b=map(int,input().split())
if a>=13:
    print(b)
elif a<=5:
    print(0)
else:
    print(int(b/2))

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

if A < 6:
	print(0)
elif A < 13:
	print(B // 2)
else:
	print(B)

Solution (Python):
A,B = map(int,input().split())
if A<=5:
    print(0)
elif(A<=12):
    print(B//2)
else:
    print(B)

Solution (Python):
a,b = map(int,input().split())
if a>=13:
    print(b)
elif a>=6:
    print(b//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
	print(B)
elif A >=6:
	print(int(B/2))
else:
	print(0)

Solution (Python):
a,b = map(int,input().split())
if a>=13:
  print(b)
elif a>=6:
  print(b//2)
else:
  print(0)

Solution (Python):
a,b=map(int,input().split())
if(a>=13):
    print(b)
elif(a<6):
    print(0)
else:
    print(b//2)

Solution (Python):
a,b = (int(num) for num in input().split())
if a > 12:
    print(b)
elif a > 5:
    print(b//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print(0)

Solution (Python):
def inpl(): return map(int, input().split())

A, B = inpl()
if A <= 5:
    print(0)
elif A <= 12:
    print(B//2)
else:
    print(B)

Solution (Python):
import sys
import math
from itertools import permutations
input = sys.stdin.readline

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

if A<=5:
	print(0)
elif A<13:
	print(B//2)
else:
	print(B)

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

if A >= 13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):

"""



"""
import sys


def solve(A, B):
    if A >= 13:
        return B
    if 6 <= A <= 12:
        return B // 2
    return 0


def main(args):
    A, B = map(int, input().split())
    ans = solve(A, B)
    print(ans)


if __name__ == '__main__':
    main(sys.argv[1:])

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

if a >=13:
	print(b)
elif 6<=a<=12:
	print(b//2)
else:
	print(0)

Solution (Python):
A, B = [int(elm) for elm in input().split(" ")] 

if A >= 13:
    out = B
elif 6 <= A <= 12:
    out = B // 2
else:
    out = 0

print(out)

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

if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0)

Solution (Python):

A,B=[int(c) for c in input().split()]

if(A<=5):
	print(0)
elif(A<=12):
	print(B//2)
else:
	print(B)

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

    if A <= 5:
        ans = 0
    elif A <= 12:
        ans = B // 2
    else:
        ans = B
    print(ans)


if __name__ == '__main__':
    main()

Solution (Python):
from sys import stdin
import math
import fractions
from collections import deque

INF = 10 ** 10

A, B = [int(x) for x in stdin.readline().rstrip().split()]

if A >= 13:
    print(B)
elif A >= 6:
    print(B//2)
else:
    print(0)

Solution (Python):
A, B = map(int, input().split())
if A >= 13:
    print(B)
elif A >= 6:
    print(int(B/2))
else:
    print(0)

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

if A <= 5:
    print(0)
elif 6 <= A <= 12:
    print(B // 2)
else:
    print(B)

Solution (Python):
a,b = map(int,input().split())
if a <= 5:
    print(0)
elif 6 <= a <= 12:
    print(b//2)
else:
    print(b)

Solution (Python):
a,b = map(int,input().split())
if a >= 13:
    print(b)
elif a >= 6:
    print(int(b/2))
else:
    print(0)

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

if a <= 5:
    print(0)
elif a <= 12:
    print(b // 2)
else:
    print(b)

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

if a <= 5:
    print(0)
elif a <= 12:
    print(b // 2)
else:
    print(b)

Solution (Python):
a,b = map(int, input().split())
if a <= 5:
    print("0")
elif a <= 12:
    print(int(b/2))
else:
    print(b)

Solution (Python):
a,b = map(int,input().split())
if a <= 5:
    print(0)
elif 6 <= a <= 12:
    print(int(b/2))
else:
    print(b)

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

if a > 12:
  print(b)
elif a > 5:
  print(b // 2)
else:
  print(0)

Solution (Python):
a,b=map(int,input().split())
if a>=13:
    print(b)
elif a>=6:
    print(b//2)
else:
    print(0)

Solution (Python):


from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict


mod = 1


def intin():
    input_tuple = input().split()
    if len(input_tuple) <= 1:
        return int(input_tuple[0])
    return tuple(map(int, input_tuple))


def intina():
    return [int(i) for i in input().split()]


def intinl(count):
    return [intin() for _ in range(count)]


def modadd(x, y):
    global mod
    return (x + y) % mod


def modmlt(x, y):
    global mod
    return (x * y) % mod


def lcm(x, y):
    while y != 0:
        z = x % y
        x = y
        y = z
    return x


def combination(x, y):
    assert(x >= y)

    if y > x // 2:
        y = x - y

    ret = 1

    for i in range(0, y):
        j = x - i
        i = i + 1

        ret = ret * j
        ret = ret // i

    return ret


def get_divisors(x):
    retlist = []
    for i in range(1, int(x**0.5) + 3):
        if x % i == 0:
            retlist.append(i)
            retlist.append(x // i)
    return retlist


def get_factors(x):
    retlist = []
    for i in range(2, int(x**0.5) + 3):
        while x % i == 0:
            retlist.append(i)
            x = x // i
    retlist.append(x)
    return retlist


def make_linklist(xylist):
    linklist = {}
    for a, b in xylist:
        linklist.setdefault(a, [])
        linklist.setdefault(b, [])
        linklist[a].append(b)
        linklist[b].append(a)
    return linklist


def calc_longest_distance(linklist, v=1):
    distance_list = {}
    distance_count = 0
    distance = 0
    vlist_previous = []
    vlist = [v]
    nodecount = len(linklist)

    while distance_count < nodecount:
        vlist_next = []
        for v in vlist:
            distance_list[v] = distance
            distance_count += 1
            vlist_next.extend(linklist[v])
        distance += 1
        vlist_to_del = vlist_previous
        vlist_previous = vlist
        vlist = list(set(vlist_next) - set(vlist_to_del))

    max_distance = -1
    max_v = None
    for v, distance in distance_list.items():
        if distance > max_distance:
            max_distance = distance
            max_v = v

    return (max_distance, max_v)


def calc_tree_diameter(linklist, v=1):
    _, u = calc_longest_distance(linklist, v)
    distance, _ = calc_longest_distance(linklist, u)
    return distance


class UnionFind:

    def __init__(self, n):
        self.parent = [i for i in range(n)]

    def root(self, i):
        if self.parent[i] == i:
            return i
        self.parent[i] = self.root(self.parent[i])
        return self.parent[i]

    def unite(self, i, j):
        rooti = self.root(i)
        rootj = self.root(j)
        if rooti == rootj:
            return
        if rooti < rootj:
            self.parent[rootj] = rooti
        else:
            self.parent[rooti] = rootj

    def same(self, i, j):
        return self.root(i) == self.root(j)





def main():
    a, b = intin()

    if a >= 13:
        print(b)
        return
    if a >= 6:
        print(b // 2)
        return

    print(0)


if __name__ == '__main__':
    main()

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0)