from itertools import combinations, permutations
from fractions import gcd

N = raw_input()


if all(d==N[0] for d in N):
    print N
    exit()

ans = 1
S = set(N)

if len(S) == 2 and '0' in S:
    m = sorted(list(S))[1]
    if N.count(m)%3 == 0:
        print int(m)*3
    else:
        print m
    exit()

if all(int(d)%3 == 0 for d in S):
    x = sum(int(d) for d in N)
    for i in xrange(10, 0, -1):
        if x%(3**i) == 0:
            print i
            exit()


elif all(int(d1+d2)%4==0 and int(d2+d1)%4 == 0 for d1, d2 in combinations(S, 2)):
    if all(N.count(i) < 2 or int(i+i) % 4 == 0 for i in '0123456789'):
        ans *= 4
elif all(int(d)%2==0 for d in S):
    ans *= 2

if sum(int(d) for d in N)%9 == 0:
    ans *= 9
elif sum(int(d) for d in N)%3 == 0:
    ans *= 3

print ans