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

signed main() {
    int k; cin >> k;
    vector<int> vals;
    for(int i=1; i<=8; i++) vals.emplace_back(i);

    int result = 0;
    do {
        int value = 0;
        for (int i=0; i<8; i++) {
            value += vals[i] * int(pow(10, i));
        }
        if (value % k == 0) result++;
    } while (next_permutation(vals.begin(), vals.end()));

    cout << result << endl;
}