#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, a[300000], s = 0;
  vector<int> l, r;
  cin >> n;
  for (int i = 0; i < n; ++i) cin >> a[i];
  for (int i = 1; i < n; ++i) {
    if (a[i] % a[s]) {
      l.push_back(s);
      r.push_back(i - 1);
      s = i;
    }
  }
  l.push_back(s);
  r.push_back(n - 1);
  for (int i = l.size() - 1; i >= 0; --i) {
    int j = l[i] - 1;
    for (; j >= 0; --j) {
      if (a[j] % a[l[i]]) {
        l[i] = j + 1;
        i = lower_bound(l.begin(), l.end(), j + 1) - l.begin();
        break;
      }
    }
    if (j < 0) {
      l[i] = 0;
      break;
    }
  }
  int max = 0, nmax = 0;
  for (int i = 0; i < l.size(); ++i) {
    if (r[i] - l[i] > max) {
      max = r[i] - l[i];
      nmax = 1;
    } else if (r[i] - l[i] == max)
      nmax++;
  }
  cout << nmax << " " << max << endl;
  for (int i = 0; i < l.size(); ++i) {
    if (r[i] - l[i] == max) {
      cout << l[i] + 1 << " ";
    }
  }
  return 0;
}
