#include <stdio.h>
#include <stdlib.h>

void merge_sort(int n, int x[])
{
	static int y[200001] = {};
	if (n <= 1) return;
	merge_sort(n / 2, &(x[0]));
	merge_sort((n + 1) / 2, &(x[n/2]));
	
	int i, p, q;
	for (i = 0, p = 0, q = n / 2; i < n; i++) {
		if (p >= n / 2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p] < x[q])? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

typedef struct {
	int key, id;
} data;

typedef struct {
	data obj[400001];
	int size;
} max_heap;

void push(max_heap* h, data x)
{
	int i = ++(h->size), j = i >> 1;
	data tmp;
	h->obj[i] = x;
	while (j > 0) {
		if (h->obj[i].key > h->obj[j].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j >>= 1;
		} else break;
	}
}

data pop(max_heap* h)
{
	int i = 1, j = 2;
	data output = h->obj[1], tmp;
	h->obj[1] = h->obj[(h->size)--];
	while (j <= h->size) {
		if (j < h->size && h->obj[j^1].key > h->obj[j].key) j ^= 1;
		if (h->obj[j].key > h->obj[i].key) {
			tmp = h->obj[j];
			h->obj[j] = h->obj[i];
			h->obj[i] = tmp;
			i = j;
			j <<= 1;
		} else break;
	}
	return output;
}

int main()
{
	int i, N, A[200001];
	scanf("%d", &N);
	for (i = 0; i < N; i++) scanf("%d", &(A[i]));
	merge_sort(N, A);
	
	int j, k, mate[200001];
	max_heap h;
	data d;
	long long ans = 0;
	h.size = 0;
	mate[0] = 0;
	d.key = A[0];
	d.id = A[0];
	push(&h, d);
	for (i = 1; i < N; i++) {
		d = pop(&h);
		if (A[i] >= d.key + 1) {
			push(&h, d);
			mate[i] = 0;
			d.key = A[i];
			d.id = A[i];
			if (h.size > 0 && h.obj[1].key == d.id - 1) {
				h.obj[1].key = d.key;
			} else push(&h, d);
		} else {
			for (j = i - (d.key - d.id + 1), k = 0; j < i; j++) if (mate[j] > 0) k++;
			if (abs(d.id - 1 - A[i]) - k < abs(d.key + 1 - A[i])) {
				for (j = i - (d.key - d.id + 1), k = 0; j < i; j++) mate[j]--;
				mate[i] = d.key - A[i];
				d.id--;
				if (h.size > 0 && h.obj[1].key == d.id - 1) {
					h.obj[1].key = d.key;
				} else push(&h, d);
			} else {
				mate[i] = ++d.key - A[i];
				push(&h, d);
			}
		}
	}
	for (i = 0; i < N; i++) ans += abs(mate[i]);
	printf("%lld\n", ans);
	fflush(stdout);
	return 0;
}