#include <bits/stdc++.h>
using namespace std;
bool sortbysec(const pair<int, int> &a, const pair<int, int> &b) {
  return (a.second < b.second);
}
bool prime[1000000 + 9];
void seive() {
  long long int N = 1e6 + 1;
  memset(prime, true, sizeof(prime));
  prime[0] = false;
  prime[1] = false;
  for (long long int i = 2; i * i <= N; i++) {
    if (prime[i]) {
      for (long long int j = i * i; j <= N; j += i) {
        prime[j] = false;
      }
    }
  }
}
bool isPowerOfTwo(int x) { return (x && !(x & (x - 1))); }
bool is_prime(int n) {
  if (n <= 1) return false;
  if (n <= 3) return true;
  if (n % 2 == 0 || n % 3 == 0) return false;
  for (int i = 5; i * i <= n; i = i + 6)
    if (n % i == 0 || n % (i + 2) == 0) return false;
  return true;
}
long long int dp[2006][2006];
long long int good(long long int ar[], int i, int j) {
  if (i == j) return 0;
  if (dp[i][j] != -1) return dp[i][j];
  return dp[i][j] = (ar[j] - ar[i]) + ((good(ar, i + 1, j) > good(ar, i, j - 1))
                                           ? good(ar, i, j - 1)
                                           : good(ar, i + 1, j));
}
void hemant() {
  int n;
  cin >> n;
  long long int ans = 0;
  long long int ar[n + 1];
  ar[0] = 0;
  for (int i = 1; i <= n; i++) {
    cin >> ar[i];
  }
  sort(ar + 1, ar + n + 1);
  for (int i = 1; i <= n; i++) {
    ans = ans + abs(ar[i] - i);
  }
  cout << ans << "\n";
  cout << "\n";
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  ;
  int t = 1;
  for (int i = 1; i <= t; i++) {
    hemant();
  }
  return 0;
}
