#include <bits/stdc++.h>
using namespace std;
const int MOD(1000000007);
const int INF((1 << 30) - 1);
const int MAXN();
int main() {
  int n;
  scanf("%d", &n);
  bool zero = 0;
  vector<int> a, b;
  for (int i = 0; i < n; i++) {
    int x;
    scanf("%d", &x);
    if (x > 0)
      a.push_back(x);
    else if (x < 0)
      b.push_back(x);
    else
      zero = 1;
  }
  sort(a.begin(), a.end(), greater<int>());
  sort(b.begin(), b.end());
  if (a.size() > 0) {
    for (int i = 0; i < a.size(); i++) printf("%d ", a[i]);
    int c = b.size() & 1;
    for (int i = 0; i < b.size() - c; i++) printf("%d ", b[i]);
  } else {
    if (b.size() == 0) {
      printf("0");
    } else if (b.size() == 1) {
      if (zero) {
        printf("0");
      } else {
        printf("%d", b[0]);
      }
    } else {
      int c = b.size() & 1;
      for (int i = 0; i < b.size() - c; i++) printf("%d ", b[i]);
    }
  }
}
