#include <stdio.h>
#include <stdlib.h>
#include <string.h>

int max(int a, int b) {
    return a > b ? a : b;
}

int maxCoins(int* nums, int numsSize) {
    // Add boundary balloons with value 1
    int* balloons = malloc((numsSize + 2) * sizeof(int));
    balloons[0] = 1;
    balloons[numsSize + 1] = 1;
    for (int i = 0; i < numsSize; i++) {
        balloons[i + 1] = nums[i];
    }
    
    int n = numsSize + 2;
    // dp[i][j] = max coins from bursting all balloons between i and j (exclusive)
    int** dp = malloc(n * sizeof(int*));
    for (int i = 0; i < n; i++) {
        dp[i] = calloc(n, sizeof(int));
    }
    
    // Try all possible range lengths
    for (int length = 3; length <= n; length++) {
        for (int i = 0; i <= n - length; i++) {
            int j = i + length - 1;
            
            // Try each balloon k as the last one to burst in range (i,j)
            for (int k = i + 1; k < j; k++) {
                // Coins from bursting k last = left_boundary * k * right_boundary
                int coins = balloons[i] * balloons[k] * balloons[j];
                
                // Add coins from optimal solutions of subranges
                int totalCoins = dp[i][k] + coins + dp[k][j];
                dp[i][j] = max(dp[i][j], totalCoins);
            }
        }
    }
    
    int result = dp[0][n - 1];
    
    // Cleanup
    for (int i = 0; i < n; i++) {
        free(dp[i]);
    }
    free(dp);
    free(balloons);
    
    return result;
}

int main() {
    int nums[500];
    int size = 0;
    char input[1000];
    fgets(input, 1000, stdin);
    
    // Simple parsing for [1,2,3] format
    char* token = strtok(input, "[],\n ");
    while (token != NULL && size < 500) {
        nums[size++] = atoi(token);
        token = strtok(NULL, "[],\n ");
    }
    
    printf("%d\n", maxCoins(nums, size));
    return 0;
}