#include<bits/stdc++.h>

using namespace std;

const int N = 5e3 + 100;
int n;
int a[N][N];

bool in_[N];

int work(int now) {
    in_[now] = 1;
    for (int i = 1; i <= n; i++)
        if (a[now][i] == 1) in_[i] = 1;
    for (int i = 1; i <= n; i++)
        if (!in_[i]) return work(i);
    return now;
}

int main() {
    scanf("%d", &n);
    for (int i = 1; i <= n; i++) {
        int num = 0;
        for (int j = 1; j <= n; j++) {
            char c = getchar();
            while (c != '0' && c != '1') c = getchar();
            a[i][j] = c - '0';
            if (c == '1') num++;
        }
        if (num == n - 1) {
            printf("NOT FOUND");
            return 0;
        }
    }
    
    for (int i = 1; i <= n; i++) in_[i] = 0;
    int a_1 = work(1);
    for (int i = 1; i <= n; i++) in_[i] = 0;
    int a_2 = work(a_1);
    for (int i = 1; i <= n; i++) in_[i] = 0;
    int a_3 = work(a_2);
    printf("%d %d %d", a_1, a_2, a_3);

    return 0;
}