#include <bits/stdc++.h>
using namespace std;
long long zero = 0;
long long one = 1;
long long gcd(long long a, long long b) {
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long lcm(long long a, long long b) { return (a / gcd(a, b) * b); }
long long expo(long long x, long long y) {
  long long res = 1;
  x = x % 1000000007;
  while (y > 0) {
    if (y & 1) res = (1ll * res * x) % 1000000007;
    y = y >> 1;
    x = (1ll * x * x) % 1000000007;
  }
  return res;
}
long long expo1(long long x, long long y) {
  long long res = 1;
  x = x % 998244353;
  while (y > 0) {
    if (y & 1) res = (1ll * res * x) % 998244353;
    y = y >> 1;
    x = (1ll * x * x) % 998244353;
  }
  return res;
}
long long ncr(long long n, long long r) {
  long long res = 1;
  if (r > n - r) r = n - r;
  for (long long i = 0; i < r; i++) {
    res *= n - i;
    res /= i + 1;
  }
  return res;
}
long long max(long long a, long long b) { return (a > b) ? a : b; }
bool prime(long long n) {
  long long i;
  for (i = 2; i <= sqrt(n); i++) {
    if (n % i == 0) return false;
  }
  return true;
}
bool sortbysec(const pair<long long, long long> &a,
               const pair<long long, long long> &b) {
  return (a.second < b.second);
}
signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  ;
  long long n;
  cin >> n;
  long long a[n];
  for (long long i = 0; i < (long long)n; i++) {
    cin >> a[i];
    if (a[i] >= 0) a[i] = -a[i] - 1;
  }
  if (n % 2) {
    long long m = 0, in = -1;
    for (long long i = 0; i < (long long)n; i++)
      if (m < (-a[i])) m = (-a[i]), in = i;
    a[in] = -a[in] - 1;
  }
  for (long long i = 0; i < (long long)n; i++) cout << a[i] << " ";
  return 0;
}
