#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, srt, end) for (long long i = (srt); i < (long long)(end); i++)

void solve() {
    ll k;
    cin >> k;
    ll ans = 0;
    vector<ll> v = {1, 2, 3, 4, 5, 6, 7, 8};
    do {
        ll tmp = 0, pw = 1;
        rep(i, 0, 8) {
            tmp += pw * v[i];
            pw *= 10;
        }
        ans += (tmp % k == 0);
    } while(next_permutation(v.begin(), v.end()));
    cout << ans << endl;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}