#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using Graph = vector<vector<int>>;
long long GCD(long long a,long long b) {
  if(a%b == 0) return b;
  return GCD(b,a%b);
}
int main() {
  int K; cin >> K;
  string S = "12345678";
  int count = 0;
  sort(S.begin(),S.end());
  do{
        if(stoi(S) % K == 0) {
          count++;
        }
        
    }while(next_permutation(S.begin(),S.end()));
  cout << count << endl;
}