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
prime_factor.append(remainder)

#print(prime)
#print(prime_factor)
K_limit = math.lcm(*[k-1 for k in prime_factor])
#print(K_limit)
remainder = K_limit

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

K_candidate = [1]
for factor,exponent in K_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)
print(min({k for k in K_candidate if 10**k % N == 1}))