import java.util.HashSet;
import java.util.Set;

public class Euler749 {
    static class Solver {
        static final int kMaxDigits = 16;
        static final int kMaxExponent = 53;
        static final long kLimit = 9999999999999999L;

        long[] pow = new long[10];
        int[] counts = new int[10];
        Set<Long> found = new HashSet<>();

        boolean matchesCounts(long n, int len) {
            if (n == 0L)
                return false;
            int[] freq = new int[10];
            int digits = 0;
            while (n > 0L) {
                freq[(int) (n % 10L)]++;
                n /= 10L;
                digits++;
            }
            if (digits != len)
                return false;
            for (int i = 0; i < 10; ++i) {
                if (freq[i] != counts[i])
                    return false;
            }
            return true;
        }

        void checkCandidate(long n, int len) {
            if (n == 0L || n > kLimit)
                return;
            if (matchesCounts(n, len)) {
                found.add(n);
            }
        }

        void dfs(int digit, int rem, int len, long sum) {
            if (sum < 0 || sum > kLimit + 1L)
                return; // sum < 0 catches overflow

            if (digit == 10) {
                if (rem != 0)
                    return;
                if (counts[0] == len)
                    return;

                if (sum > 0L) {
                    checkCandidate(sum - 1L, len);
                }
                checkCandidate(sum + 1L, len);
                return;
            }

            for (int c = 0; c <= rem; ++c) {
                counts[digit] = c;
                long add = (long) c * pow[digit];
                if (sum + add < sum)
                    continue; // overflow check
                dfs(digit + 1, rem - c, len, sum + add);
            }
            counts[digit] = 0;
        }

        long solve(int maxDigits) {
            found.clear();

            for (int k = 1; k <= kMaxExponent; ++k) {
                pow[0] = 0L;
                pow[1] = 1L;
                for (int d = 2; d <= 9; ++d) {
                    long v = 1L;
                    for (int i = 0; i < k; ++i) {
                        if (v > (kLimit + 1L) / d) {
                            v = kLimit + 2L;
                            break;
                        }
                        v *= d;
                    }
                    pow[d] = v;
                }

                for (int len = 1; len <= maxDigits; ++len) {
                    java.util.Arrays.fill(counts, 0);
                    dfs(0, len, len, 0L);
                }
            }

            long total = 0L;
            for (long n : found) {
                total += n;
            }
            return total;
        }
    }

    public static String solve() {
        Solver solver = new Solver();
        return Long.toString(solver.solve(16));
    }

    public static void main(String[] args) {
        System.out.println(solve());
    }
}