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:
-
there is integer j (l≤j≤r), such that all integers al,al+1,...,ar are divisible by aj;
-
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.
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.
Simon 有一个长度为 N的正整数数列 a1
, a2 ,…, an，现在他想找到这个数列中最长的一个区间，满足区间中有一个数 x可以整除区间中任意数。
输出
第一行输出两个正整数 cnt,len，表示满足要求的最长区间的个数与长度。
第二行输出cnt个升序排列的正整数，表示所有满足要求的最长区间的左端点。
这里，区间的长度定义为右端点减左端点。
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).