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

const int inf = 0x3f3f3f3f;

#define endl "\n"
#define ll long long
//#define int ll

const int N = 1e6 + 5, M = 5000;

bitset<M>bit[5005];

void solve(){
	int n;
	cin>>n;
	string s;
	for(int i=1;i<=n;i++){
		cin>>s;
		bitset<M>t(s);
		swap(bit[i], t);
	}
	
	vector<int>ans;
	for(int i=1;i<=n;i++){
		int t = n - i;
		auto a = bit[i];
		auto b = a;
		
//		cout<<"i = "<<i<<endl;
//		for(int i=0;i<n;i++)cout<<b[i]<<" ";cout<<endl;
		
		b[t] = 1;
		
//		for(int i=0;i<n;i++)cout<<b[i]<<" ";cout<<endl;
		
		for(int i=0;i<n;i++){
			int j = n - 1 - i;
			if(a[i]){
				b |= bit[j + 1];
			}
		}
		
//		for(int i=0;i<n;i++)cout<<b[i]<<" ";cout<<endl;
		
		if(b.count() == n){
			ans.push_back(i);
			if(ans.size() == 3){
				for(auto &x:ans)cout<<x<<" ";
				return;
			}
		}
	}
	cout<<"NOT FOUND\n";
}

signed main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int t = 1;
//	cin>>t;
	for(int i=1;i<=t;i++){
		solve();
	}
	return 0;
}