#include <bits/stdc++.h>
using namespace std;
const long long int N = (int)2e5 + 100;
int lol;
int n, H, a[N], b[N];
int goal;
int memo[N];
int dp(int at) {
  if (at == n) return 0;
  int &ans = memo[at];
  if (ans != -1) return ans;
  ans = dp(at + 1);
  int sum = 0;
  for (int to = at; to < n; ++to) {
    sum += a[to];
    if (sum == goal) {
      ans = max(ans, 1 + dp(to + 1));
      break;
    }
  }
  return ans;
}
void go(int at) {
  if (at == n) return;
  int ans = dp(at);
  if (dp(at + 1) == ans) {
    go(at + 1);
    return;
  }
  int sum = 0;
  for (int to = at; to < n; ++to) {
    sum += a[to];
    if (sum == goal) {
      int cur = 1 + dp(to + 1);
      cout << at + 1 << " " << to + 1 << endl;
      go(to + 1);
      break;
    }
  }
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  map<int, map<int, int> > dp;
  int ans = 0, goalSum = -69696969, l = -1, r = -1;
  for (int i = n - 1; i >= 0; --i) {
    int sum = 0;
    for (int j = i; j < n; ++j) {
      sum += a[j];
      auto it = dp.find(sum);
      if (it != dp.end()) {
        map<int, int> &cur = dp[sum];
        auto cit = cur.upper_bound(j);
        int val;
        if (cit == cur.end())
          val = 0;
        else
          val = cit->second;
        auto csit = cur.upper_bound(i - 1);
        int cval;
        if (csit == cur.end())
          cval = 0;
        else
          cval = csit->second;
        if (val + 1 > cval) {
          cur[i] = val + 1;
          if (ans < val + 1) {
            ans = val + 1;
            goalSum = sum;
            l = i, r = j;
          }
        }
      } else {
        map<int, int> cur;
        cur[i] = 1;
        dp[sum] = cur;
        if (ans < 1) {
          ans = 1;
          goalSum = sum;
          l = i, r = j;
        }
      }
    }
  }
  cout << ans << endl;
  cout << l + 1 << " " << r + 1 << endl;
  fill(memo, memo + n, -1);
  goal = goalSum;
  go(r + 1);
  return 0;
}
