def gcd(x,y):
	return x if y == 0 else gcd(y,x%y)
N = input()
n = int(N)
s = set(map(int,list(N)))
if len(s) == 1:
	print(N)
else:
	G = 0
	for i in s:
		for j in s:
			if i < j:
				if G == 0:
					G = 9 * (j - i)
				else:
					G = gcd(G,9 * (j - i))
	div = set()
	i = 1
	while i * i <= G:
		if G % i == 0:
			div.add(i)
			div.add(G//i)
		i+=1
	div = list(div)
	div.sort()
	div.reverse()
	for d in div:
		if n % d == 0:
			print(d)
			break