#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <stack>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std; // NOLINT

int main() {
    int32_t k;
    cin >> k;
    int32_t ans = 0;
    string s = "12345678";
    do {
        auto t = stoi(s);
        if (t % k == 0)
            ++ans;
    } while (next_permutation(s.begin(), s.end()));
    cout << ans << endl;
    return 0;
}