#include <iostream>
using namespace std;

const int MAX_LENGTH = 100000;

int main() {
	int n, v[MAX_LENGTH + 1];
	cin >> n;
	int nuleCount = 0, firstPos = 1, lastPos = 0;
	for (int i = 1; i <= n; ++i) {
		cin >> v[i];
	}

	int flag = 1;
	int counter = 0;
	for (int i = 1; i <= n; ++i) {
		if (v[i] * v[i + 1] != 0 && flag == 1) {
            if (counter >= nuleCount) {
                nuleCount = counter;
                lastPos = i;
                firstPos = i - counter ;
                counter = 0;
                ///flag = 1;
            }
            flag = 0;

		} else if (v[i] * v[i + 1] == 0) {
		    ++counter;
		    flag = 1;
		}

	}
	cout << firstPos << " " << lastPos <<" " << counter<<" \n";
	for (int i = firstPos; i <= lastPos; ++i) {
		//cout << v[i] <<" ";
	}
	 //cout << firstPos << " " << lastPos;
	return 0;
}
/*

1 2 3 4 0 1 0 5 6
*/