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

long long solution(int* maxHeights, int n) {
    long long maxSum = 0;
    
    for (int peak = 0; peak < n; peak++) {
        int* heights = (int*)calloc(n, sizeof(int));
        heights[peak] = maxHeights[peak];
        
        // Fill left side (increasing)
        for (int i = peak - 1; i >= 0; i--) {
            heights[i] = (maxHeights[i] < heights[i + 1]) ? maxHeights[i] : heights[i + 1];
        }
        
        // Fill right side (decreasing)
        for (int i = peak + 1; i < n; i++) {
            heights[i] = (maxHeights[i] < heights[i - 1]) ? maxHeights[i] : heights[i - 1];
        }
        
        long long currentSum = 0;
        for (int i = 0; i < n; i++) {
            currentSum += heights[i];
        }
        
        if (currentSum > maxSum) {
            maxSum = currentSum;
        }
        
        free(heights);
    }
    
    return maxSum;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    // Parse JSON array manually
    int maxHeights[1000];
    int n = 0;
    
    char* ptr = strchr(line, '[');
    ptr++;
    
    char* token = strtok(ptr, ",]");
    while (token != NULL) {
        maxHeights[n++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    long long result = solution(maxHeights, n);
    printf("%lld\n", result);
    
    return 0;
}