#include <fstream>
#include <vector>
#include <climits>

using namespace std;

ifstream be("podm.in");
ofstream ki("podm.out");

int main()
{
    int n;
    be >> n;

    vector<int> a(n + 2);

    for(int i = 1; i <= n + 1; i++)
    {
        be >> a[i];
    }

    vector<vector<long long>> m(n + 1, vector<long long>(n + 1, INT_MAX));

    for(int i = 0; i <= n; i++)
    {
        m[i][i] = 0;
    }

    for(int i = n; i >= 1; i--)
    {
        for(int j = i + 1; j <= n; j++)
        {
            for(int k = i; k <= j - 1; k++)
            {
                m[i][j] = min(m[i][j], m[i][k] + m[k + 1][j] + a[i] * a[k + 1] * a[j + 1]);
            }
        } 
    }

    ki << m[1][n];

    return 0;
}