CodeForces - 546B

B. Soldier and Badges

time limit per test

3 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Colonel has n badges. He wants to give one badge to every of his n soldiers. Each badge has a coolness factor, which shows how much it's owner reached. Coolness factor can be increased by one for the cost of one coin.

For every pair of soldiers one of them should get a badge with strictly higher factor than the second one. Exact values of their factors aren't important, they just need to have distinct factors.

Colonel knows, which soldier is supposed to get which badge initially, but there is a problem. Some of badges may have the same factor of coolness. Help him and calculate how much money has to be paid for making all badges have different factors of coolness.

Input

First line of input consists of one integer n (1 ≤ n ≤ 3000).

Next line consists of n integers ai (1 ≤ ai ≤ n), which stand for coolness factor of each badge.

Output

Output single integer — minimum amount of coins the colonel has to pay.

Examples

input

Copy

4
1 3 1 4

output

Copy

1

input

Copy

5
1 2 3 2 5

output

Copy

2

Note

In first sample test we can increase factor of first badge by 1.

In second sample test we can increase factors of the second and the third badge by 1.

#include<iostream>
using namespace std;
#include<algorithm>
int main()
{
	int a[3010];
	int n,i,j,count=0;
	cin>>n;
	for(i=0;i<n;i++)
	{
		cin>>a[i];
	}
	sort(a,a+n);//从小到达排序好
   
	for(i=0;i<n-1;i++)
	{
		if(a[i]==a[i+1])//如果相等，则后者加一，但是就会有1112类似这样的，第二个
		{
			a[i+1]++;      //1加一后变成2就会比后面的大，因为得保持顺序，所以看下面一个判断
			count++;
		}
		if(a[i]>a[i+1])//如果加完后比后面的大，就得把后面的加大
		{
			count=count+a[i]-a[i+1]+1;
			a[i+1]=a[i]+1;
		}
	}
	printf("%d",count);
}