import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

a,b=I()
if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0) import re re import sys sys import math math import itertools itertools import bisect bisect from copy import copy from collections import deque,Counter from decimal import Decimal import functools functools def v(): return input() v def k(): return int(input()) k def S(): return input().split() S def I(): return map(int,input().split()) I def X(): return list(input()) X def L(): return list(input().split()) L def l(): return list(map(int,input().split())) l def lcm(a,b): return a*b//math.gcd(a,b) lcm a a b b sys.setrecursionlimit(10 ** 9) sys.setrecursionlimit sys setrecursionlimit 10 ** 9 10 9 mod = 10**9+7 mod 10**9+7 10**9 10 9 7 cnt = 0 cnt 0 ans = 0 ans 0 inf = float("inf") inf float("inf") float "inf" a,b=I() a I() I b if a >= 13:
    print(b)
elif a >= 6:
    print(b//2)
else:
    print(0) a >= 13 a 13 print(b) print b elif a >= 6:
    print(b//2) a >= 6 a 6 print(b//2) print b//2 b 2 print(0) print 0 def l(): return list(map(int,input().split())) def l(): return list(map(int,input().split())) l def I(): return map(int,input().split()) def I(): return map(int,input().split()) I inf = float("inf") float("inf") inf def S(): return input().split() def S(): return input().split() S def k(): return int(input()) def k(): return int(input()) k def lcm(a,b): return a*b//math.gcd(a,b) def lcm(a,b): return a*b//math.gcd(a,b) lcm b=I() I() b def v(): return input() def v(): return input() v def L(): return list(input().split()) def L(): return list(input().split()) L mod = 10**9+7 10**9+7 mod cnt = 0 0 cnt a,b=I() I() a def X(): return list(input()) def X(): return list(input()) X ans = 0 0 ans
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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