import sys
INF = float('inf')
#10**20,2**63,float('inf')
MOD = 10**9 + 7
MOD2 = 998244353
#from collections import defaultdict
def solve():
    def II(): return int(sys.stdin.readline())
    def LI(): return list(map(int, sys.stdin.readline().split()))
    def LC(): return list(input())
    def IC(): return [int(c) for c in input()]
    def MI(): return map(int, sys.stdin.readline().split())
    import itertools
    Num = []
    for v in itertools.permutations(range(1,9)):
        V = list(v)
        Tmp = 0
        for i,n in enumerate(V):
            Tmp += n*(10**i)
        Num.append(Tmp)
    K = II()
    Ans = 0
    #print(Num)
    for n in Num:
        if n%K == 0:
            Ans += 1
    print(Ans)
    return
solve()
#sys.setrecursionlimit(10 ** 6)#再帰関数ではコメントにしないこと！！