#include <bits/stdc++.h>
using namespace std;
const double PI = 2.0 * acos(0.0);
const int MOD = 1e9 + 7;
const int oo = 2 * MOD + 1e3;
long long gcd(long long a, long long b) { return !b ? a : gcd(b, a % b); }
int main() {
  int n, idx = 0;
  cin >> n;
  vector<int> in(n);
  for (long long i = 0; i < n; i++) {
    scanf("%d", &in[i]);
    if (in[i] > -1) in[i] = -in[i] - 1;
    if (in[idx] > in[i]) idx = i;
  }
  if (n & 1) in[idx] = -in[idx] - 1;
  for (long long i = 0; i < n; i++) printf("%d ", in[i]);
  puts("");
  return 0;
}
