#include <bits/stdc++.h>
using namespace std;
int main() {
  int n;
  cin >> n;
  int ar[n];
  vector<pair<int, int> > alfa;
  for (int t = 0; t < n; t++) {
    cin >> ar[t];
    if (ar[t] >= 0) ar[t] = -1 * ar[t] - 1;
    alfa.push_back(pair<int, int>(ar[t], t));
  }
  if (n % 2 == 1) {
    sort(alfa.begin(), alfa.end());
    for (int t = 0; t < n; t++) {
      if (alfa[t].first != -1 || t == (n - 1)) {
        ar[alfa[t].second] = -ar[alfa[t].second] - 1;
      }
      if (alfa[t].first != -1) break;
    }
  }
  for (int t = 0; t < n; t++) {
    cout << ar[t] << " ";
  }
  return 0;
}
