#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
}
int main() {
  fast();
  long long int n;
  cin >> n;
  long long int a[n];
  long long int neg = 0, pos = 0;
  for (long long int i = 0; i < n; i++) {
    cin >> a[i];
    if (a[i] < 0) neg++;
  }
  vector<long long int> negative, positive, zero;
  sort(a, a + n);
  long long int i = 0;
  if (neg % 2 == 1) {
    negative.push_back(a[i]);
    i++;
    while (i < n) {
      if (a[i] < 0) {
        positive.push_back(a[i]);
        i++;
      } else
        break;
    }
    while (i < n) {
      if (a[i] == 0) {
        zero.push_back(a[i]);
        i++;
      } else
        break;
    }
    while (i < n) {
      positive.push_back(a[i]);
      i++;
    }
  } else {
    i = 0;
    negative.push_back(a[i]);
    i++;
    zero.push_back(a[i]);
    i++;
    for (i; i < neg; i++) {
      if (a[i] < 0) positive.push_back(a[i]);
    }
    while (i < n) {
      if (a[i] == 0)
        zero.push_back(a[i]);
      else
        break;
      i++;
    }
    while (i < n) {
      positive.push_back(a[i]);
      i++;
    }
  }
  cout << negative.size() << " ";
  for (auto i : negative) cout << i << " ";
  cout << "\n";
  cout << positive.size() << " ";
  for (auto i : positive) cout << i << " ";
  cout << "\n";
  cout << zero.size() << " ";
  for (auto i : zero) cout << i << " ";
  cout << "\n";
}
