#include <bits/stdc++.h>
using namespace std;
long long pre[200010];
int v[200010];
int n;
long long form(int i, int x) {
  return pre[n] - pre[n - x] + pre[i] - pre[i - x - 1] -
         1LL * (2 * x + 1) * v[i];
}
int solve(int i) {
  int range = min(i - 1, n - i);
  int lo = 0, hi = range + 1;
  while (hi - lo > 1) {
    int mid = (lo + hi) >> 1;
    if (1LL * (v[n - mid + 1] + v[i - mid] - 2 * v[i]) * (2 * (mid - 1) + 1) >=
        form(i, mid - 1) * 2)
      lo = mid;
    else
      hi = mid;
  }
  return lo;
}
int main() {
  ios_base::sync_with_stdio(false);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> v[i];
  }
  sort(v + 1, v + n + 1);
  for (int i = 1; i <= n; ++i) pre[i] = pre[i - 1] + v[i];
  int best = 1;
  int bestr = 0;
  for (int i = 1; i <= n; ++i) {
    int locr = solve(i);
    if (form(best, bestr) * (2 * locr + 1) < form(i, locr) * (2 * bestr + 1)) {
      best = i;
      bestr = locr;
    }
  }
  cout << 2 * bestr + 1 << "\n";
  for (int i = best - bestr; i <= best; ++i) cout << v[i] << " ";
  for (int i = n - bestr + 1; i <= n; ++i) cout << v[i] << " ";
}
