B'You are given array ai of length n. You may consecutively apply two operations to this array: Please note that each of operations may be applied at most once (and may be not applied at all) so you can remove only one segment and each number may be changed (increased or decreased) by at most 1. Also note, that you are not allowed to delete the whole array. Your goal is to calculate the minimum number of coins that you need to spend in order to make the greatest common divisor of the elements of the resulting array be greater than 1. The first line of the input contains integers n, a and b (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891 xe2 x80 x89000 xe2 x80 x89000, xe2 x80 x890 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89a, xe2 x80 x89b xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- the length of the array, the cost of removing a single element in the first operation and the cost of changing an element, respectively. The second line contains n integers ai (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89109) -- elements of the array. Print a single number -- the minimum cost of changes needed to obtain an array, such that the greatest common divisor of all its elements is greater than 1. In the first sample the optimal way is to remove number 3 and pay 1 coin for it. In the second sample you need to remove a segment [17, xe2 x80 x8913] and then decrease number 6. The cost of these changes is equal to 2 xc2 xb73 xe2 x80 x89+ xe2 x80 x892 xe2 x80 x89= xe2 x80 x898 coins.'...