#include <bits/stdc++.h>

using namespace std;

int main()
{
    int n;
    cin >> n;
    vector<int> a;
    vector<int> visited(100001, 0);
    for (int i=0; i < n; i++) {
        int x;
        cin >> x;
        a.push_back(x);
    }
    int best = -1;
    int best_i = -1;
    int low = 0, high = 0, cnt = 0;
    while (high < n) {
        while (cnt < 3 && high < n) {
            if (visited[a[high]]++ == 0) {
                cnt++;
            }
            high++;
        }
        if (high - low > best) {
            best = high - low - 1;
            best_i = low + 1;
        }
        while (cnt > 2) {
            visited[a[low]]--;
            if (visited[a[low]] == 0) {
                cnt--;
            }
            low++;
        }
    }
    cout << best << ' ' << best_i << '\n';
    return 0;
}