#include <bits/stdc++.h>
using namespace std;
using ll = long long;
ll phi(ll N) {
	ll ret = N;
	ll p = 2;
	while (p * p <= N) {
		if (N % p == 0) {
			ret /= p;
			ret *= (p - 1);
			while (N % p == 0) {
				N /= p;
			}
		}
		p ++;
	}
	if (N > 1) {
		ret /= N;
		ret *= (N-1);
	}
	return ret;
}
ll mpow(ll a, ll n, ll m) {
	ll ret = 1;
	while (n) {
		if (n & 1) {
			ret = (ret * a) % m;
		}
		n >>= 1;
		a = (a * a) % m;
	}
	return ret;
}
int main () {
	ll N;
	cin >> N;
	ll K = phi(N);
	ll ans = K;
	for (ll i = 1; i * i <= K; i ++) {
		if (K % i) continue;
		if (mpow(10, i, N) == 1) {
			ans = min(ans, i);
		}
		if (mpow(10, K/i, N) == 1) {
			ans = min(ans, K/i);
		}
	}
	cout << ans << endl;
}