#include <iostream>
#include <vector>
#include <stdlib.h>

using namespace std;


unsigned long long solve_podm(int n, vector<int> &v) {
	vector<vector<unsigned long long>> dp(n + 1, vector<unsigned long long>(n + 1, INT_MAX));

	for (int i = 1; i <= n; ++i) {
		dp[i][i] = 0ULL;
	}

	for (int i = 1; i < n; ++i) {
		dp[i][i + 1] = 1ULL * d[i - 1] * d[i] * d[i + 1];
	}

	for (int len = 2; len <= n; ++len) {
		for (int i = 1; i + len - 1 <= n; ++i) {
			int j = i + len - 1;

			for (int k = i; k < j; ++k) {
				unsigned long long new_sol = dp[i][k] + dp[k + 1][j] + 1ULL * d[i - 1] * d[k] * d[j];
				dp[i][j] = min(dp[i][j], new_sol);
			}
		}
	}
	return dp[1][n];
}