from itertools import permutations
from fractions import gcd

g = input()

digits = sorted(map(eval, str(g)))

if len(set(digits)) == 1:
  print g
elif 1 in digits or (any([x != 0 and x%2 == 0 for x in digits]) and any([x%3 == 0 for x in digits])):
  print 1
else:
  digit_len = len(str(g))
  S = []
  G = g
  sg = str(g)
  for x in xrange(1, digit_len):
    d = int(str(g)[x:] + str(g)[:x])
    G = gcd(G, d)
    if G == 1:
      break
  if G != 1:
    sg = sg[::-1]
    for x in xrange(1, digit_len):
      d = int(sg[x:] + sg[:x])
      G = gcd(G, d)
      if G == 1:
        break
  if G != 1:
    sg = sg[::-1]
    sg = sg[::2] + sg[1::2]
    for x in xrange(1, digit_len):
      d = int(sg[x:] + sg[:x])
      G = gcd(G, d)
      if G == 1:
        break
  print G