/**
 *    author:  ytsmash
 *    created: 14.08.2021 09:15:35
 **/

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

typedef long long ll;
#define rep(i, n) for (int i = 0; i < (n); i++)
#define all(x) x.begin(), x.end()
const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);
using P = pair<int, int>;

int main() {
    int K;
    cin >> K;
    int next = K;
    vector<bool> flag(8, false);
    bool flag2 = true;
    int ans = 0;

    while (next <= 87654321) {
        rep(i, 8) {
            flag[next % 10] = true;
            next /= 10;
        }
        rep(i, 8) {
            if (!flag[i]) {
                flag2 = false;
            }
        }
        if (flag2) {
            ans++;
        }
        next += K;
    }

    cout << ans << "\n";
    return 0;
}