#include <bits/stdc++.h>
using namespace std;
const int N = int(3e5), mod = int(1e9) + 7;
int n;
pair<int, int> x[N];
long long second[N], id, len;
pair<long long, long long> cur;
pair<long long, long long> get(int i, int j) {
  pair<long long, long long> a;
  a.first = 1ll * 2 * j * x[i].first -
            (second[n] - second[n - j] + second[i - 1] - second[i - 1 - j]);
  a.second = 2 * j + 1;
  return a;
}
bool check(pair<long long, long long> a, pair<long long, long long> b) {
  return a.first * b.second <= a.second * b.first;
}
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &x[i].first);
    x[i].second = i;
  }
  sort(x + 1, x + n + 1);
  for (int i = 1; i <= n; i++) {
    second[i] = second[i - 1] + x[i].first;
  }
  cur.second = 1;
  bool first = 0;
  for (int i = 2; i < n; i++) {
    int l = 1, r = min(i - 1, n - i);
    int best = 1;
    if (r == 1 || check(get(i, r), get(i, r - 1))) {
      best = r;
    } else {
      while (r - l > 1) {
        int mid = (l + r) >> 1;
        pair<long long, long long> a = get(i, mid), b = get(i, mid + 1);
        if (check(b, a)) {
          l = mid;
          best = mid + 1;
        } else
          r = mid;
      }
    }
    pair<long long, long long> a = get(i, best);
    if (check(a, cur)) {
      id = i;
      len = best;
      cur = a;
      first = 1;
    }
  }
  if (!first) {
    printf("1\n%d", x[1].first);
    return 0;
  }
  printf("%d\n", 2 * len + 1);
  for (int i = 1; i <= n; i++) {
    if (id - len <= i && i <= id)
      printf("%d ", x[i].first);
    else if (n - len + 1 <= i)
      printf("%d ", x[i].first);
  }
  return 0;
}
