import sys
native_input = input
input = lambda: sys.stdin.readline().strip()
import string
def solve():
n, = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
l = []
ans = 0
for i in range(1, n):
if a[i - 1] == a[i]:
l.append(a[i])
elif a[i - 1] + 1 < a[i]:
for j in range(a[i - 1] + 1, a[i]):
if not len(l):
break
k = l.pop()
ans += j - k
if len(l):
for i in range(len(l)):
k = l.pop()
ans += a[-1] + 1 + i - k
print(ans)
solve()#include<bits/stdc++.h>
using namespace std;
#define endl "\n" ;
#define sort(v) sort(v.begin() , v.end());
#define reverse(v) reverse(v.begin() , v.end());
typedef pair<long long, long long > ii;
typedef vector<long long > vl;
typedef vector<int>vi ;
typedef vector<ii> vii;
typedef long long ll;
const int N = 1e6 + 5;
int oo = 100000;
ll const MOD = 1e9 + 7;
int dx[] = { 0, 1, -1,0 };
int dy[] = { 1,0 , 0,-1 };
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int n ; cin >> n ;
vi v(n);
for (int i = 0 ; i < n ; i ++ )cin>>v[i];
sort(v);
int sol = 0 ;
for (int i = 1 ; i < n ; i ++ ){
for(int j = 0 ; j < i ; j ++ ){
if(v[i]==v[j]){
sol++;
v[i]++;
}
}
}
cout <<sol;
return 0;
}
436. Find Right Interval | 435. Non-overlapping Intervals |
406. Queue Reconstruction by Height | 380. Insert Delete GetRandom O(1) |
332. Reconstruct Itinerary | 368. Largest Divisible Subset |
377. Combination Sum IV | 322. Coin Change |
307. Range Sum Query - Mutable | 287. Find the Duplicate Number |
279. Perfect Squares | 275. H-Index II |
274. H-Index | 260. Single Number III |
240. Search a 2D Matrix II | 238. Product of Array Except Self |
229. Majority Element II | 222. Count Complete Tree Nodes |
215. Kth Largest Element in an Array | 198. House Robber |
153. Find Minimum in Rotated Sorted Array | 150. Evaluate Reverse Polish Notation |
144. Binary Tree Preorder Traversal | 137. Single Number II |
130. Surrounded Regions | 129. Sum Root to Leaf Numbers |
120. Triangle | 102. Binary Tree Level Order Traversal |
96. Unique Binary Search Trees | 75. Sort Colors |