#include <bits/stdc++.h>
using namespace std;
const int N = 1e5 + 9;
long long mod = 998244353;
long long fast_pow(long long b, long long p) {
  if (p == 0) return 1;
  long long m = fast_pow(b, p / 2);
  m = ((m % mod) * (m % mod)) % mod;
  if (p % 2 == 1) m = ((m % mod) * (b % mod)) % mod;
  return m;
}
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n;
  cin >> n;
  pair<int, int> arr[N];
  for (int i = 0; i < n; i++) cin >> arr[i].first, arr[i].second = i;
  sort(arr, arr + n);
  for (int i = 0; i < n; i++) {
    if (arr[i].first >= 0) {
      arr[i].first++;
      arr[i].first *= -1;
    }
  }
  if (n % 2 == 1) {
    int ind = 0, mn = 1e9;
    for (int i = 0; i < n; i++) {
      if (arr[i].first == -1) continue;
      if (mn > arr[i].first) {
        mn = arr[i].first;
        ind = i;
      }
    }
    arr[ind].first++;
    arr[ind].first *= -1;
  }
  int ans[N] = {};
  for (int i = 0; i < n; i++) {
    ans[arr[i].second] = arr[i].first;
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << " ";
  }
  return 0;
}
