/**
* author : Lăng Trọng Đạt
* created: 2023-09-02
**/
#include <bits/stdc++.h>
using namespace std;
#ifndef LANG_DAT
#define db(...) ;
#endif // LANG_DAT
#define int int64_t
#define mp make_pair
#define f first
#define s second
#define pb push_back
#define all(v) (v).begin(), (v).end()
using pii = pair<int, int>;
const int INF = 2e9;
const double eps = 1e-5;
const int MAXN = 2e5 + 5;
int x[MAXN], r[MAXN], id[MAXN]; // f[i]: final radius of balloon i
double f[MAXN];
int n;
inline double dist(int ngang, int doc) {
return sqrt((double)ngang*ngang + doc*doc);
}
bool vaild(double radius, int pos, int adj) {
double d = dist(abs(pos - x[adj]), abs(radius - f[adj]));
db(f[adj], radius, d, pos, x[adj])
return f[adj] + radius <= d;
}
bool check(double radius, int pos, int i) {
bool res = true;
for (int j = i - 1; j > 0 && res; j--)
res &= vaild(radius, pos, j);
for (int j = i + 1; j <= n && res; j++)
res &= vaild(radius, pos, j);
return res;
}
int32_t main() {
cin.tie(0)->sync_with_stdio(0);
if (fopen("hi.inp", "r")) {
freopen("hi.inp", "r", stdin);
// freopen("hi.out", "w", stdout);
}
std::cin >> n;
for (int i = 1; i <= n; i++) {
id[i] = i;
std::cin >> x[i] >> r[i];
}
sort(id + 1, id + n + 1, [](int& a, int& b) -> bool {return r[a] < r[b];});
x[0] = -INF;
x[n + 1] = INF;
for (int i = 1; i <= n; i++) {
double lo = 0, hi = r[id[i]], res = 0;
while ((hi - lo) > eps) {
double mid = (lo + hi) / 2;
if (check(mid, x[id[i]], id[i])) {
res = mid;
lo = mid + eps;
} else hi = mid - eps;
}
f[id[i]] = res;
db(id[i], res)
}
for (int i = 1; i <= n; i++) {
cout << fixed << setprecision(10) << f[i] << "\n";
}
}
