#include <bits/stdc++.h>
using namespace std;
const long long N = 1e3 + 5, INF = 1e9 + 7;
int n;
int a[N];
int k = 1;
vector<int> ans;
vector<int> b;
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cin >> n;
  for (int i = 1; i <= n; ++i) {
    cin >> a[i];
    if (a[i] > 0) ans.push_back(a[i]);
    if (a[i] < 0) b.push_back(a[i]);
  }
  if (n == 1) return cout << a[1], 0;
  if (ans.size() == 0 && b.size() == 0) return cout << 0, 0;
  sort(b.begin(), b.end());
  if (n == 2 && (a[1] == 0 && a[2] <= 0 || a[1] <= 0 && a[2] == 0))
    return cout << 0, 0;
  for (int i = 0; i < ans.size(); ++i) {
    cout << ans[i] << " ";
  }
  for (int i = 0; i < (b.size() % 2 == 0 ? b.size() : b.size() - 1); ++i) {
    cout << b[i] << " ";
  }
}
