# import sys
# #sys.setrecursionlimit(1000000)
# input = sys.stdin.readline
def mp():return map(int,input().split())
def lmp():return list(map(int,input().split()))
import math
import bisect
from copy import deepcopy as dc
from itertools import accumulate
from collections import Counter, defaultdict, deque
import itertools
def ceil(U,V):return (U+V-1)//V
def modf1(N,MOD):return (N-1)%MOD+1
inf = int(1e30)
mod = int(1e9+7)
def permutation_all(seq, choice):
    return list(itertools.permutations(seq, choice))

k = int(input())
p = permutation_all([1,2,3,4,5,6,7,8],8)
#print(p)
ans = 0
for i in p:
    cnt = 0
    for j in range(8):
        cnt += 10**j*i[7-j]
    if cnt % k == 0:ans += 1
    #print(cnt)
print(ans)