import java.util.*;

public class Euler88 {
    static int kMax = 12000;
    static int[] best;

    static void dfs(int product, int sum, int factors, int start) {
        int k = product - sum + factors;
        if (k > kMax)
            return;
        if (product < best[k])
            best[k] = product;
        for (int f = start; product * f <= 2 * kMax; f++)
            dfs(product * f, sum + f, factors + 1, f);
    }

    public static void main(String[] args) {
        best = new int[kMax + 1];
        Arrays.fill(best, Integer.MAX_VALUE);
        dfs(1, 0, 0, 2);
        Set<Integer> unique = new TreeSet<>();
        for (int k = 2; k <= kMax; k++)
            unique.add(best[k]);
        System.out.println(unique.stream().mapToLong(i -> i).sum());
    }
}