#include <bits/stdc++.h>
using namespace std;
const long long mod = 1e9 + 7;
const long long mxn = 4e5 + 5;
long long mainx() {
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < n; i++) cin >> a[i];
  if (n == 1) {
    cout << a[0] << endl;
    return 0;
  }
  sort(a, a + n);
  vector<long long> ans, pos, neg;
  for (long long i = 0; i < n; i++) {
    if (a[i] < 0)
      neg.push_back(a[i]);
    else if (a[i] > 0)
      pos.push_back(a[i]);
  }
  sort(neg.begin(), neg.end());
  sort(pos.begin(), pos.end());
  long long len = neg.size();
  if (len % 2) {
    neg.pop_back();
  }
  for (auto& x : neg) {
    pos.push_back(x);
  }
  sort(pos.begin(), pos.end());
  if ((long long)pos.size() == 0) pos.push_back(0);
  for (auto& x : pos) {
    cout << x << " ";
  }
  cout << endl;
  ;
  return 0;
}
void inp();
int32_t main() {
  inp();
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cout << fixed << setprecision(20);
  long long t = 1;
  for (long long i = 0; i < t; i++) {
    mainx();
  }
  return 0;
}
void inp() {}
