`color(#5C73B9ff)(H)color(#6B68C0ff)(o)color(#795DC6ff)(r)color(#8852CDff)(i)color(#9646D4ff)(z)color(#A53BDAff)(o)color(#B330E1ff)(n)`

#include <bits/stdc++.h>
using namespace std;

int main() {
    int n; cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++) cin >> a[i];
    int max, min, trungvi, am, khong, duong;
    max = min = a[0];
    am = khong = duong = 0;

    for (int i = 0; i < n; i++) {
        if (a[i] > max) max = a[i];
        if (a[i] < min) min = a[i];
        if (a[i] == 0) khong++;
        if (a[i] > 0) duong++;
        if (a[i] < 0) am++;
    }
    sort(a.begin(), a.end());

    if (n % 2 != 0) trungvi = a[(n - 1) / 2];
    else trungvi = ((a[(n - 1)/2] < a[(n - 1)/2 + 1]) ? a[(n - 1)/2]:a[(n - 1)/2 + 1]);

    cout << max << " " << min << " " << trungvi << " " << am << " " << khong << " " << duong;
}

#include <bits/stdc++.h>

using namespace std;

int main() {
  freopen("bai3.inp" , "r" , stdin);
  freopen("bai3.out" , "w" , stdout);
  long long n, d = 0, d1 = 0, d2 = 0;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; ++i) cin >> a[i];
  for (long long i = 0; i < n; ++i) {
    if (a[i] > 0) d++;
    if (a[i] == 0) d1++;
    if (a[i] < 0) d2++;
  }
  sort (a . begin(), a . end());
  cout << a[n - 1] << " " << a[0] << " " << (n % 2 == 1 ? a[n / 2] : a[n / 2 - 1] + a[n / 2]) / 2 << " " << d2 << " " << d1 << " " << d;
  return 0;
}