def podm():
    d = [2, 3, 4, 5]
    n = len(d) - 1
    
    dp = [[0] * n for i in range(n)]

    for l in range(2, n + 1):
        for i in range(n - l + 1):
            j = i + l - 1
            dp[i][j] = float('inf')

            for k in range(i, j):
                cost = dp[i][k] + dp[k + 1][j] + d[i] * d[k + 1] * d[j + 1]
                dp[i][j] = min(dp[i][j], cost)

    return dp[0][n - 1]


print(podm())