#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <map>
#include <queue>
#include <cmath>
using namespace std;
typedef long long ll;
#define rep(i, n) for (int i=0;i < (int)(n);i++)

int main(){
    int k;
    cin >> k;
    vector<int> d(8);
    rep(i,8) d[i] = i+1;
    int ans = 0;
    do{
        int cnt = 1;
        int sum = 0;
        rep(i,8){
            sum += d[i]*cnt;
            cnt*=10;
        }
        if (sum%k == 0) ans++;
    }while(next_permutation(d.begin(),d.end()));
    cout << ans << endl;
    

    return 0;
}