#include <bits/stdc++.h>
using namespace std;
long double min(long double a, long double b) {
  if (a < b)
    return a;
  else
    return b;
}
long double max(long double a, long double b) {
  if (a < b)
    return b;
  else
    return a;
}
long double min3(long double a, long double b, long double c) {
  return min(a, min(b, c));
}
long double max3(long double a, long double b, long double c) {
  return max(a, max(b, c));
}
long long ceil1(long double x, long double y) {
  long double q = x / y;
  if ((long long)q == q) return q;
  return q + 1;
}
long long NC = 100;
long long N = 1e9 + 7;
const long long S = 3e5 + 7;
long long mod(long long n);
long long gcd(long long a, long long b);
long long modM(long long n, long long m);
long long modA(long long n, long long m);
long long modS(long long n, long long m);
long long power(long long a, long long b);
void pra(long long a[], long long n);
void ipgraph(long long n, long long m);
vector<vector<long long> > v;
vector<bool> vis;
void solve() {
  long long n;
  cin >> n;
  vector<long double> a(n);
  for (long long i = 0; i < n; i++) cin >> a[i];
  vector<long long> b;
  for (long long i = 0; i < n; i++) {
    if (a[i] < 0 && (long long)a[i] != a[i])
      b.push_back((long long)a[i] - 1);
    else
      b.push_back((long long)a[i]);
  }
  long long sb = accumulate(b.begin(), b.end(), (long long)0);
  long long i = 0;
  while (i < n && sb < 0) {
    long double x = a[i];
    if ((long long)x == x) {
      i++;
      continue;
    }
    b[i]++;
    i++;
    sb++;
  }
  for (auto x : b) cout << x << " ";
  cout << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  cout << setprecision(15);
  long long t = 1;
  while (t--) solve();
  cerr << '\n'
       << "Time : " << 1000 * ((double)clock()) / (double)CLOCKS_PER_SEC
       << "ms\n";
  return 0;
}
void ipgraph(long long n, long long m) {
  v.assign(n, vector<long long>());
  vis.assign(n, 0);
  long long x, y;
  for (long long i = 0; i < m; i++) {
    cin >> x >> y;
    x--, y--;
    v[y].push_back(x);
    v[x].push_back(y);
  }
}
long long gcd(long long a, long long b) {
  if (b > a) return gcd(b, a);
  if (b == 0) return a;
  return gcd(b, a % b);
}
long long power(long long a, long long b) {
  if (b == 0) return 1;
  long long c = power(a, b / 2);
  if (b % 2 == 0)
    return modM(c, c);
  else
    return modM(modM(c, c), a);
}
void pra(long long a[], long long n) {
  for (long long i = 0; i < n; i++) cout << a[i] << " ";
  cout << '\n';
}
long long mod(long long n) { return (n % N + N) % N; }
long long modM(long long n, long long m) { return ((n % N * m % N) + N) % N; }
long long modA(long long n, long long m) { return ((n % N + m % N) + N) % N; }
long long modS(long long n, long long m) { return ((n % N - m % N) + N) % N; }
