## Algorithm

D. Almost Arithmetic Progression
time limit per test
1 second
memory limit per test
256 megabytes
input
standard input
output
standard output

Polycarp likes arithmetic progressions. A sequence [a1,a2,,an][�1,�2,…,��] is called an arithmetic progression if for each i (1i<n1≤�<�) the value ai+1ai��+1−�� is the same. For example, the sequences [42][42][5,5,5][5,5,5][2,11,20,29][2,11,20,29] and [3,2,1,0][3,2,1,0] are arithmetic progressions, but [1,0,1][1,0,1][1,3,9][1,3,9] and [2,3,1][2,3,1] are not.

It follows from the definition that any sequence of length one or two is an arithmetic progression.

Polycarp found some sequence of positive integers [b1,b2,,bn][�1,�2,…,��]. He agrees to change each element by at most one. In the other words, for each element there are exactly three options: an element can be decreased by 11, an element can be increased by 11, an element can be left unchanged.

Determine a minimum possible number of elements in b which can be changed (by exactly one), so that the sequence b becomes an arithmetic progression, or report that it is impossible.

It is possible that the resulting sequence contains element equals 00.

Input

The first line contains a single integer n (1n100000)(1≤�≤100000) — the number of elements in b.

The second line contains a sequence b1,b2,,bn�1,�2,…,�� (1bi109)(1≤��≤109).

Output

If it is impossible to make an arithmetic progression with described operations, print -1. In the other case, print non-negative integer — the minimum number of elements to change to make the given sequence becomes an arithmetic progression. The only allowed operation is to add/to subtract one from an element (can't use operation twice to the same position).

Examples
input
Copy
424 21 14 10
output
Copy
3
input
Copy
2500 500
output
Copy
0
input
Copy
314 5 1
output
Copy
-1
input
Copy
51 3 6 9 12
output
Copy
1
Note

In the first example Polycarp should increase the first number on 11, decrease the second number on 11, increase the third number on 11, and the fourth number should left unchanged. So, after Polycarp changed three elements by one, his sequence became equals to [25,20,15,10][25,20,15,10], which is an arithmetic progression.

In the second example Polycarp should not change anything, because his sequence is an arithmetic progression.

In the third example it is impossible to make an arithmetic progression.

In the fourth example Polycarp should change only the first element, he should decrease it on one. After that his sequence will looks like [0,3,6,9,12][0,3,6,9,12], which is an arithmetic progression.

## Code Examples

### #1 Code Example with C++ Programming

Code - C++ Programming

#include <bits/stdc++.h>

using namespace std;

int const N = 1e5 + 1;
int n, a[N], b[N];

int check(int chn) {
for(int i = 0; i < n; ++i)
b[i] = a[i];

int fac = b[1] - b[0];
for(int i = 2; i < n; ++i) {
if(b[i] - b[i-1] == fac)
continue;
if((b[i] - 1) - b[i-1] == fac) {
--b[i];
++chn;
continue;
}
if((b[i] + 1) - b[i-1] == fac) {
++b[i];
++chn;
continue;
}
return 1e9;
}

return chn;
}

int main() {
cin >> n;
for(int i = 0; i < n; ++i)
cin >> a[i];

if(n <= 2) {
cout << 0 << endl;
return 0;
}

int res = 1e9;
res = check(0);                                         // .. ..
++a[0], ++a[1];res = min(res, check(2));--a[0], --a[1]; // ++ ++
--a[0], --a[1];res = min(res, check(2));++a[0], ++a[1]; // -- --
++a[0];res = min(res, check(1));--a[0];                 // ++ ..
++a[1];res = min(res, check(1));--a[1];                 // .. ++
--a[0];res = min(res, check(1));++a[0];                 // -- ..
--a[1];res = min(res, check(1));++a[1];                 // .. --
--a[0], ++a[1];res = min(res, check(2));++a[0], --a[1]; // -- ++
++a[0], --a[1];res = min(res, check(2));--a[0], ++a[1]; // ++ --

if(res == 1e9)
cout << -1 << endl;
else
cout << res << endl;

return 0;
}
Copy The Code &

Input

cmd
4
24 21 14 10

Output

cmd
3