#include <bits/stdc++.h>
using namespace std;
int a[300005], b[300005];
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
  }
  int length = 0, num = 0;
  for (int i = 1; i <= n;) {
    int left = i, right = i;
    while (left >= 1 && a[left] % a[i] == 0) {
      left--;
    }
    while (right <= n && a[right] % a[i] == 0) {
      right++;
    }
    i = right;
    if (right - left - 2 > length) num = 0, length = (right - left - 2);
    if (right - left - 2 == length) b[num++] = left + 1;
  }
  printf("%d %d\n", num, length);
  for (int i = 0; i < num - 1; i++) {
    printf("%d ", b[i]);
  }
  printf("%d\n", b[num - 1]);
}
