#include <bits/stdc++.h>
int a[300010];
int x[300010];
int ans[300010];
int cnt;
int main() {
  int n;
  scanf("%d", &n);
  int L = 1;
  int ML = 1;
  for (int i = 1; i <= n; ++i) {
    scanf("%d", &x[i]);
  }
  a[1] = x[1];
  int cnt = 0;
  ans[cnt++] = 1;
  for (int i = 2; i <= n; ++i) {
    if (x[i] % a[i - 1] == 0) {
      ++L;
      a[i] = a[i - 1];
    } else if (a[i - 1] % x[i] == 0) {
      L = 1;
      for (int j = i - 1; j > 0; --j) {
        if (a[j] % x[i] == 0)
          ++L;
        else
          break;
      }
      a[i] = x[i];
    } else {
      L = 1;
      a[i] = x[i];
    }
    if (L == ML) {
      ans[cnt++] = i;
    } else if (L > ML) {
      cnt = 0;
      ans[cnt++] = i;
      ML = L;
    }
  }
  printf("%d %d\n", cnt, ML - 1);
  for (int i = 0; i < cnt; ++i) {
    printf("%d ", ans[i] - ML + 1);
  }
  printf("\n");
}
