#include <bits/stdc++.h>
using namespace std;
const int N = 500001;
const int oo = 1e9;
const int LOGN = 20;
const int MOD = 1000000007;
const double PI = acos(-1);
int n, a[N];
int main() {
  cin >> n;
  for (int i = 0; i < n; ++i) {
    cin >> a[i];
  }
  int mn = oo, idx = -1;
  for (int t = 1; t <= 101; ++t) {
    int cur = 0;
    for (int j = 0; j < n; ++j) {
      int cst = max(0, abs(a[j] - t) - 1);
      cur += cst;
    }
    if (cur < mn) {
      mn = cur;
      idx = t;
    }
  }
  cout << idx << " " << mn << endl;
  return 0;
}
