B'Bessie and the cows have recently been playing with "cool" sequences and are trying to construct some. Unfortunately they are bad at arithmetic, so they need your help! A pair (x, xe2 x80 x89y) of positive integers is "cool" if x can be expressed as the sum of y consecutive integers (not necessarily positive). A sequence (a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an) is "cool" if the pairs (a1, xe2 x80 x89a2), xe2 x80 x89(a2, xe2 x80 x89a3), xe2 x80 x89..., xe2 x80 x89(an xe2 x80 x89- xe2 x80 x891, xe2 x80 x89an) are all cool. The cows have a sequence of n positive integers, a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an. In one move, they may replace some ai with any other positive integer (there are no other limits on the new value of ai). Determine the smallest number of moves needed to make the resulting sequence cool. The first line contains a single integer, n (2 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xe2 x80 x89 xe2 x89 xa4 xe2 x80 x895000). The next line contains n space-separated integers, a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89an (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x891015). Please do not use the %lld specifier to read or write 64-bit integers in xd0 xa1++. It is preferred to use the cin, cout streams or the %I64d specifier. A single integer, the minimum number of ai that must be changed to make the sequence cool. In the first sample, the sequence is already cool, so we don 't need to change any elements. In the second sample, we can change a2 to 5 and a3 to 10 to make (20, 5, 10, 4) which is cool. This changes 2 elements.'...