import collections import itertools def f(c,m): C=len(c) c=[i for i in c] dp=[[] for i in range(1<>k)&1==0: for l in dp[i]: dp[i+2**k].append((l+q[m+k][c[j]])%p) cnt=1 for i in collections.Counter(c).values(): cnt*=fact[i] t=collections.Counter(dp[-1]) return t,cnt def f2(c,m): C=len(c) c=[i for i in c] dp=[[] for i in range(1<>k)&1==0: for l in dp[i]: dp[i+2**k].append((l+q[m+k][c[j]])%p) cnt=1 for i in collections.Counter(c).values(): cnt*=fact[i] return dp[-1],cnt n=8 p=int(input()) c=[1,1,1,1,1,1,1,1,0] a=[] for i in range(9): for j in range(c[i]): a.append(i+1) all=tuple(itertools.combinations(a,n//2)) ans=0 q=[[0]*10 for i in range(n+1)] for i in range(n+1): for j in range(10): q[i][j]=pow(10,i,p)*j%p fact=[1]*(n+1) for i in range(1,n+1): fact[i]=fact[i-1]*i s=set() for x in all: y=0 for i in range(n//2): y+=x[i]*pow(10,i) if y in s: continue s.add(y) b=a.copy() for i in x: b.remove(i) d1,n1=f2(x,(n+1)//2) d2,n2=f(b,0) n3=n1*n2 num=0 for i in d1: if i==0: if 0 in d2: num+=d2[0] elif p-i in d2: num+=d2[p-i] ans+=num//n3 print(ans)