#include <bits/stdc++.h>
using namespace std;
const int INF = 1e9 + 5;
const int nax = 2e5 + 2;
const int M = 1e9 + 7;
bool ok(string s) {
  int n = s.length();
  for (int i = 1; i <= n - 1; i++)
    if (s[i] == s[i - 1]) return 0;
  return 1;
}
void solve() {
  int n;
  cin >> n;
  vector<int> a(n), p, ne, z;
  for (int &i : a) {
    cin >> i;
    if (i < 0)
      ne.push_back(i);
    else if (i > 0)
      p.push_back(i);
    else
      z.push_back(i);
  }
  if ((ne.size() & 1) == 0) {
    z.push_back(ne.back());
    ne.pop_back();
  }
  if (p.size() == 0) {
    p.push_back(ne.back());
    ne.pop_back();
    p.push_back(ne.back());
    ne.pop_back();
  }
  cout << ne.size() << " ";
  for (int i : ne) cout << i << " ";
  cout << "\n";
  cout << p.size() << " ";
  for (int i : p) cout << i << " ";
  cout << "\n";
  cout << z.size() << " ";
  for (int i : z) cout << i << " ";
  cout << "\n";
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cerr.tie(0);
  ;
  int tt = 1;
  while (tt--) {
    solve();
  }
  return 0;
}
