#include "bits/stdc++.h"
using namespace std;
#define all(x) x.begin(), x.end()
#define pb push_back
#define sz(x) (int)(x.size())
#define ll long long
#define fi first
#define se second
#define lbd lower_bound
#define ubd upper_bound
const int MOD = 1e9 + 7;
const double eps = 1e-10;
const long long INF = 1e18;
const int N = 2e5 + 10;
void solve() {
int n;
cin >> n;
vector<int> x(n), r(n);
for (int i = 0; i < n; i++) cin >> x[i] >> r[i];
vector<pair<int, double>> s;
for (int i = 0; i < n; i++) {
ll tmp;
while (sz(s) >= 2) {
tmp = 1LL * (x[i] - s.back().fi) * (x[i] - s.back().fi);
double r1 = (tmp * 4 * s[sz(s) - 2].se);
tmp = 1LL * (x[i] - s[sz(s) - 2].fi) * (x[i] - s[sz(s) - 2].fi);
double r2 = (tmp * 4 * s.back().se);
if (r1 >= r2) s.pop_back();
else break;
}
if (!s.empty())
tmp = 1LL * (x[i] - s.back().fi) * (x[i] - s.back().fi);
double ans;
if (s.empty()) ans = r[i];
else ans = min(1.0 * r[i], tmp / (4 * s.back().se));
cout << fixed << setprecision(10) << ans << '\n';
s.pb({x[i], ans});
}
}
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int tt = 1;
//cin >> tt;
while (tt--) {
solve();
}
return 0;
}
