Simon has an array a₁,a₂,...,a_n, 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 a_l,a_l+1,...,a_r are divisible by a_j;
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.

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

The second line contains n space-separated integers a₁,a₂,...,a_n (1≤a_i≤10⁶).

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.