#include <bits/stdc++.h>
using namespace std;

const int MXN = 5005;
int N, deg[MXN], perm[MXN];
bitset<MXN> ex[MXN], tmp;

bool check(int p) {
  tmp = ex[p];
  tmp.set(p);
  for (int i(0); i != N; ++i)
    if (ex[p][i]) tmp |= ex[i];
  return tmp.count() == N;
}

int main() {
  cin >> N;
  for (int i(0); i != N; ++i) {
    char c(0);
    for (int j(0); j != N; ++j) {
      cin >> c;
      if (c == '1') ex[i].set(j);
    }
    perm[i] = i;
  }
  for (int i(0); i != N; ++i) {
    deg[i] = ex[i].count();
    for (int j(0); j != N; ++j) {
      if (ex[i][j]) deg[i] += ex[j].count();
    }
  }
  sort(perm, perm + N, [](int x, int y) { return deg[x] < deg[y]; });
  vector<int> ans;
  for (int i(0); i != min(N, 80); ++i) {
    if (check(perm[i])) {
      ans.push_back(perm[i]);
      if (ans.size() == 3) break;
    }
  }
  if (ans.size() == 3) {
    cout << ans[0] + 1 << ' ' << ans[1] + 1 << ' ' << ans[2] + 1 << endl;
  } else {
    cout << "NOT FOUND" << endl;
  }
  return 0;
}