#include <cstdio>
#include <algorithm>

int main() {
  int a, count = 0;
  int b[] = {1, 2, 3, 4, 5, 6, 7, 8};
  std::scanf("%d", &a);
  do {
    int n = 0, d = 1;
    for(int i = 0; i < 8; ++i) {
      n += b[i] * d;
      d *= 10;
    }
    if(n % a == 0) ++count;
  } while(std::next_permutation(b, b + 8));
  std::printf("%d\n", count);
}