#include<iostream>

#include<cstdio>

#include<cstring>

#include<string>

#include<algorithm>

#include<cctype>

#include<cmath>

#include<cstdlib>

#include<ctime>

#include<queue>

#include<vector>

#include<set>

#include<map>

#include<stack>

using namespace std;

const int LOG = ;

int n,a[],st1[][LOG+],st2[][LOG+],ans[],cnt;

inline int gcd(int x,int y){return y?gcd(y,x%y):x;}

inline bool ck(int sum){

      int i,j,k;

      if(sum==)return ;

      for(i=;i+sum<=n;i++){

          for(j=LOG;j>=;j--)

            if((<<j)<=sum){

                if(min(st1[i][j],st1[(i+sum)-(<<j)+][j])==gcd(st2[i][j],st2[(i+sum)-(<<j)+][j]))

                  return ;

                break;

          }

      }

      return ;

}

inline void go(int sum){

      int i,j,k;

      for(i=;i+sum<=n;i++){

          for(j=LOG;j>=;j--)

            if((<<j)<=sum){

                if(min(st1[i][j],st1[(i+sum)-(<<j)+][j])==gcd(st2[i][j],st2[(i+sum)-(<<j)+][j]))

                  ans[++cnt]=i;

                break;

          }

      }

      if(sum==)

        for(i=;i<=n;i++)ans[++cnt]=i;

      cout<<cnt<<' '<<sum<<endl;

      for(i=;i<=cnt;i++)printf("%d ",ans[i]);

      puts("");

      return;

}

int main(){

      int i,j,k;

      scanf("%d",&n);

      for(i=;i<=n;i++)scanf("%d",&a[i]),st1[i][]=st2[i][]=a[i];

      for(i=;i<=LOG;i++)

        for(j=;j<=n;j++)if(j+(<<i)-<=n){

          st1[j][i]=min(st1[j][i-],st1[j+(<<(i-))][i-]);

          st2[j][i]=gcd(st2[j][i-],st2[j+(<<(i-))][i-]);

        }

      int le=,ri=n;

      while(ri-le>){

          int mid=(le+ri)>>;

          if(ck(mid))le=mid;

            else ri=mid;

      }

      go(le);

      return ;

}