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

Solution (Python):
A, B= (int(i) for i in input().split())


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

import sys


def solve(A: int, B: int):
    if A >= 13:
        ret = B
    elif A >= 6:
        ret = B // 2
    else:
        ret = 0
    print(ret)
    return


def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

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())
money = 0

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

Solution (Python):
a, b = [int(i) for i in input().split()]
y = 0
if a >= 13:
    y = b
elif a >= 6:
    y = int(b / 2)
print(y)

Solution (Python):

import sys
input = sys.stdin.readline

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

Solution (Python):




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

ans = 0
if A >= 13:
    ans = B
elif 6 <= A and A <= 12:
    ans = B // 2

print(ans)

Solution (Python):

import sys

import heapq
import re
import bisect
import random
import math
import itertools
from collections import defaultdict, deque
from copy import deepcopy
from decimal import *

readl= lambda: list(map(int, sys.stdin.readline().split()))
readt= lambda: tuple(map(int, sys.stdin.readline().split()))
read = lambda: sys.stdin.readline().rstrip()
readi = lambda: int(read())
readmi = lambda: map(int, sys.stdin.readline().split())
readms = lambda: map(str, sys.stdin.readline().split())

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

Solution (Python):
import sys,collections,math,random;sys.setrecursionlimit(10**7)
def Is(): return [int(x) for x in sys.stdin.readline().split()]
def Ss(): return sys.stdin.readline().split()
def I(): return int(sys.stdin.readline())
def S(): return input()

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

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

Solution (Python):
A,B=[int(a) for a in 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 > 12:
    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):

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



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

ans =  b if 13<= a else b//2 if 6<=a and a <= 12 else 0

print(ans)

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

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

sys.setrecursionlimit(10 ** 7)

def li(): return map(int, stdin.readline().split())
def li_(): return map(lambda x: int(x) - 1, stdin.readline().split())
def lf(): return map(float, stdin.readline().split())
def ls(): return stdin.readline().split()
def ns(): return stdin.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())

a,b = li()

if a <= 5:
    b = 0
elif a <= 12:
    b //= 2

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

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

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

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

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

Solution (Python):
import sys

readline = sys.stdin.readline

A, B = map(int, readline().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 5 < A < 13:
    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):

"""
Created on Sat May 25 20:57:26 2019

@author: USER
"""

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

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

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

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

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

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

ans = 0

if a >= 13:
    ans = b
elif a <= 5:
    ans = 0
else:
    ans = b //2

print(ans)

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

Solution (Python):
import sys

def main(inp):
    a,b = map(int,next(inp).split())
    if(a<=5): return 0
    elif(a<=12): return int(b/2)
    else: return b
    
print(main(sys.stdin))

Solution (Python):
from collections import Counter
from collections import deque
from functools import reduce
from pprint import pprint

import bisect
import copy
import fractions
import math
import random
import sys
import time
sys.setrecursionlimit(10**7)
INF = 10 ** 18
MOD = 10 ** 9 + 7
def LI(): return [int(x) 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 MI(): return map(int, sys.stdin.readline().split())
def II(): return int(sys.stdin.readline())
def IS(): return input()
def C(x): return Counter(x)
def GCD_LIST(numbers):
    return reduce(fractions.gcd, numbers)
def LCM_LIST(numbers):
    return reduce(LCM, numbers)
def LCM(m, n):
    return (m * n // fractions.gcd(m, n))
def unite(x, y):
    
    x = root(x)
    y = root(y)
    if x == y:
        return
    
    node[x] = y
def same(x,y): return bool(root(x) == root(y))
def root(x):
    if node[x] == x:  
        return x
    else:
        node[x] = root(node[x])  
        return node[x]
def dfs(v):
    
    visited[v] = True
    for v2 in range(n):
        if graph[v][v2] == False:  
            continue
        if visited[v2] == True:  
            continue
        dfs(v2)

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

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

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

print(ans)

Solution (Python):

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

def submit():
    a, b = read_input()

    if a >= 13:
        print(b)
        return

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

    print(0)
    return


if __name__ == '__main__':
    submit()

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

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

Solution (Python):

"""<https://github.com/cheran-senthil/PyRival>"""
from __future__ import division, print_function

import os
import sys
from io import BytesIO, IOBase

if sys.version_info[0] < 3:
    from __builtin__ import xrange as range
    from future_builtins import ascii, filter, hex, map, oct, zip
else:
    _str = str
    str = lambda x=b"": x if type(x) is bytes else _str(x).encode()


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

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




BUFSIZE = 8192


class FastIO(IOBase):
    newlines = 0

    def __init__(self, file):
        self._fd = file.fileno()
        self.buffer = BytesIO()
        self.writable = "x" in file.mode or "r" not in file.mode
        self.write = self.buffer.write if self.writable else None

    def read(self):
        if self.buffer.tell():
            return self.buffer.read()
        return os.read(self._fd, os.fstat(self._fd).st_size)

    def readline(self):
        while self.newlines == 0:
            b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))
            self.newlines = b.count(b"\n") + (not b)
            ptr = self.buffer.tell()
            self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)
        self.newlines -= 1
        return self.buffer.readline()

    def flush(self):
        if self.writable:
            os.write(self._fd, self.buffer.getvalue())
            self.buffer.truncate(0), self.buffer.seek(0)


def print(*args, **kwargs):
    """Prints the values to a stream, or to sys.stdout by default."""
    sep, file = kwargs.pop("sep", b" "), kwargs.pop("file", sys.stdout)
    at_start = True
    for x in args:
        if not at_start:
            file.write(sep)
        file.write(str(x))
        at_start = False
    file.write(kwargs.pop("end", b"\n"))
    if kwargs.pop("flush", False):
        file.flush()


sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)
input = lambda: sys.stdin.readline().rstrip(b"\r\n")



if __name__ == "__main__":
    main()

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

Solution (Python):
l = raw_input().split()
A = int(l[0])
B = int(l[1])

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 5 < A < 13:
    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 =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 A <= 12:
  print(int(B / 2))
else:
  print(B)

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

Solution (Python):

import time
import os
import time
import re
import math


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

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

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

if a >= 13:
    print(b)
elif a > 5:
    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 sys

A, B = list(map(int, sys.stdin.readline().strip().split(" ")))

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

Solution (Python):

import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
input = sys.stdin.readline
 


 
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):
def solve():
    A, B = [int(_) for _ in raw_input().split()]
    if A <= 5:
        print 0
    elif A >= 6 and A <= 12:
        print (B / 2)
    else:
        print B

if __name__ == '__main__':
    solve()

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

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

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

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

a = data[0]

if a >= 13:
    print(data[1])
elif a >= 6:
    print(data[1] // 2)
else:
    print(0)

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

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

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

Solution (Python):
s = input()
a, b = map(int, s.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):
import math

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

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

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):
A, B = [int(i) for i in input().split()]
if A > 12:
    print(B)
elif A > 5:
    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 = map(int,input().split())

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

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

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

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

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

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

if __name__ == '__main__':
    main()

Solution (Python):

import sys


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



def main():
    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    A = int(next(tokens))  
    B = int(next(tokens))  
    solve(A, B)

if __name__ == '__main__':
    main()

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,raw_input().split())
if a>=13:
	print b
elif a >= 6:
	print b/2
else:
	print 0

Solution (Python):




A, B = (int(i) for i in input().split())  

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

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())
ans = 0

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

Solution (Python):
A,B = (int(x) for x 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 6<=a<=12:
    print(int(b/2))
else:
    print("0")

Solution (Python):
import sys

from fractions import gcd





from itertools import accumulate













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



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


if __name__ == '__main__':

    
    
    
    
    A, B = mi()

    
    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)
elif a<=5:
    print("0")

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

if a[0]>12:
  ans = a[1]
elif a[0]>5:
  ans = a[1]/2
else:
  ans = 0

print(int(ans))

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


if __name__ == "__main__":
    main()

Solution (Python):
import sys, os

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

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

solve()

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

Solution (Python):









lis=list(map(int,input().split()))
ans=0
if lis[0]>=13:
    ans=lis[1]
elif lis[0]>=6 and lis[0]<=12:
    ans=int(lis[1]/2)
else:
    ans=0
print(ans)

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

"""
Created on Sat May 25 20:54:22 2019

@author: Yamazaki Kenichi
"""

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

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


import sys
import math

import array
import bisect
import collections
from collections import Counter, defaultdict
import fractions
import heapq
import re

sys.setrecursionlimit(1000000)


def array2d(dim1, dim2, init=None):
    return [[init for _ in range(dim2)] for _ in range(dim1)]

def argsort(l, reverse=False):
    return sorted(range(len(l)), key=lambda i: l[i], reverse=reverse)

def argmin(l):
    return l.index(min(l))

def YESNO(ans, yes="YES", no="NO"):
    print([no, yes][ans])

II = lambda: int(input())
MI = lambda: map(int, input().split())
MIL = lambda: list(MI())
MIS = lambda: input().split()


def main():
    a, b = MI()
    if a >= 13: return b
    if a >= 6: return b // 2
    return 0


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

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

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

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

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

Solution (Python):


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


if __name__ == '__main__':
    main()

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

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

Solution (Python):
import math
from functools import reduce
from collections import deque

def s(generator, splitter, mapper):
    return [ mapper(s) for s in generator().split(splitter) ]


def get_nums_l():
    return [ int(s) for s in input().split(" ")]


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

a,b = get_nums_l()

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 13 > 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 > 12:
    print(B)
elif A > 5:
    print(B // 2)
else:
    print(0)

Solution (Python):

from math import *

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):
from sys import stdin
A, B = [int(_) for _ in stdin.readline().rstrip().split()]
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 > 12:
    print(b)
elif a > 5:
    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,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 and 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 = [int(n) for n in input().split()]






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

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

Solution (Python):
import sys

def main():
    input = sys.stdin.readline
    A, B = map(int, input().split())

    if A <= 5:
        return 0
    elif 6 <= A <=12:
        return B // 2
    else:
        return B

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

Solution (Python):
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


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


def ceil(a, b):
    return (a + b - 1) // b



def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


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



if __name__ == '__main__':
    main()

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

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

Solution (Python):
A,B = (int(i) for i in input().split())

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

print(ans)

Solution (Python):


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

if A <= 5:
    r = 0
elif A < 13:
    r = B//2
else:
    r = B

print(r)

Solution (Python):
a,b = map(int,input().split())
if a >= 13:
    print(b)
elif 6 <= a < 13:
    print(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):
x, y = [int(i) for i in input().split()]

if x >= 13:
    print(y)

elif x <= 5:
    print(0)

else:
    print(int(y/2))

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

Solution (Python):


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

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

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)