#gcd of permutation
from math import gcd


def main():
    s = input()
    a = list(map(int, list(s)))
    a.sort()
    N = len(a)
    if a[0] == a[-1]:
        print(int(s))
        return
    else:
        ans = 1
        #2
        ans *= min(gcd(a[i], 8) for i in range(N))
        #3
        ans *= gcd(sum(a), 9)
        #5
        if all(a[i] % 5 == 0 for i in range(N)):
            ans *= 5
        #7:impossible
        print(ans)
        return


if __name__ == "__main__":
    main()