#include <bits/stdc++.h>
using namespace std;
void fast() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
bool cmp(long long x, long long y) {
  if (x >= y) return 1;
  return 0;
}
long long a[1000];
int32_t main() {
  fast();
  long long n;
  cin >> n;
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long kp = 0, km = 0, k0 = 0;
  for (long long i = 0; i < n; i++) {
    if (a[i] > 0) {
      kp++;
      cout << a[i] << " ";
    } else if (a[i] == 0)
      k0++;
    else
      km++;
  }
  if (kp == 0 && k0 == 0 && km == 1) {
    cout << a[0];
    return 0;
  }
  if (kp == 0 && k0 > 0 && km < 2) {
    cout << 0 << endl;
    return 0;
  }
  km -= (km % 2);
  sort(a, a + n);
  for (long long i = 0; i < n; i++) {
    if (!km) break;
    if (a[i] < 0) {
      cout << a[i] << " ";
      km--;
    }
  }
}
