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

int* solution(int* nums, int numsSize, int* returnSize) {
    *returnSize = numsSize;
    int* result = (int*)malloc(numsSize * sizeof(int));
    
    for (int size = 1; size <= numsSize; size++) {
        int maxOfMins = INT_MIN;
        
        for (int start = 0; start <= numsSize - size; start++) {
            int minVal = INT_MAX;
            for (int j = start; j < start + size; j++) {
                if (nums[j] < minVal) {
                    minVal = nums[j];
                }
            }
            if (minVal > maxOfMins) {
                maxOfMins = minVal;
            }
        }
        
        result[size - 1] = maxOfMins;
    }
    
    return result;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    line[strcspn(line, "\n")] = 0;
    
    int nums[1000];
    int count = 0;
    char* ptr = line + 1;
    char* token = strtok(ptr, ",]");
    
    while (token != NULL) {
        nums[count++] = atoi(token);
        token = strtok(NULL, ",]");
    }
    
    int returnSize;
    int* result = solution(nums, count, &returnSize);
    
    printf("[");
    for (int i = 0; i < returnSize; i++) {
        printf("%d", result[i]);
        if (i < returnSize - 1) printf(",");
    }
    printf("]\n");
    
    free(result);
    return 0;
}