from math import gcd

def div(n):
    if n <= 0:
        return []
    S = set()
    i = 1
    while i * i <= n:
        if n % i == 0:
            S.add(i)
            S.add(n // i)
        i += 1
    return list(S)

n = input()
if len(set(n)) == 1:
    print(n)
    exit()
    
D = [0] * 10
for i in n:
    D[int(i)] = 1
    
g = -1
for i in range(10):
    for j in range(i + 1, 10):
        if D[i] and D[j]:
            if g == -1:
                g = 9 * (j - i)
            else:
                g = gcd(g, 9 * (j - i))
            
n = list(n)
n.reverse()
ans = 0
for d in div(g):
    ten = 1
    v = 0
    for s in n:
        v += ten * int(s)
        v %= d
        ten *= 10
        ten %= d
    if v == 0:
        ans = max(ans, d)
        
print(ans)