#include <bits/stdc++.h>
using namespace std;
double a[100050];
int n, b[100050];
long long sum;
int main() {
  scanf("%d", &n);
  for (int i = 1; i <= n; i++) scanf("%lf", &a[i]);
  for (int i = 1; i <= n; i++) b[i] = ceil(a[i]), sum += b[i];
  for (int i = 1; i <= n; i++)
    if (sum && (ceil(a[i]) != floor(a[i]))) b[i]--, sum--;
  for (int i = 1; i <= n; i++) printf("%d\n", b[i]);
}
