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

long long solution(int* nums, int numsSize) {
    long long count = 0;
    
    for (int i = 0; i < numsSize; i++) {
        int left = i;
        int right = i;
        
        // Expand left while nums[i] is still maximum
        while (left > 0 && nums[left - 1] <= nums[i]) {
            left--;
        }
        
        // Expand right while nums[i] is still maximum
        while (right < numsSize - 1 && nums[right + 1] <= nums[i]) {
            right++;
        }
        
        // Count subarrays in this range where boundaries equal nums[i]
        for (int start = left; start <= i; start++) {
            for (int end = i; end <= right; end++) {
                if (nums[start] == nums[end] && nums[start] == nums[i]) {
                    // Verify nums[i] is indeed maximum in subarray
                    bool isMaximum = true;
                    for (int k = start; k <= end; k++) {
                        if (nums[k] > nums[i]) {
                            isMaximum = false;
                            break;
                        }
                    }
                    if (isMaximum) {
                        count++;
                    }
                }
            }
        }
    }
    
    return count;
}

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