from collections import *
from itertools import *
from functools import *
from heapq import *
import sys,math
input = sys.stdin.readline

S = list(input())[:-1]
S = [int(s) for s in S]
N = len(S)

if len(set(S))==1:
    print(''.join(map(str,S)))
    exit()

X = set(S)

GG = []

n = len(X)
X = list(X)
X.sort()
for i in range(n-1):
    for j in range(i+1,n):
        GG.append(9*(X[j]-X[i]))

d= GG[0]
for g in GG:
    d = math.gcd(d,g)
    

def make_divisors(n):
    lower_divisors , upper_divisors = [], []
    i = 1
    while i*i <= n:
        if n % i == 0:
            lower_divisors.append(i)
            if i != n // i:
                upper_divisors.append(n//i)
        i += 1
    return lower_divisors + upper_divisors[::-1]
    
    
P = make_divisors(d)

ans = 1
def is_ok(x):
    
    tmp = 0
    for i in range(N-1,-1,-1):
        tmp += S[i]*pow(10,N-1-i,x)
        tmp %= x
    return (tmp%x==0)

for p in P:
    if is_ok(p):
        ans = max(ans,p)
print(ans)