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).

// Problem : D. Pair of Numbers
// Contest : Codeforces Round #209 (Div. 2)
// URL : https://codeforces.com/contest/359/problem/D
// Memory Limit : 256 MB
// Time Limit : 2000 ms
// Powered by CP Editor (https://github.com/cpeditor/cpeditor)

import java.io.*;
import java.util.*;

public class a {

	public static void main(String[] args) {
		FastReader scan = new FastReader();
		PrintWriter out = new PrintWriter(System.out);
		Task solver = new Task();
		//int t = scan.nextInt();
		int t = 1;
		for(int i = 1; i <= t; i++) solver.solve(i, scan, out);
		out.close();
	}

	static class Task {

		public void solve(int testNumber, FastReader sc, PrintWriter pw) {
			int n = sc.nextInt();
			tup[] arr= new tup[n];
			int[] arrs = new int[n];
			for(int i=0;i<n;i++){
				arr[i]=new tup(sc.nextInt(),i);
				arrs[i]=arr[i].a;
			}
			Arrays.sort(arr);
			int[] ans= new int[n];
			ArrayList<tup> ch = new ArrayList<tup>();
			int max = 0;
			for(int i=0;i<n;i++){
				if(ans[arr[i].b]>0){
					continue;
				}
				else{
					int ctr = 0;
					int t = arr[i].b;
					while(t<n&&arrs[t]%arrs[arr[i].b]==0){
						//pw.println(arrs[t]+" "+arrs[arr[i].b]);
						ans[t++]=i+1;
						ctr++;
					}
					
					t = arr[i].b-1;
					while(t>=0&&arrs[t]%arrs[arr[i].b]==0){
						//pw.println(arrs[t]+" "+arrs[arr[i].b]);
						ans[t--]=i+1;
						ctr++;
					}
					max= Math.max(ctr,max);
					ch.add(new tup(ctr,t+1));
				}
			}
			//pw.println(Arrays.toString(ans));
			ArrayList<Integer> out = new ArrayList<Integer>();
			int out2 = 0;
			for(tup check : ch){
				if(check.a==max){
					out.add(check.b+1);
					out2++;
				}
			}
			Collections.sort(out);
			pw.println(out2 + " "+ (max-1));
			for(int x: out){
				pw.print(x+" ");
			}
		}
	}
	static class tup implements Comparable<tup> {
		int a, b;
		tup(int a, int b){
			this.a=a;
			this.b=b;
		}
		@Override
		public int compareTo(tup o2){
			return Integer.compare(a,o2.a);
			
		}
	}
	static void shuffle(int[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			int temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static void shuffle(long[] a) {
		Random get = new Random();
		for (int i = 0; i < a.length; i++) {
			int r = get.nextInt(a.length);
			long temp = a[i];
			a[i] = a[r];
			a[r] = temp;
		}
	}

	static class FastReader {
		BufferedReader br;
		StringTokenizer st;

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

		public FastReader(String s) throws FileNotFoundException {
			br = new BufferedReader(new FileReader(new File(s)));
		}

		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;
		}
	}

}