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):

















































global FLAG_LOG
FLAG_LOG = False


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


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

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

    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 = ['30 100']
        lines_export = [100]
    if pattern == 2:
        lines_input = ['12 100']
        lines_export = [50]
    if pattern == 3:
        lines_input = ['0 100']
        lines_export = [0]
    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,B=map(int,input().split())
if A>=13:print(B)
elif 6<=A and A<13:print(B//2)
else:print(0)

Solution (Python):
n, k = (int(x) for x in input().split())
if n<6:
    print("0")
if 5<n<13:
    print(int(k/2))
if 12<n:
    print(k)

Solution (Python):
n, k = (int(x) for x in input().split())
if n<6:
    print("0")
if 5<n<13:
    print(int(k/2))
if 12<n:
    print(k)

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 <= 12 and 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 = map(int,input().split())
print(b if a>=13 else b//2 if 6<=a<=12 else 0)

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

Solution (Python):
def main():

    A,B = map(int,input().split())
    print(B if A >= 13 else B//2 if A >= 6 else 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 <= 5:
  print(0)
else:
  print(b//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, B = rl()

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 = list(map(int, input().split()))
if a[0] >= 13:
  print(a[1])
elif a[0] >= 6:
  print(int(a[1]/2))
else:
  print(0)

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

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

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

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

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

if __name__ == '__main__':
    resolve()

Solution (Python):

def input2():
	return map(int,input().split())
  
a,b=input2()

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 >= 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(b // 2)
else:
    print(0)

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

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

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())
ans = 0
if a >= 13:
    print(b)
elif 5 < a <= 12:
    print(b // 2)
else:
    print(0)

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

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

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

Solution (Python):
A,B = (int(x) for x in input().split())
if A >12:
    print(B)
elif A > 5 & A < 13:
    print(int(B/2))
elif A < 6:
    print('0')

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(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 and a<=12:
    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(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=map(int,input().split())
res = b
if a <=5:
  res =0
elif 6<=a <=12:
  res = int(b/2)
print(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:
    ans = b
elif a <= 5:
    ans = 0
else:
    ans = b // 2
print(ans)

Solution (Python):
import sys
A,B = map(int,input().split())
if not ( 0 <= A <= 100 ): sys.exit()
if not ( 2 <= B <= 1000 ): sys.exit()
if not ( B % 2 == 0 ): sys.exit()

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

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 A >= 6:
  print(B//2)
else:
  print(0)

Solution (Python):
def main():
 a,b = map(int,input().split())
 if a <= 12 and a >= 6:
     print(b // 2)
 elif a < 6:
     print(0)
 else:
     print(b)
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())
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 and a <= 12:
  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())

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(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 >= 13:
    print(b)
elif a >= 6:
    print(round(b // 2))
else:
    print(0)

Solution (Python):
data=input().split()
A=int(data[0])
B=int(data[1])
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(int(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 5<A<13:
  print(B//2)
elif A<6:
  print(0)
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())
ans = 0
if a>= 13:
  ans = b
elif 6 <= a <13:
  ans = b//2
print(ans)

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

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

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

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

def main():
    a, b = map(int, input().split())
    if a <= 5:
        print(0)
    elif 6 <= a and 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)
elif 6<=a and a<=12:
	print(b//2)
	
else:
	print(0)

Solution (Python):
A, B = map(int,input().split())
ans = 0
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 > 12):
    print(b)
elif (a > 5):
    print(b//2)
else:
    print(0)

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

A,B = list(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())
ans = 0

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

print(ans)

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

Solution (Python):
a, b = map(int, input().split())
if a >= 13:
    print(b)
elif 6 <= a <= 12:
    print(b // 2)
elif 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(int(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)
elif A>=13: print(B)

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()
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:
  print(0)
elif a<=12:
  print(b//2)
else:
  print(b)

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

main()

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,B = map(int, input().split())
    
    
    


    if 0<=A<6:
        print(0)
    elif 6<=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)
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(int(b/2))

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

if a >= 13:
  cost = b
if a >= 6 and a <= 12:
  cost = int(b / 2)
  
print(cost)

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

if 13 <= A:
    print(B)

elif 6 <= A <= 12:
    print(B//2)

elif A <= 5:
    print(0)

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 6 <= a and a <= 12:
  print(int(b/2))
else:
  print('0')

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

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

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 <= 5:
    print(0)
elif a <= 12:
    print(b//2)
else:
    print(b)

Solution (Python):
import sys
import heapq
import re
from itertools import permutations
from bisect import bisect_left, bisect_right
from collections import Counter, deque
from math import factorial, sqrt, ceil, gcd
from functools import lru_cache, reduce
from decimal import Decimal
from operator import mul

INF = 1 << 60
MOD = 1000000007
sys.setrecursionlimit(10 ** 7)



class UnionFind():
    def __init__(self, n):
        self.n = n
        self.parents = [-1] * n

    def find(self, x):
        if self.parents[x] < 0:
            return x
        else:
            self.parents[x] = self.find(self.parents[x])
            return self.parents[x]

    def union(self, x, y):
        x = self.find(x)
        y = self.find(y)

        if x == y:
            return

        if self.parents[x] > self.parents[y]:
            x, y = y, x

        self.parents[x] += self.parents[y]
        self.parents[y] = x

    def size(self, x):
        return -self.parents[self.find(x)]

    def same(self, x, y):
        return self.find(x) == self.find(y)

    def members(self, x):
        root = self.find(x)
        return [i for i in range(self.n) if self.find(i) == root]

    def roots(self):
        return [i for i, x in enumerate(self.parents) if x < 0]

    def group_count(self):
        return len(self.roots())

    def all_group_members(self):
        return {r: self.members(r) for r in self.roots()}

    def __str__(self):
        return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())


def dijkstra_heap(s, edge, n):
    
    d = [10**20] * n
    used = [True] * n 
    d[s] = 0
    used[s] = False
    edgelist = []
    for a,b in edge[s]:
        heapq.heappush(edgelist,a*(10**6)+b)
    while len(edgelist):
        minedge = heapq.heappop(edgelist)
        
        if not used[minedge%(10**6)]:
            continue
        v = minedge%(10**6)
        d[v] = minedge//(10**6)
        used[v] = False
        for e in edge[v]:
            if used[e[1]]:
                heapq.heappush(edgelist,(e[0]+d[v])*(10**6)+e[1])
    return d


def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])

    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])

    return arr


def combinations_count(n, r):
    if n < r:
        return 0
    r = min(r, n - r)
    numer = reduce(mul, range(n, n - r, -1), 1)
    denom = reduce(mul, range(1, r + 1), 1)
    return numer // denom


def lcm(x, y):
    return (x * y) // gcd(x, y)


def lcm_list(numbers):
    return reduce(lcm, numbers, 1)


def gcd_list(numbers):
    return reduce(gcd, numbers)


def is_prime(n):
    if n <= 1:
        return False
    p = 2
    while True:
        if p ** 2 > n:
            break
        if n % p == 0:
            return False
        p += 1
    return True



def eratosthenes(limit):
    A = [i for i in range(2, limit+1)]
    P = []

    while True:
        prime = min(A)
        
        if prime > sqrt(limit):
            break
            
        P.append(prime)
            
        i = 0
        while i < len(A):
            if A[i] % prime == 0:
                A.pop(i)
                continue
            i += 1
            
    for a in A:
        P.append(a)
            
    return P


def permutation_with_duplicates(L):

    if L == []:
        return [[]]

    else:
        ret = []

        
        S = sorted(set(L))

        for i in S:

            data = L[:]
            data.remove(i)

            for j in permutation_with_duplicates(data):
                ret.append([i] + j)

        return ret

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]


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:
	print(B)
elif A<6:
	print("0")
elif 6<=A<=12:
	print(B//2)

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 math
import sys
input = sys.stdin.readline
a, b = map(int, input().split())
if (a < 6):
    cost = 0
elif (a < 13):
    cost = b // 2
else:
    cost = b
print(cost)

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
input = lambda: sys.stdin.readline().rstrip()

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 <= 5:
    print(0)
else:    
    print(B//2)

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>12:
    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 and A <= 12 : 
    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())
print(b if a>=13 else b//2 if 12>=a>=6 else 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 12 >= a >= 6:
    print(int(b/2))
elif 5 >= a:
    print(int(0))

Solution (Python):
n,k=tuple(map(int,input().split()))
if n >= 13:
  print(k)
elif 6 <= n <= 12:
  print(k//2)
elif n <= 5:
  print(0)

Solution (Python):
n,k=tuple(map(int,input().split()))
if n >= 13:
  print(k)
elif 6 <= n <= 12:
  print(k//2)
elif n <= 5:
  print(0)

Solution (Python):

a,b=map(int,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 6 <= a <= 12:
    print(b // 2)
else:
    print(0)

Solution (Python):
a,b=map(int,input().split())
if a > 12:
    print(b)
elif a < 13 and a > 5:
    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 = [int(a) for a in input().split()]
if b%2==0:
  if a>=13:
    print(b)
  elif 6<=a<=12:
    print(int(b/2))  
  elif a<=5:
    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(b//2)
else:
  print(0)

Solution (Python):
a, b = [int(a) for a in input( ).split()]
if b%2==0:
  if a>=13:
    print(b)
  elif a>=6 and a<=12:
    print(int(b/2))
  elif a<=5:
    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())
print((b>>(a<13))*(a>5))

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 6 <= A <= 12:
  print(int(B*0.5))
else:
  print(0)

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

Solution (Python):


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

if a > 12:
    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 >= 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 5<a<13:
    print(b//2)
else:
    print(0)

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

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 < 13:
    print(int(B/2))
else:
    print(0)

Solution (Python):


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

if a <= 5:
  print(int(0))
elif a <= 12:
  print(int(b/2))
else:
  print(int(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());print(b if a>=13 else (0 if a<=5 else b//2))

Solution (Python):
a,b= map(int,input().split())
if a >= 13:
    print(b)
elif a > 5:
    print(b//2)
elif 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):
import sys, os, math, bisect, itertools, collections, heapq, queue

from decimal import Decimal
from collections import defaultdict



sys.setrecursionlimit(10000000)

ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
fl = lambda: list(map(float, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]

iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
sl = lambda: list(map(str, sys.stdin.buffer.readline().decode().split()))
isn = lambda n: [sys.stdin.buffer.readline().decode().rstrip() for _ in range(n)]

lcm = lambda x, y: (x * y) // math.gcd(x, y)


MOD = 10 ** 9 + 7
MAX = float('inf')


def main():
    if os.getenv("LOCAL"):
        sys.stdin = open("input.txt", "r")

    A, B = il()

    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())
if 13 <= a:
  print(b)
elif 6 <= a 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):
x,y=map(int,input().split())
if x<=5:print(0)
elif x<=12:print(y//2)
else:print(y)

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

Solution (Python):
def main():
    a, b = map(int, input().split())
    if a >= 13:
        print(b)
    elif a >= 6:
        print(b//2)
    else:
        print(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):
x, y = input("").split(" ")
a = int(x)
b = int(y)
result = 0
if a >= 13:
  result = b
elif a >= 6 and a <= 12:
  result = b//2
else:
  result = 0
print(result)

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

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

Solution (Python):
try:
    age,money=map(int, input().split())
    assert 0<=age<=100 and 2<=money<=1000 and money%2==0
    if age<=5:
        print('0')
    elif 6<=age<=12:
        print(money//2)
    else:
        print(money)
except AssertionError:
    print('')

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

if a<6:
    print("0")
elif a<13:
    print(int(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 < 13 and a>=6:
    print(int(b//2))
else:
    print(0)

Solution (Python):
import sys
sys.setrecursionlimit(10**6)



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








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

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

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

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(b//2)
else:
  print(0)

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

Solution (Python):
inp = input().split()

age = int(inp[0])
cost = int(inp[1])

if age >= 13: print(cost)
elif age >= 6: print(int(cost/2))
else: print(0)

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

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

Solution (Python):

import sys
input = sys.stdin.readline
A,B = (int(i) for i in input().split())
if 13 <= A:
    ans =B
elif 6 <= A <=12:
    ans =B//2
elif A <=5:
    ans =0

print(ans)

Solution (Python):
inp=input()
list =inp.split()
age, cost=list[0], list[1]
age=int(age)
cost=int(cost)
if age>=13:
  cost=cost
elif age<13 and age>5:
  cost=cost*0.5
else:
  cost=0
print(int(cost))

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):


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(int(b/2))
else:
    print(0)

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

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

A, B = MI()

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

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 = list(map(int,input().split()))

if A <= 5:
    print(0)
elif A < 13:
    print(int(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):
age, max_money = map(int, input().split())
if age>= 13:
  print(max_money)
elif age>=6 and age<=12:
  print(max_money//2)
elif age<=5:
  print("0")

Solution (Python):
A, B = (int(x) for x in input().split())
if A <= 5:
  print(0)
elif A>= 13:
  print(B)
else:
  print(B//2)

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

if __name__ == '__main__':
    solve()

Solution (Python):
import sys
a=sys.stdin.readline()
res = [int(i) for i in a.split() if i.isdigit()] 
A,B = [res[i] for i in (0,1)]
if B%2==0 and (B>=2 and B<= 1000) and (A>=0 and A<=100):
	if A>=13:
		print(B)
	elif A>=6 and A<=12:
		print(int(B/2))
	elif A<=5:
		print(0)
else:
	print("Error")

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):
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60


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


if __name__ == '__main__':
    main()