#include <bits/stdc++.h>
using namespace std;
int a[1000005], z[1000005];
int main() {
  int n, i, x, y, maxx, sum, j;
  while (~scanf("%d", &n)) {
    for (i = 1; i <= n; i++) scanf("%d", &a[i]);
    maxx = sum = 0;
    for (i = 1; i <= n; i++) {
      for (j = i; j >= 1; j--) {
        if (a[j] % a[i] == 0)
          x = j;
        else
          break;
      }
      for (j = i; j <= n; j++) {
        if (a[j] % a[i] == 0)
          y = j;
        else
          break;
      }
      i = y;
      if (y - x > maxx) {
        sum = 0;
        maxx = y - x;
      }
      if (maxx == y - x) z[sum++] = x;
    }
    sort(z, z + sum);
    printf("%d %d\n", sum, maxx);
    for (i = 0; i < sum; i++) printf("%d ", z[i]);
    printf("\n");
  };
  return 0;
}
