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

def is_palindrome(n):
    n = str(n)
    return n == n[::-1]

def is_prime(n):
    if n < 2:
        return False
    
n = p
ans = 1
i = 1
for i in range(2000):
    # for i in range(in)
    while len(str(n)) <= k:
        if is_palindrome(n):
            ans += 1
        n *= i
        i += 1

print(ans)