#include <bits/stdc++.h>
using namespace std;
inline long long IN() {
  long long x = 0;
  int ch = getchar(), f = 1;
  while (!isdigit(ch) && (ch != '-') && (ch != EOF)) ch = getchar();
  if (ch == '-') {
    f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
inline void OUT(long long x) {
  if (x < 0) putchar('-'), x = -x;
  if (x >= 10)
    OUT(x / 10), putchar(x % 10 + '0');
  else
    putchar(x + '0');
}
const int N = 200005;
long long Ans = 0, Ps = 1, L = 0, p[N];
int n, a[N];
int main() {
  n = IN();
  for (int i = 1; i <= n; i++) a[i] = IN();
  sort(a + 1, a + n + 1);
  for (int i = 1; i <= n; i++) p[i] = p[i - 1] + a[i];
  for (int i = 2; i <= n - 1; i++) {
    int l = 1, r = min(i - 1, n - i);
    while (l < r) {
      int Sy = l + (r - l) / 3, Se = r - (r - l) / 3;
      long long Vy = p[n] - p[n - Sy] + p[i] - p[i - Sy - 1];
      long long Ve = p[n] - p[n - Se] + p[i] - p[i - Se - 1];
      if (Vy * (Se * 2 + 1) >= Ve * (Sy * 2 + 1))
        r = Se - 1;
      else
        l = Sy + 1;
    }
    long long Vl = p[n] - p[n - l] + p[i] - p[i - l - 1];
    Vl -= 1ll * (2 * l + 1) * a[i];
    if (Vl * (L * 2 + 1) > (double)Ans * (l * 2 + 1)) Ans = Vl, Ps = i, L = l;
  }
  OUT(L * 2 + 1), putchar('\n');
  for (int i = Ps - L; i <= Ps; i++) OUT(a[i]), putchar(' ');
  for (int i = n - L + 1; i <= n; i++) OUT(a[i]), putchar(' ');
}
