#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
const ld pi = acos(0) * 2;
template <typename T>
inline void read(T &x) {
  char c;
  bool nega = 0;
  while ((!isdigit(c = getchar())) && (c != '-'))
    ;
  if (c == '-') {
    nega = 1;
    c = getchar();
  }
  x = c - 48;
  while (isdigit(c = getchar())) x = x * 10 + c - 48;
  if (nega) x = -x;
}
template <typename T>
inline void writep(T x) {
  if (x > 9) writep(x / 10);
  putchar(x % 10 + 48);
}
template <typename T>
inline void write(T x) {
  if (x < 0) {
    putchar('-');
    x = -x;
  }
  writep(x);
}
template <typename T>
inline void writeln(T x) {
  write(x);
  putchar('\n');
}
template <typename CT, typename T>
inline void reset_container(CT &c, int sz, T v) {
  c.resize(sz);
  for (auto &x : c) x = v;
}
int n;
ld a[100001];
int b[100001];
ll sum;
const ld eps = 1e-9;
int main() {
  cin >> n;
  for (int i = (1); i <= (n); i++) cin >> a[i];
  for (int i = (1); i <= (n); i++) {
    b[i] = a[i];
    while (b[i] > a[i] + eps) b[i]--;
    while (b[i] + eps < a[i]) b[i]++;
  }
  for (int i = (1); i <= (n); i++) sum += b[i];
  if (sum)
    for (int i = (1); i <= (n); i++)
      if (abs(a[i] - b[i]) > eps) {
        sum--;
        b[i]--;
        if (sum == 0) break;
      }
  for (int i = (1); i <= (n); i++) writeln(b[i]);
}
