package main import ( "bufio" "fmt" "os" "sort" "strconv" ) var sc = bufio.NewScanner(os.Stdin) var wr = bufio.NewWriter(os.Stdout) func out(x ...interface{}) { fmt.Fprintln(wr, x...) } func getI() int { sc.Scan() i, e := strconv.Atoi(sc.Text()) if e != nil { panic(e) } return i } func getF() float64 { sc.Scan() i, e := strconv.ParseFloat(sc.Text(), 64) if e != nil { panic(e) } return i } func getInts(N int) []int { ret := make([]int, N) for i := 0; i < N; i++ { ret[i] = getI() } return ret } func getS() string { sc.Scan() return sc.Text() } // min, max, asub, absなど基本関数 func max(a, b int) int { if a > b { return a } return b } func min(a, b int) int { if a < b { return a } return b } // min for n entry func nmin(a ...int) int { ret := a[0] for _, e := range a { ret = min(ret, e) } return ret } // max for n entry func nmax(a ...int) int { ret := a[0] for _, e := range a { ret = max(ret, e) } return ret } func asub(a, b int) int { if a > b { return a - b } return b - a } func abs(a int) int { if a >= 0 { return a } return -a } func lowerBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] >= x }) return idx } func upperBound(a []int, x int) int { idx := sort.Search(len(a), func(i int) bool { return a[i] > x }) return idx } // NextPermutation generates the next permutation of the // sortable collection x in lexical order. It returns false // if the permutations are exhausted. // // Knuth, Donald (2011), "Section 7.2.1.2: Generating All Permutations", // The Art of Computer Programming, volume 4A. // ※NextPermutationは辞書順で次を返す func NextPermutation(x sort.Interface) bool { n := x.Len() - 1 if n < 1 { return false } j := n - 1 for ; !x.Less(j, j+1); j-- { if j == 0 { return false } } l := n for !x.Less(j, l) { l-- } x.Swap(j, l) for k, l := j+1, n; k < l; { x.Swap(k, l) k++ l-- } return true } func gcd(a, b int) int { if b == 0 { return a } return gcd(b, a%b) } func main() { defer wr.Flush() sc.Split(bufio.ScanWords) sc.Buffer([]byte{}, 1000000) // this template is new version. // use getI(), getS(), getInts(), getF() s := getS() tot := 0 c48 := true c50 := true even := true all := true for i := 0; i < len(s); i++ { if s[0] != s[i] { all = false } v := int(s[i] - '0') tot += v if v != 4 && v != 8 { c48 = false } if v != 0 && v != 5 { c50 = false } if v%2 == 1 { even = false } } if all { out(s) return } ans := 1 // out(even, tot, c48, c50) if even == true { ans *= 2 } x := tot for x%3 == 0 { ans *= 3 x /= 3 } if c48 == true { ans *= 2 } if c50 == true { ans *= 5 } out(ans) } // func main() { // defer wr.Flush() // sc.Split(bufio.ScanWords) // sc.Buffer([]byte{}, 1000000) // // this template is new version. // // use getI(), getS(), getInts(), getF() // s := getS() // a := make([]int, len(s)) // for i := 0; i < len(s); i++ { // a[i] = i // } // g, _ := strconv.Atoi(s) // for { // n := 0 // for _, e := range a { // n *= 10 // n += int(s[e] - '0') // } // g = gcd(g, n) // // out(s, n) // if !NextPermutation(sort.IntSlice(a)) { // break // } // } // out(g) // }