#include <bits/stdc++.h>
using namespace std;
int n;
int x[200010];
int main() {
  cin >> n;
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x[i]);
  }
  sort(x + 1, x + n + 1);
  if (n <= 2) {
    cout << 1 << endl;
    cout << x[1] << endl;
  } else {
    int seglen = 0;
    int median = 1;
    double MAX = 0;
    int cnt = 1;
    double sum = x[1];
    int len = 0;
    for (int i = 2; i < n; i++) {
      len++;
      cnt += 2;
      sum += x[i];
      sum += x[n + 1 - len];
      while ((x[i - len] + x[n + 1 - len]) / 2.0 <= sum / cnt && len > 1) {
        sum -= x[i - len];
        sum -= x[n + 1 - len];
        len--;
        cnt -= 2;
      }
      if ((sum / cnt - x[i]) > MAX) {
        MAX = (sum / cnt - x[i]);
        seglen = len;
        median = i;
      }
    }
    cout << seglen * 2 + 1 << endl;
    for (int i = median - seglen; i <= median; i++) {
      printf("%d ", x[i]);
    }
    for (int i = n - seglen + 1; i <= n; i++) {
      printf("%d ", x[i]);
    }
  }
  return 0;
}
