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

int solution(int** grid, int n) {
    for (int i = 0; i < n; i++) {
        int isChampion = 1;
        for (int j = 0; j < n; j++) {
            if (i != j && grid[j][i] == 1) {
                isChampion = 0;
                break;
            }
        }
        if (isChampion) {
            return i;
        }
    }
    
    return -1;
}

int main() {
    char line[10000];
    fgets(line, sizeof(line), stdin);
    
    // Simple parsing for small grids
    int n = 0;
    char* ptr = line;
    while (*ptr) {
        if (*ptr == '[' && *(ptr+1) != '[') n++;
        ptr++;
    }
    
    int** grid = (int**)malloc(n * sizeof(int*));
    for (int i = 0; i < n; i++) {
        grid[i] = (int*)malloc(n * sizeof(int));
    }
    
    // Parse values
    ptr = line;
    int row = 0, col = 0;
    while (*ptr && row < n) {
        if (*ptr >= '0' && *ptr <= '9') {
            grid[row][col] = *ptr - '0';
            col++;
            if (col == n) {
                col = 0;
                row++;
            }
        }
        ptr++;
    }
    
    int result = solution(grid, n);
    printf("%d\n", result);
    
    for (int i = 0; i < n; i++) {
        free(grid[i]);
    }
    free(grid);
    
    return 0;
}