import math
N = int(input())

sieve_limit = int(math.sqrt(N))
prime_factor = []
prime = []

sieve = list(range(2,sieve_limit+1))
j = 0
remainder = N

while sieve:
	factor = sieve[0]
	prime.append(factor)
	sieve = [i for i in sieve if i % factor != 0]
	while remainder % factor == 0:
		remainder //= factor
		prime_factor.append(factor)
	if remainder < factor:
		break
if remainder > 1:
	prime_factor.append(remainder)

totient = N
for factor in prime_factor:
	totient = (totient*(factor-1))//factor

#print(totient)
prime_factor = []
remainder = totient

for factor in prime:
	exponent = 0
	while remainder % factor == 0:
		remainder //= factor
		exponent += 1
	if exponent > 0:
		prime_factor.append((factor,exponent))
	if remainder == 1:
		break
if remainder > 1:
	prime_factor.append((remainder,1))

#print(prime_factor)

K_candidate = [1]
for factor,exponent in prime_factor:
	K_candidate_new = set()
	for i in range(exponent+1):
		K_candidate_new = K_candidate_new | {j*factor**i for j in K_candidate}
	K_candidate = K_candidate_new
#print(K_prime_factor)
#print(K_candidate)
K_candidate_list = list(K_candidate)
K_candidate_list.sort()
for k in K_candidate_list:
	r = 10
	for _ in range(1,k):
		r = 10 * r % N
	if r == 1:
		print(k)
		break