A - Soldier and Badges CodeForces - 546B

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

4
1 3 1 4

Output

1

Input

5
1 2 3 2 5

Output

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.

题意就是输入一个数列，有相同的数就通过加一来变得不相同，问最少加几次；

注意如果数加1之后任然和其他数相同，那就得继续加1；

开始想到用while模拟这个重复加1的过程，但是会RT；

最后也是模拟题意，不过比while直接模拟巧妙点。

#include"iostream"
#include"algorithm"
#include"cstring"
using namespace std;
int main()
{
	int n;
	while(cin >> n)
	{
		int b[3005]={0};
		for(int i = 0;i < n;i ++)
		{
			cin >> b[i];
		}
		sort(b,b+n);
		int m,sum = 0;
		for(int i = 1;i < n;i ++)
		{
			if(b[i] <= b[i-1])
			{
				m=b[i-1]-b[i]+1;
				b[i]+=m;
				sum +=m;
			}
		}
		cout<<sum<<endl;
	}
	return 0;
}