#include <bits/stdc++.h>
using namespace std;
const long long oo = 2147383647;
const double PI = 2 * acos(0.0);
const double eps = 1e-9;
inline long long gcd(long long a, long long b) {
  a = ((a) < 0 ? -(a) : (a));
  b = ((b) < 0 ? -(b) : (b));
  while (b) {
    a = a % b;
    swap(a, b);
  }
  return a;
}
long long ext_gcd(long long A, long long B, long long *X, long long *Y) {
  long long x2, y2, x1, y1, x, y, r2, r1, q, r;
  x2 = 1;
  y2 = 0;
  x1 = 0;
  y1 = 1;
  for (r2 = A, r1 = B; r1 != 0;
       r2 = r1, r1 = r, x2 = x1, y2 = y1, x1 = x, y1 = y) {
    q = r2 / r1;
    r = r2 % r1;
    x = x2 - (q * x1);
    y = y2 - (q * y1);
  }
  *X = x2;
  *Y = y2;
  return r2;
}
inline long long modInv(long long a, long long m) {
  long long x, y;
  ext_gcd(a, m, &x, &y);
  x %= m;
  if (x < 0) x += m;
  return x;
}
inline long long power(long long a, long long p) {
  long long res = 1, x = a;
  while (p) {
    if (p & 1) res = (res * x);
    x = (x * x);
    p >>= 1;
  }
  return res;
}
inline long long bigmod(long long a, long long p, long long m) {
  long long res = 1 % m, x = a % m;
  while (p) {
    if (p & 1) res = (res * x) % m;
    x = (x * x) % m;
    p >>= 1;
  }
  return res;
}
const int N = 100001;
map<int, int> ss;
int lo = oo, hi = -oo;
int one(vector<int> &x, vector<int> &rs) {
  int a = lo, b = lo + 1, c = hi;
  int ca = ss[a], cb = ss[b], cc = ss[c];
  int _c = min(ca, cc);
  ca -= _c;
  cc -= _c;
  cb += 2 * _c;
  while (ca--) rs.push_back(a);
  while (cb--) rs.push_back(b);
  while (cc--) rs.push_back(c);
  sort(rs.begin(), rs.end());
  sort(x.begin(), x.end());
  int cnt = 0;
  for (int i = 0; i < rs.size(); i++) {
    if (rs[i] == x[i]) cnt++;
  }
  return cnt;
}
int another(vector<int> &x, vector<int> &rs) {
  int a = lo, b = lo + 1, c = hi;
  int ca = ss[a], cb = ss[b], cc = ss[c];
  int d = cb / 2;
  cb %= 2;
  ca += d;
  cc += d;
  while (ca--) rs.push_back(a);
  while (cb--) rs.push_back(b);
  while (cc--) rs.push_back(c);
  sort(rs.begin(), rs.end());
  sort(x.begin(), x.end());
  int cnt = 0;
  for (int i = 0; i < rs.size(); i++) {
    if (rs[i] == x[i]) cnt++;
  }
  return cnt;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  int n;
  cin >> n;
  vector<int> x, h, k;
  for (int i = 1; i <= n; i++) {
    int t;
    cin >> t;
    x.push_back(t);
    ss[t]++;
    lo = min(lo, t);
    hi = max(hi, t);
  }
  sort(x.begin(), x.end());
  if (hi - lo <= 1) {
    cout << n << endl;
    for (int i = 0; i < x.size(); i++) cout << x[i] << " ";
    cout << endl;
  } else {
    int f1 = one(x, h);
    int f2 = another(x, k);
    if (f1 < f2) {
      cout << f1 << endl;
      for (int i = 0; i < h.size(); i++) cout << h[i] << " ";
      cout << endl;
    } else {
      cout << f2 << endl;
      for (int i = 0; i < k.size(); i++) cout << k[i] << " ";
      cout << endl;
    }
  }
  return 0;
}
