#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return std::vector(arg, init);
    else return std::vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

int main() {
    int k; cin >> k;

    int p[] = {
        1, 2, 3, 4, 5, 6, 7, 8
    };

    int ans = 0;
    do {
        int sum = 0, acc = 1;
        for (int i = 1; i <= size(p); ++i) {
            sum += p[size(p) - i] * acc;
            acc *= 10;
        }
        ans += sum % k == 0;
    } while (next_permutation(begin(p), end(p)));

    cout << ans << endl;
}