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.util.*;
import java.io.*;
/*NO RESPECT*/

public class Main implements Runnable {
static boolean showTime = false;		
        public int gcd(int m, int n){
            if(n == 0)
                return m;
            else
                return gcd(n, m % n);
        }
        
        private int getGcd(int[][] gcd, int l, int r){
            int size = r - l + 1;
            int x = 1;
            int k = 0;
            while(x * 2 <= size){
                x = x * 2; k++;
            }
            return gcd(gcd[k][l], gcd[k][r - x + 1]);
        }
        
	public void solve() throws IOException {
		int n = nextInt();
                int[] a = new int[n];
                for(int i = 0; i < n; i++) a[i] = nextInt();
                
                final int MAX = 20;
                int[][] gcd = new int[MAX][n] ;
                for(int i = 0; i < n; i++) gcd[0][i] = a[i];
                
                //sparse table
                for(int i = 1; i < MAX; i++){
                    for(int j = 0; j < n; j++){
                        int next = j + (1 << (i-1));
                        if(next >= n){
                            gcd[i][j] = gcd[i-1][j];
                        }
                        else{
                            gcd[i][j] = gcd(gcd[i-1][j], gcd[i-1][next]);
                        }
                    }
                }
                
                ArrayList<Integer> answer = new ArrayList<>();
                int best = -1;
                int[] left = new int[n];
                int[] right = new int[n];
                for(int i = 0; i < n; i++){
                    left[i] = i;
                    right[i] = i;
                    int l = i, r = n - 1;
                    while(l <= r){
                        int m = (l + r) >> 1;
                        if(getGcd(gcd, i, m) == a[i]){
                            right[i] = m;
                            l = m + 1;
                        }
                        else{
                            r = m - 1;
                        }
                    }
                    
                    l = 0; 
                    r = i;
                    while(l <= r){
                        int m = (l + r) >> 1;
                        if(getGcd(gcd, m, i) == a[i]){
                            left[i] = m;
                            r = m - 1;
                        }
                        else{
                            l = m + 1;
                        }
                    }
                    
                    if(right[i] - left[i] > best){
                        best = right[i] - left[i];
                        answer.clear();
                        answer.add(left[i] + 1);
                    }
                    else if(right[i] - left[i] == best){
                        answer.add(left[i] + 1);
                    }
                }
                
                Set<Integer> set = new TreeSet<>();
                for(int i : answer) set.add(i);
                
                answer.clear();
                for(int i : set) answer.add(i);
                
                out.println(answer.size() + " " + best);
                for(int i = 0; i < answer.size(); i++){
                    if(i > 0) out.print(" ");
                    out.print(answer.get(i));
                }
                out.println();
	}

	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	
	//-----------------------------------------------------------
	public static void main(String[] args) {
		new Main().run();
	}

        public void debug(Object... arr){
            System.out.println(Arrays.deepToString(arr));
        }

        public void print1Int(int[] a){
                for(int i = 0; i < a.length; i++)
                        System.out.print(a[i] + " ");
                System.out.println();
        }
        
        public void print2Int(int[][] a){
                for(int i = 0; i < a.length; i++){
                        for(int j = 0; j < a[0].length; j++){
                                System.out.print(a[i][j] + " ");
                        }
                        System.out.println();
                }
        }
        
	public void run() {
		try {
			in = new BufferedReader(new InputStreamReader(System.in));
                        out = new PrintWriter(System.out);
			tok = null;
			long start = System.currentTimeMillis();
			solve();
                        long end = System.currentTimeMillis();
                        if(showTime)System.err.println( (end - start) / 1000.0);
			in.close();
                        out.close();
		} catch (IOException e) {
			System.exit(0);
		}
	}

	public String nextToken() throws IOException {
		while (tok == null || !tok.hasMoreTokens()) {
			tok = new StringTokenizer(in.readLine());
		}
		return tok.nextToken();
	}

	public int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	public long nextLong() throws IOException {
		return Long.parseLong(nextToken());
	}

	public double nextDouble() throws IOException {
		return Double.parseDouble(nextToken());
	}
        PrintWriter out;
	BufferedReader in;
	StringTokenizer tok;
}