#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
double arr[100001];
int res[100001];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  vector<int> ind;
  int n;
  cin >> n;
  long long sum = 0;
  for (int i = 0; i < (n); ++i) {
    cin >> arr[i + 1];
    if (arr[i + 1] != (int)arr[i + 1] && arr[i + 1] < 0)
      res[i + 1] = (int)arr[i + 1] - 1;
    else
      res[i + 1] = (int)arr[i + 1];
    if (arr[i + 1] == res[i + 1]) ind.push_back(i + 1);
    sum += res[i + 1];
  }
  int i = 1;
  int x = 0;
  sum *= -1;
  while (sum != 0) {
    if (x < ind.size() && i == ind[x])
      x++;
    else {
      res[i]++;
      sum--;
    }
    i++;
  }
  for (int i = (1); i < (n + 1); i++) cout << res[i] << endl;
  return 0;
}
