def divisors(X):
   from math import isqrt
   assert X >= 1
   head = [d for d in range(1, isqrt(X) + 1) if X%d == 0]
   tail = [X//d for d in reversed(head)]
   if isqrt(X)**2 == X:
      head.pop()
   head.extend(tail)
   return head

def euler_phi(X):
   assert X >= 1
   res = X
   d = 2
   while d*d <= X:
      if X%d == 0:
         res = res//d*(d-1)
         while X%d == 0:
            X //= d
      d += 1
   if X > 1:
      res = res//X*(X-1)
   return res

N = int(input())

D = divisors(euler_phi(N))

for d in D:
   if (pow(10, d, N) - 1) % N == 0:
      print(d)
      break
else:
   assert False