k, p = map(int, input().split())


def is_pallindrome(num: int):
    num = str(num)
    left = 0
    right = len(num) - 1
    while left <= right:
        if num[left] != num[right]:
            return False
        left += 1
        right -= 1
    return True


count_wau = 0
i = 0
# while i / 10**k < 1:
#     if i % p == 0 and is_pallindrome(i):
#         count_wau += 1
#     i += 1

while p*i < 10**k:
    if is_pallindrome(p*i):
        count_wau+=1
    i+=1

print(count_wau)