Simon has an array a1, a2, ..., an, consisting of n positive integers. Today Simon asked you to find a pair of integers l, r (1 ≤ l ≤ r ≤ n), such that the following conditions hold:

  1. there is integer j (l ≤ j ≤ r), such that all integers al, al + 1, ..., ar are divisible by aj; 
  2. value r - l takes the maximum value among all pairs for which condition 1 is true; 



Help Simon, find the required pair of numbers (l, r). If there are multiple required pairs find all of them.

Input

The first line contains integer n (1 ≤ n ≤ 3·105).

The second line contains n space-separated integers a1, a2, ..., an (1 ≤ ai ≤ 106).

Output

Print two integers in the first line — the number of required pairs and the maximum value of r - l. On the following line print all l values from optimal pairs in increasing order.

Examples

Input

5
4 6 9 3 6


Output

1 3
2 


Input

5
1 3 5 7 9


Output

1 4
1 


Input

5
2 3 5 7 11


Output

5 0
1 2 3 4 5 

Note

In the first sample the pair of numbers is right, as numbers 6, 9, 3 are divisible by 3.

In the second sample all numbers are divisible by number 1.

In the third sample all numbers are prime, so conditions 1 and 2 are true only for pairs of numbers (1, 1), (2, 2), (3, 3), (4, 4), (5, 5).
		                                import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.InputMismatchException;
import java.util.PriorityQueue;
import java.util.TreeMap;
import java.util.TreeSet;
		    
		    
		    
		                                                public class Solution1 implements Runnable
		                                                {
		                                                    static final long MAX = 464897L;
		                                                    static class InputReader
		                                                    {
		                                                        private InputStream stream;
		                                                        private byte[] buf = new byte[1024];
		                                                        private int curChar;
		                                                        private int numChars;
		                                                        private SpaceCharFilter filter;
		                                                        private BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
		                                                 
		                                                        public InputReader(InputStream stream)
		                                                        {
		                                                            this.stream = stream;
		                                                        }
		                                                        
		                                                        public int read()
		                                                        {
		                                                            if (numChars==-1) 
		                                                                throw new InputMismatchException();
		                                                            
		                                                            if (curChar >= numChars)
		                                                            {
		                                                                curChar = 0;
		                                                                try 
		                                                                {
		                                                                    numChars = stream.read(buf);
		                                                                }
		                                                                catch (IOException e)
		                                                                {
		                                                                    throw new InputMismatchException();
		                                                                }
		                                                                
		                                                                if(numChars <= 0)                
		                                                                    return -1;
		                                                            }
		                                                            return buf[curChar++];
		                                                        }
		                                                     
		                                                        public String nextLine()
		                                                        {
		                                                            String str = "";
		                                                            try
		                                                            {
		                                                                str = br.readLine();
		                                                            }
		                                                            catch (IOException e)
		                                                            {
		                                                                e.printStackTrace();
		                                                            }
		                                                            return str;
		                                                        }
		                                                        public int nextInt()
		                                                        {
		                                                            int c = read();
		                                                            
		                                                            while(isSpaceChar(c)) 
		                                                                c = read();
		                                                            
		                                                            int sgn = 1;
		                                                            
		                                                            if (c == '-') 
		                                                            {
		                                                                sgn = -1;
		                                                                c = read();
		                                                            }
		                                                            
		                                                            int res = 0;
		                                                            do 
		                                                            {
		                                                                if(c<'0'||c>'9') 
		                                                                    throw new InputMismatchException();
		                                                                res *= 10;
		                                                                res += c - '0';
		                                                                c = read();
		                                                            }
		                                                            while (!isSpaceChar(c)); 
		                                                            
		                                                            return res * sgn;
		                                                        }
		                                                        
		                                                        public long nextLong() 
		                                                        {
		                                                            int c = read();
		                                                            while (isSpaceChar(c))
		                                                                c = read();
		                                                            int sgn = 1;
		                                                            if (c == '-') 
		                                                            {
		                                                                sgn = -1;
		                                                                c = read();
		                                                            }
		                                                            long res = 0;
		                                                            
		                                                            do 
		                                                            {
		                                                                if (c < '0' || c > '9')
		                                                                    throw new InputMismatchException();
		                                                                res *= 10;
		                                                                res += c - '0';
		                                                                c = read();
		                                                            }
		                                                            while (!isSpaceChar(c));
		                                                                return res * sgn;
		                                                        }
		                                                        
		                                                        public double nextDouble() 
		                                                        {
		                                                            int c = read();
		                                                            while (isSpaceChar(c))
		                                                                c = read();
		                                                            int sgn = 1;
		                                                            if (c == '-') 
		                                                            {
		                                                                sgn = -1;
		                                                                c = read();
		                                                            }
		                                                            double res = 0;
		                                                            while (!isSpaceChar(c) && c != '.') 
		                                                            {
		                                                                if (c == 'e' || c == 'E')
		                                                                    return res * Math.pow(10, nextInt());
		                                                                if (c < '0' || c > '9')
		                                                                    throw new InputMismatchException();
		                                                                res *= 10;
		                                                                res += c - '0';
		                                                                c = read();
		                                                            }
		                                                            if (c == '.') 
		                                                            {
		                                                                c = read();
		                                                                double m = 1;
		                                                                while (!isSpaceChar(c)) 
		                                                                {
		                                                                    if (c == 'e' || c == 'E')
		                                                                        return res * Math.pow(10, nextInt());
		                                                                    if (c < '0' || c > '9')
		                                                                        throw new InputMismatchException();
		                                                                    m /= 10;
		                                                                    res += (c - '0') * m;
		                                                                    c = read();
		                                                                }
		                                                            }
		                                                            return res * sgn;
		                                                        }
		                                                        
		                                                        public String readString() 
		                                                        {
		                                                            int c = read();
		                                                            while (isSpaceChar(c))
		                                                                c = read();
		                                                            StringBuilder res = new StringBuilder();
		                                                            do 
		                                                            {
		                                                                res.appendCodePoint(c);
		                                                                c = read();
		                                                            } 
		                                                            while (!isSpaceChar(c));
		                                                            
		                                                            return res.toString();
		                                                        }
		                                                     
		                                                        public boolean isSpaceChar(int c) 
		                                                        {
		                                                            if (filter != null)
		                                                                return filter.isSpaceChar(c);
		                                                            return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
		                                                        }
		                                                     
		                                                        public String next() 
		                                                        {
		                                                            return readString();
		                                                        }
		                                                        
		                                                        public interface SpaceCharFilter 
		                                                        {
		                                                            public boolean isSpaceChar(int ch);
		                                                        }
		                                                    }
		                                                     
		                                                    public static void main(String args[]) throws Exception
		                                                    {
		                                                        new Thread(null, new Solution1(),"Solution",1<<26).start();
		                                                    }   
		                                                    static int gcd(int a, int b) 
		                                                    { 
		                                                      if (b == 0) 
		                                                        return a; 
		                                                      return gcd(b, a % b);  
		                                                    } 
		                                                    
		                                                    long MOD = 1000000007;
		                                                    
		                                                    ArrayList<Integer> adj[];
		                                                    public void run() 
		                                                    {
		                                                        
		                                                            //InputReader sc= new InputReader(new FileInputStream("input.txt"));
		                                                            //PrintWriter w= new PrintWriter(new FileWriter("output.txt"));
		                                                            InputReader sc = new InputReader(System.in);
		                                                            PrintWriter w = new PrintWriter(System.out);
		                                                            int n = sc.nextInt();
		                                                            int[] arr=  new int[n];
		                                                            for(int i = 0;i < n;i++) {
		                                                            	arr[i] = sc.nextInt();
		                                                            }
		                                                            sparse = new Pair[n][32];
		                                                            build(arr,n);
		                                                            int l = 0;
		                                                            int r = n-1;
		                                                            int ans = -1;
		                                                            while(l <= r) {
		                                                            	int mid = (l + r)/2;
		                                                            	if(fun(mid,n,arr)) {
		                                                            		ans = mid;
		                                                            		l = mid + 1;
		                                                            	}else {
		                                                            		r = mid - 1;
		                                                            	}
		                                                            }
		                                                            add(ans,n);
		                                                            w.println(ar.size() + " " + ans);
		                                                            for(int i = 0;i < ar.size();i++) {
		                                                            	w.print((ar.get(i)+1) + " ");
		                                                            }
		                                                            w.close();           
		                                                            
		                                                     }
		                                                    void add(int mid,int n) {
		                                                    	ar = new ArrayList();
		                                                    	for(int i = 0;i < n;i++) {
		                                                    		if(i + mid == n) {
		                                                    			break;
		                                                    		}else {
		                                                    			Pair both = query(i,i+mid);
		                                                    			if(both.a == both.b) {
		                                                    				ar.add(i);
		                                                    			}
		                                                    		}
		                                                    	}
		                                                    }
		                                                    boolean fun(int mid,int n,int[] arr) {
		                                                    	//int count = 0;
		                                                    	//temp = new ArrayList();
		                                                    	for(int i = 0;i < n;i++) {
		                                                    		if(i + mid == n) {
		                                                    			break;
		                                                    		}else {
		                                                    			Pair both = query(i,i+mid);
		                                                    			if(both.a == both.b) {
		                                                    				return true;
		                                                    			}
		                                                    		}
		                                                    	}
		                                                    	
		                                                    	return false;
		                                                    }
		                                                    ArrayList<Integer> ar = new ArrayList();
		                                                    //ArrayList<Integer> temp = new ArrayList();
		                                                    Pair sparse[][];
		                                                    void build(int arr[],int n) {
		                                                    	for(int i = 0;i < n;i++) {
		                                                    		sparse[i][0] = new Pair(arr[i],arr[i]);
		                                                    	}
		                                                    	for(int j = 1;(1 << j) <= n;j++) {
		                                                    		for(int i = 0;(i + (1 << j) - 1) < n;i++) {
		                                                    			Pair p1 = sparse[i][j-1];
		                                                    			Pair p2 = sparse[i + (1 << (j-1))][j-1];
		                                                    			sparse[i][j] = merge(p1,p2);
		                                                    		}
		                                                    	}
		                                                    }
		                                                    Pair query(int l,int r) {
		                                                    	int j = 31 - Integer.numberOfLeadingZeros(r-l+1);
		                                                    	Pair p1 = sparse[l][j];
		                                                    	Pair p2 = sparse[r - (1 << j ) + 1][j];
		                                                    	return merge(p1,p2);
		                                                    }
		                                                    Pair merge(Pair p1,Pair p2) {
		                                                    	return new Pair(gcd(p1.a,p2.a),Math.min(p1.b,p2.b));
		                                                    }
		                                                   
		                                                    class Pair implements Comparable<Pair>{
		                                                        int a;
		                                                        int b;
		                                                        //int c;
		                                                        Pair(int a,int b){
		                                                            this.b = b;
		                                                            this.a = a;
		                                                        }
		                                                        public boolean equals(Object o) {
		                                                            Pair p = (Pair)o;
		                                                            return this.a == p.a;
		                                                        }
		                                                        public int hashCode(){
		                                                            return Long.hashCode(a)*27 + Long.hashCode(b)* 31;
		                                                        }
		                                                        public int compareTo(Pair p) {
		                                                            if(this.b == p.b) {
		                                                            	return Integer.compare(this.a,p.a);
		                                                            }
		                                                            return Integer.compare(p.b,this.b);
		                                                        }
		                                                    }
		                                    }