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).
//sparse tree
import java.io.*; 
import java.util.*; 

public class p33{

	static class FastReader{ 
		BufferedReader br; 
		StringTokenizer st; 

		public FastReader() 
		{ 
			br = new BufferedReader(new
					InputStreamReader(System.in)); 
		} 

		String next() 
		{ 
			while (st == null || !st.hasMoreElements()) 
			{ 
				try
				{ 
					st = new StringTokenizer(br.readLine()); 
				} 
				catch (IOException e) 
				{ 
					e.printStackTrace(); 
				} 
			} 
			return st.nextToken(); 
		} 

		int nextInt() 
		{ 
			return Integer.parseInt(next()); 
		} 

		long nextLong() 
		{ 
			return Long.parseLong(next()); 
		} 

		double nextDouble() 
		{ 
			return Double.parseDouble(next()); 
		} 

		String nextLine() 
		{ 
			String str = ""; 
			try
			{ 
				str = br.readLine(); 
			} 
			catch (IOException e) 
			{ 
				e.printStackTrace(); 
			} 
			return str; 
		} 
	}

	static int gcd(int a, int b){
		if(a==0) return b;
		return gcd(b%a, a);
	}

	static int max = 300009;
	static int maxLog = 22;
	static int M[][] = new int[max][maxLog], Log[] = new int[max];

	static void buildSparse(int n, int[] arr){
 	   	for(int i=1;i<=n;i++) M[i][0] = arr[i];
    	for(int i=2;i<=n;i++) Log[i]=Log[i-1] + ((i&(i-1))==0?1:0);

	    for(int j=1; (1<<j)<=n ;j++){
	        for(int i=1; (i+ (1<<j)-1) <=n; i++)
	            M[i][j] = gcd(M[i][j-1], M[i + (1<<(j-1))][j - 1]);
	    }
	}

	static int Query(int i, int j){
		int k = Log[j-i+1];
		return gcd(M[i][k], M[j-(1<<k)+1][k]);
	}

	static int search1(int l, int r, int x){
		int end = r;
		while(l<=r){
			int mid = l + (r-l)/2;
			if(Query(mid, end)%x!=0)
				l = mid+1;
			else
				r = mid-1;
		}

		return r+1;
	}

	static int search2(int l, int r, int x){
		int st = l;
		while(l<=r){
			int mid = l + (r-l)/2;
			if(Query(st, mid)%x!=0)
				r = mid-1;
			else
				l = mid+1;
		}
		return l-1;
	}

	public static void main(String[] args){ 
		FastReader sc = new FastReader();
		int n = sc.nextInt();
		int[] arr = new int[n+1];
		int[][] ans = new int[n+1][2];

		for(int i=1;i<=n;i++){
			arr[i] = sc.nextInt();
		}
		buildSparse(n, arr);

		int maxlen = 0;
		for(int i=1;i<=n;i++){
			ans[i][0] = search1(1, i, arr[i]);
			ans[i][1] = search2(i, n, arr[i]);
			maxlen = Math.max(maxlen, ans[i][1]-ans[i][0]);
		}

		Set<Integer> set = new TreeSet<Integer>();
		for(int i=1;i<=n;i++){
			if(maxlen == ans[i][1]-ans[i][0])
				set.add(ans[i][0]);
		}

		System.out.println(set.size()+" "+maxlen);
		for(int x: set)
			System.out.print(x+" ");
		System.out.println("");
	}
}