#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int INF = 1e9 + 10;
const ll INFL = 4e18;

// オイラーの totient 関数
// n 以下で n と互いに素な自然数の個数を返す。
// O(sqrt(N))
ll totient(ll n) {
    ll ret = n;
    for (ll i = 2; i * i <= n; i++) {
        if (n % i == 0) {
            ret -= ret / i;
            while (n % i == 0) n /= i;
        }
    }
    if (n > 1) ret -= ret / n;
    return ret;
}

template <typename T = ll>
T modPow(T x, T n, T mod) {
    ll ret = 1;
    if (typeid(T) == typeid(ll) && mod > INF * 2) return modPow<__int128_t>(x, n, mod);
    while (n > 0) {
        if (n & 1) ret = ret * x % mod;
        x = x * x % mod;
        n >>= 1;
    }
    return ret;
}

ll modInv(ll x, ll mod) { return modPow(x, mod - 2, mod); }

int main() {
    int N;
    cin >> N;

    int P = totient(N);

    int ans = P;
    for (int i = 1; i * i <= P; i++) {
        if (P % i == 0) {
            if (modPow(10, i, N) == 1) ans = min(ans, i);
            if (modPow(10, P / i, N) == 1) ans = min(ans, P / i);
        }
    }

    cout << ans << endl;
}