#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }



int main() {
  char buf[110];
  int N;
  for (; ~scanf("%d", &N); ) {
    Int upp = 0;
    long double low = 0.0;
    for (int i = 0; i < N; ++i) {
      Int x;
      scanf("%lld", &x);
      if (x > 0) {
        /*
          sqrt(X[i]) - k
          = (X[i] - k^2) / (sqrt(X[i]) + k)
        */
        const long double y = sqrtl((long double)x);
        const Int k = (Int)y;
        upp += k;
        low += (x - k * k) / (y + k);
      }
      sprintf(buf, "%.18Lf", upp + low);
      buf[18] = '\0';
      puts(buf);
    }
  }
  return 0;
}