#include <bits/stdc++.h>
using namespace std;
using ll = long long;
// const ll MOD = 1e9+7;

#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

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

    int n; cin >> n;
    vector<int> a(n+2, INT_MAX);
    for (int i = 1; i <= n; i++) cin >> a[i];
    
    int r = 1;
    map<int, int> van;
    van[a[1]]++;
    int len = 1, st = 1;
    for (int l = 1; l <= n; l++) {
    	//cerr << "l === " << l << "\n";
    	//cerr << "r === " << r << "\n";
    	while (true) {
    		bool s = (!van.count(a[l]+1) && a[r+1] == a[l]-1) || (!van.count(a[l]-1) && a[r+1] == a[l]+1) || (a[r+1] == a[l]);
    		if (!s) {
    			/*cerr << "l=" << l << "; r=" << r << " - " << s << "\n";
    			cerr << van.count(a[l]-1) << " " << a[r+1] << " " << a[l]+1 << "\n";*/
    			break;
    		}
    		r++;
    		if (r-l+1 > len) {	
		    	len = r-l+1;
		    	st = l;
	    	}
    		van[a[r]]++;
    		/*cerr << l << " " << r << "\n";
    		cerr << "    van:\n";
    		for (auto [x, y] : van) cerr << "    " << x << " " << y << "\n";
    		cerr << "\n";*/
    	}
    	
    	van[a[l]]--;
    	if (van[a[l]] == 0) van.erase(a[l]);
    }
    
    cout << len << " " << st << "\n";

    return 0;
}