import math
N = int(input())

def find_divisors(n):
	divisors = []
	for i in range(1, int(n**0.5) + 1):
	    if n % i == 0:
	        divisors.append(i)
	        if i != n // i:  # 同じ約数を二重に追加しない
	            divisors.append(n // i)
	return sorted(divisors)

if N == 1:
	print(1)
else:
	N_factor = find_divisors(N)[1:]
	totient = N
	while N_factor:
		totient = (totient*(N_factor[0]-1))//N_factor[0]
		N_factor = [k for k in N_factor if k % N_factor[0] != 0]
	print(min([k for k in find_divisors(totient) if pow(10,k,N) == 1]))