#include <bits/stdc++.h>
using namespace std;
vector<long long> u(100001);
vector<long long> v(100001);
bool comp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first * abs(v[b.second]) < b.first * abs(v[a.second]))
    return true;
  else if (a.first * abs(v[b.second]) == b.first * abs(v[a.second])) {
    if (a.second < b.second)
      return true;
    else
      return false;
  } else
    return false;
}
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  long long n;
  cin >> n;
  vector<long long> a(n);
  for (long long i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (long long i = 0; i < n; i++) {
    if (a[i] > 0) {
      u[i] = a[i];
      v[i] = (-1) * (a[i] + 1);
    } else if (a[i] < 0) {
      u[i] = (-1) * a[i] - 1;
      v[i] = a[i];
    } else {
      u[i] = a[i];
      v[i] = -1;
    }
  }
  if (n % 2 == 0) {
    for (long long i = 0; i < n; i++) cout << v[i] << " ";
    return 0;
  }
  vector<pair<long long, long long> > arr(n);
  for (long long i = 0; i < n; i++) {
    arr[i].first = u[i];
    arr[i].second = i;
  }
  sort(arr.begin(), arr.end(), comp);
  long long id = arr[n - 1].second;
  for (long long i = 0; i < n; i++) {
    if (i == id)
      cout << u[i] << " ";
    else
      cout << v[i] << " ";
  }
  return 0;
}
