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

int solution(int* nums, int n) {
    int count = 0;
    
    for (int j = 1; j < n - 2; j++) {
        for (int k = j + 1; k < n - 1; k++) {
            // Count i's where i < j and nums[i] < nums[k]
            int leftCount = 0;
            for (int i = 0; i < j; i++) {
                if (nums[i] < nums[k]) {
                    leftCount++;
                }
            }
            
            // Count l's where l > k and nums[j] < nums[l]
            int rightCount = 0;
            for (int l = k + 1; l < n; l++) {
                if (nums[j] < nums[l]) {
                    rightCount++;
                }
            }
            
            count += leftCount * rightCount;
        }
    }
    
    return count;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    int nums[1000];
    int n = 0;
    char* token = strtok(line, "[,]");
    while (token != NULL) {
        if (token[0] >= '0' && token[0] <= '9') {
            nums[n++] = atoi(token);
        }
        token = strtok(NULL, "[,]");
    }
    
    int result = solution(nums, n);
    printf("%d\n", result);
    
    return 0;
}