CodeForces978D Almost Arithmetic Progression（模拟&思维）

Polycarp likes arithmetic progressions. A sequence [a1,a2,…,an][a1,a2,…,an] is called an arithmetic progression if for each ii (1≤i<n1≤i<n) the value ai+1−aiai+1−ai 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][b1,b2,…,bn]. 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 bb which can be changed (by exactly one), so that the sequence bb 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 nn (1≤n≤100000)(1≤n≤100000) — the number of elements in bb.

The second line contains a sequence b1,b2,…,bnb1,b2,…,bn (1≤bi≤109)(1≤bi≤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

4
24 21 14 10

Output

3

Input

2
500 500

Output

0

Input

3
14 5 1

Output

-1

Input

5
1 3 6 9 12

Output

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.

题意：给出n个数，每个数可以进行三个操作：+1，0，-1。问最少多少个数操作后能使整个数列变为等差数列，如果不能则输出-1。

解题思路：只需对a[0],a[1]两个元素暴力，确定了等差数列的前两个元素即可确定等差数列的公差，随后判断后面n-2个数能不能修改成功。

AC代码：

#include<stdio.h>
#include<stdlib.h>
#include<iostream>
#include<math.h>
#include<algorithm>
using namespace std;
#define INF 0x3f3f3f3f
typedef long long ll;

ll a[100010],b[100010];

int main()
{
	int n;
	while(~scanf("%d",&n))
	{
		for(int i=0;i<n;i++)
		{
			scanf("%lld",&a[i]);
		}
		
		ll ans=0,minn=INF,d;
		int flag;
		for(int i=-1;i<=1;i++)
		{
			for(int j=-1;j<=1;j++)
			{
				ans=0;
				flag=1;
				ans+=abs(i)+abs(j);//累加修改元素的个数 
				
				b[0]=a[0]+i;//对第一个元素遍历操作 
				b[1]=a[1]+j;//对第二个元素遍历操作 
				d=b[1]-b[0];//确定了前两个元素即可确定公差 
				for(int k=2;k<n;k++)//对后n-2个元素判断 
				{
					if(abs((b[k-1]+d)-a[k])<=1)//如果该元素能够修改成为等差数列里的元素 
					{
						b[k]=b[k-1]+d;//则确定这个元素 
						ans+=abs(b[k]-a[k]);//累加修改元素的步数 
					}
					else
					{
						flag=0; 
						break;
					}
				}
				if(flag)
				{
					if(ans<minn) minn=ans;
				}
			}
		}
		if(minn<INF) printf("%lld\n",minn);
		else printf("-1\n");
	}
	return 0;
}