#include <bits/stdc++.h>
using namespace std;
int A[400100];
vector<int> v;
int main() {
  int i, j, k, temp, maxx = 0, l, n, sum = 0;
  scanf("%d", &n);
  for (i = 0; i < n; i++) scanf("%d", &A[i]);
  for (i = 0; i < n; i++) {
    temp = 0;
    for (k = i - 1; A[i] && A[k] % A[i] == 0 && k >= 0; k--) temp++;
    for (j = i; A[i] && A[j] % A[i] == 0 && j < n; j++) temp++;
    i = j - 1;
    if (temp > maxx) {
      maxx = temp;
      v.clear();
      v.push_back(k + 2);
    } else if (temp == maxx) {
      v.push_back(k + 2);
    }
    sum += temp;
  }
  printf("%d %d\n", v.size(), maxx - 1);
  for (i = 0; i < v.size(); i++) printf("%d ", v[i]);
  return 0;
}
