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

using i64 = long long;
using u64 = unsigned long long;
using u32 = unsigned;

constexpr int N = 5000;

int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);

    int n;
    std::cin >> n;

    std::vector<int> v;
    std::vector<std::bitset<N>> b(n);
    std::vector<int> cnt(n);
    for (int i = 0; i < n; i++)
    {
        std::string s;
        std::cin >> s;

        for (int j = 0; j < n; j++)
        {
            if (i == j || s[j] == '1')
            {
                b[i][j] = 1;
            }
        }
        cnt[i] = b[i].count();
    }

    std::vector<int> ord(n);
    std::iota(ord.begin(), ord.end(), 0);
    std::sort(ord.begin(), ord.end(),
              [&](int i, int j)
              {
                  return cnt[i] > cnt[j];
              });

    for (auto i : ord)
    {
        if (v.size() == 3)
        {
            // break;
        }
        bool ok = true;
        for (auto x : v)
        {
            if ((b[x] & b[i]) == b[i])
            {
                ok = false;
                break;
            }
        }
        if (ok)
        {
            v.push_back(i);
        }
    }
    if (v.size() >= 3)
    {
        std::cout << v[0] + 1 << " " << v[1] + 1 << " " << v[2] + 1 << "\n";
    }
    else
    {
        std::cout << "NOT FOUND\n";
    }

    return 0;
}