/**
 *    author:  ytsmash
 *    created: 14.08.2021 09:15:35
 **/

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

typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
using P = pair<int, int>;

int main() {
    int K;
    cin >> K;
    vector<int> a(8);
    iota(all(a), 1);

    int ans = 0;
    do {
        int check = 0;
        rep(i, 8) {
            check *= 10;
            check += a[i];
        }
        if (check % K == 0) {
            ans++;
        }
    } while (next_permutation(all(a)));

    cout << ans << "\n";
    return 0;
}