CF359D Pair of Numbers

Simon has an array $ a_{1},a_{2},...,a_{n} $ , consisting of $ n $ positive integers. Today Simon asked you to find a pair of integers $ l,r $ $ (1

The first line contains integer $ n $ ( $ 1

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.

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