#include <bits/stdc++.h>
using namespace std;
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
template<class T> using oset =
tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#define int long long
#define ld long double
#define ar array
#define vi vector<int>
#define vii vector<vector<int>>
#define pii pair<int, int>
#define pb push_back
#define all(x) x.begin(), x.end()
#define f first
#define s second
#define endl "\n"
const int MOD = 1e9+7;
const int inf = 1e9;
const int linf = 1e18;
const int d4i[4]={-1, 0, 1, 0}, d4j[4]={0, 1, 0, -1};
const int d8i[8]={-1, -1, 0, 1, 1, 1, 0, -1}, d8j[8]={0, 1, 1, 1, 0, -1, -1, -1};
// -------------------------------------------------- Main Code --------------------------------------------------
double get_r(int x1, int x2, double r1) {
return ((x2-x1)*(x2-x1))/(4*r1);
}
void sol() {
int n; cin >> n;
int x[n], r[n];
for (int i = 0; i < n; i++) cin >> x[i] >> r[i];
stack<pair<int, double>> st; // idx, radius
vector<double> ans(n);
for (int i = 0; i < n; i++) {
double max_r = r[i];
while (!st.empty()) {
auto last = st.top();
double new_r = get_r(last.f, x[i], last.s);
max_r = min(max_r, new_r);
if (max_r > last.s) st.pop();
else break;
}
ans[i] = max_r;
st.push({x[i], max_r});
}
for (auto i : ans) cout << fixed << setprecision(5) << i << endl;
}
signed main () {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int t = 1;
// cin >> t;
while (t--) {
sol();
}
return 0;
}
