#include <bits/stdc++.h>
using namespace std;
int main() {
  long n;
  cin >> n;
  float f;
  bool vis[n + 5];
  memset(vis, 0, sizeof(vis));
  vector<long> up(n + 5), down(n + 5);
  for (int i = 0; i < n; i++) {
    cin >> f;
    up[i] = ceil(f);
    down[i] = floor(f);
  }
  int sum = 0;
  for (int i = 0; i < n; i++) {
    sum += down[i];
  }
  int i = 0;
  while (sum != 0 && i < n) {
    if (up[i] == down[i]) {
      i++;
      continue;
    }
    sum += 1;
    vis[i] = 1;
    i++;
  }
  int p = 0;
  for (int i = 0; i < n; i++) {
    if (vis[i]) {
      cout << up[i] << '\n';
    } else {
      cout << down[i] << '\n';
    }
  }
  return 0;
}
