K = int(input())
digits = [1, 2, 3, 4, 5, 6, 7, 8]
count = 0

def backtrack(used, remainder, pos):
    global count
    if pos == 8:
        if remainder % K == 0:
            count += 1
        return
    for i in range(8):
        if not (used & (1 << i)):
            new_remainder = (remainder * 10 + digits[i]) % K
            backtrack(used | (1 << i), new_remainder, pos + 1)

backtrack(0, 0, 0)
print(count)