#include <bits/stdc++.h>
using namespace std;
void fastIO() {
  std::ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
template <typename T, typename U>
inline void mnze(T &x, U y) {
  if (y < x) x = y;
}
template <typename T, typename U>
inline void mxze(T &x, U y) {
  if (x < y) x = y;
}
void _scan(int &x) { scanf("%d", &x); }
void _scan(long long &x) { scanf("%lld", &x); }
void _scan(double &x) { scanf("%lf", &x); }
void _scan(char &x) { scanf(" %c", &x); }
void _scan(char *x) { scanf("%s", x); }
template <typename T>
void _scan(vector<T> &v) {
  for (int i = 0; i < (int)v.size(); i++) _scan(v[i]);
}
void scan() {}
template <typename T, typename... U>
void scan(T &head, U &...tail) {
  _scan(head);
  scan(tail...);
}
template <typename T>
void _dbg(const char *sdbg, T h) {
  cerr << sdbg << "=" << h << "\n";
}
template <typename T, typename... U>
void _dbg(const char *sdbg, T h, U... t) {
  while (*sdbg != ',') cerr << *sdbg++;
  cerr << "=" << h << ",";
  _dbg(sdbg + 1, t...);
}
long long MOD = 1e9 + 7;
inline long long Msum(long long x) { return x; }
template <typename... Rest>
inline long long Msum(long long x, Rest... rest) {
  return (x + Msum(rest...)) % MOD;
}
inline long long Mprod(long long x) { return x; }
template <typename... Rest>
inline long long Mprod(long long x, Rest... rest) {
  return x * Mprod(rest...) % MOD;
}
inline long long Mnorm(long long x) { return (x % MOD + MOD) % MOD; }
int n;
vector<long long> v;
long long ans;
set<long long> seen;
void get_ans(long long p) {
  if (seen.count(p)) return;
  seen.insert(p);
  long long nans = 0;
  for (long long x : v) {
    long long q = x / p;
    if (q == 0)
      nans += abs((q + 1) * p - x);
    else
      nans += min(abs(q * p - x), abs((q + 1) * p - x));
  }
  mnze(ans, nans);
}
void try_primes(long long x) {
  for (long long d = 2; d * d <= x; d++) {
    if (x % d == 0) get_ans(d);
    while (x % d == 0) x /= d;
  }
  if (x > 1) get_ans(x);
}
int main() {
  srand(time(NULL));
  scan(n);
  v.resize(n);
  for (int i = 0; i < n; i++) scan(v[i]);
  ans = n;
  for (int i = 0; i < 22; i++) {
    int j = (1LL * rand() * RAND_MAX + rand()) % n;
    try_primes(v[j] - 1);
    try_primes(v[j]);
    try_primes(v[j] + 1);
  }
  printf("%lld\n", ans);
}
