#include <bits/stdc++.h>   using namespace std;   const int N = 2e5 + 5;   long long a[N], pre[N];   int n;   long long check(int p, int len) {     return pre[p] - pre[p - len - 1] + pre[n] - pre[n - len];   }   int main() {     scanf( %d , &n);     for (int i = 1; i <= n; i++) scanf( %lld , &a[i]);     sort(a + 1, a + 1 + n);     for (int i = 1; i <= n; i++) pre[i] = pre[i - 1] + a[i];     int p = 1, len = 0;     long long ans = 0;     for (int i = 1; i <= n; i++) {       int l = 1, r = min(i - 1, n - i), mid;       while (r >= l) {         mid = l + r >> 1;         if ((long long)check(i, mid) * (mid * 2 - 1) >=             (long long)check(i, mid - 1) * (mid * 2 + 1)) {           l = mid + 1;           if ((long long)check(i, mid) * (len * 2 + 1) -                   a[i] * (len * 2 + 1) * (mid * 2 + 1) >               (long long)ans * (mid * 2 + 1) -                   a[p] * (len * 2 + 1) * (mid * 2 + 1))             ans = check(i, mid), p = i, len = mid;         } else           r = mid - 1;       }     }     printf( %d n , len * 2 + 1);     for (int i = p - len; i <= p; i++) printf( %d  , pre[i] - pre[i - 1]);     for (int i = n - len + 1; i <= n; i++) printf( %d  , pre[i] - pre[i - 1]);     printf(  n );     return 0;   }   