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



 
import sys
import math



 

fileoperation=0
if(fileoperation):
    orig_stdout = sys.stdout
    orig_stdin = sys.stdin
    inputfile = open('W:/Competitive Programming/input.txt', 'r')
    outputfile = open('W:/Competitive Programming/output.txt', 'w')
    sys.stdin = inputfile
    sys.stdout = outputfile


mod=1000000007
 

def nospace(l):
    ans=''.join(str(i) for i in l)
    return ans
 
 
 

t=1
for tt in range(t):
    
    a,b= map(int, sys.stdin.readline().split(' '))
    if a<=5 :
        print(0)
    elif a<=12:
        print(b//2)
    else:
        print(b)
    
    
    

if(fileoperation):
    sys.stdout = orig_stdout
    sys.stdin = orig_stdin
    inputfile.close()
    outputfile.close()

Solution (Python):
from collections import defaultdict


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


if __name__ == '__main__':
    Solution().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 A < 13:
    print(B//2)
else:
    print(B)

Solution (Python):
a,b = (int(i) for i in input().split())
if a>12: 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 >= 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, raw_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(B//2)
else:
    print(0)

Solution (Python):
A, B = [int(i) for i in raw_input ().split()]
if A <= 5: print 0
elif A > 5 and 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(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 = [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 = 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(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())

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

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

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().strip().split())

if a>=13:
    print(b)
else:
    if 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):
import sys
rr = lambda: sys.stdin.readline().strip()
rri = lambda: int(rr())
rrs = lambda: [int(_) for _ in rr().split()]

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

Solution (Python):
a,b=[int(i) for i in 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):
    print(b)
elif(a <= 5):
    print(0)
else:
    print(int(b / 2))

Solution (Python):
import sys, math, collections, heapq, itertools
F = sys.stdin
def single_input(): return F.readline().strip("\n")
def line_input(): return F.readline().strip("\n").split()
def gcd(a, b):
    a, b = max(a, b), min(a, b)
    while a % b > 0: a, b = b, a % b
    return b
  
def solve():
    A, B = map(int, line_input())
    if A >= 13: print(B)
    elif A >= 6: print(B//2)
    else: print(0)
    return 0
  
if __name__ == "__main__":
    solve()

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

Solution (Python):

def main():
    buf = input()
    buflist = buf.split()
    A = int(buflist[0])
    B = int(buflist[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>=13:
    print(b)
elif 6<=a<=12:
    print(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):
A,B = map(int, raw_input().split())
if A > 12:
	print(B)
elif A > 5:
	print(B/2)
else:
	print(0)

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

Solution (Python):
a, b = (int(_) for _ in 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 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=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>=6 and 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):
import sys
input = sys.stdin.readline

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

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

Solution (Python):
n, m = map(int, input().split())

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

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()))
print(0 if a < 6 else b // 2 if a < 13 else 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 = [int(_) for _ in input().split()]

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

print(result)

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

Solution (Python):
from fractions import *
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):
a, b = map(int, input().split())
if a >= 13:
  	print(b)
elif a >= 6:
  	print(b >> 1)
else:
    print(0)

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

Solution (Python):
import sys
from collections import deque
import math
sys.setrecursionlimit(20000000)

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


import itertools
from collections import Counter
from collections import defaultdict
import bisect

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

if __name__ == '__main__':
    main()

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

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

Solution (Python):
a, b = list(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 >=6 and A <=12:
    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):
import sys

sys.setrecursionlimit(10**7)

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

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

Solution (Python):
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, log2
from itertools import permutations, combinations, product
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits

def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))
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):
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,B=rl()
if A>=13:
    print(B)
elif A>=6:
    print(B//2)
else:
    print(0)

Solution (Python):
A,B = [int(x) for x in 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:
    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(B//2)
else:
    print(0)

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

Solution (Python):
from collections import Counter, deque
from fractions import gcd
from functools import lru_cache
from functools import reduce
import functools
import heapq
import itertools
import math
import numpy as np
import re
import sys

sys.setrecursionlimit(10000)
INF = float('inf')



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

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

print(ans)

Solution (Python):
from collections import defaultdict as ddic, deque, Counter
from itertools import permutations, combinations, product
import bisect, heapq

rr = raw_input
rri = lambda: int(raw_input())
rrm = lambda: map(int, raw_input().split())

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

print solve(*rrm())

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 IL(): return list(map(int,input().split()))
def SL(): return input().split()
def I(): return int(input())
def S(): return list(input())
a,b=IL()
if a>=13:
    print(b)
elif 6<=a<=12:
    print(b//2)
else:
    print(0)

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

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

Solution (Python):
a, b = [int(i) for i in 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:
	print(0)
elif A<=12:
	print(B//2)
else:
	print(B)

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