1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #define M 500010
 6 using namespace std;
 7 long long n,a[M],mxx,mxl,sum,Ans[M];
 8 struct sb{
 9     int len,l;
10 }ans[M];
11 long long init(){
12     
13     int x=0;char s=getchar();
14     while(s<‘0‘||s>‘9‘)s=getchar();
15     while(s>=‘0‘&&s<=‘9‘){x=x*10+s-‘0‘;s=getchar();}
16     return x;
17 }
18 bool cmp(sb x,sb y){
19     if(x.len==y.len) return x.l<y.l;
20     return x.len>y.len;
21 }
22 long long Gcd(long long a,long long b){
23     if (b==0)
24     {
25         return a;
26     }
27     Gcd(b,a%b);
28 }
29 int main()
30 {
31     n=init();
32     for(int i=1;i<=n;i++)
33         a[i]=init();
34        for(int k=1;k<=n;k++)
35        {
36            int li=k,ri=k,gcd=a[k];
37            for(int i=k+1;i<=n;i++)
38            {
39                   if(Gcd(gcd,a[i])!=gcd) 
40                   break;
41                else ri++;
42            }
43            for(int i=k-1;i>=1;i--)
44            {
45                  if(Gcd(gcd,a[i])!=gcd)
46                   break;
47               else li--;
48            }
49                
50            ans[k].len=ri-li;
51            ans[k].l=li;
52         }
53         sort(ans+1,ans+1+n,cmp);
54         mxx=ans[1].len;mxl=ans[1].l;
55         Ans[++sum]=mxl;
56         for(int k=2;k<=n;k++)
57            if(ans[k].len!=mxx)
58                break;
59         else if(ans[k].l!=mxl)
60         {
61             Ans[++sum]=ans[k].l;
62             mxl=ans[k].l;
63         }
64     cout<<sum<<" "<<mxx<<endl;
65     for(int i=1;i<=sum;i++)
66         cout<<Ans[i]<<" ";
67     return 0;
68 }