/*****from dust I have come, dust I will be*****/
#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
#define int long long
#define double long double
#define forn(i,n) for(int i=0;i<n;i++)
int dx[8] = { 1, 0, -1, 0, -1, 1, -1, 1 };
int dy[8] = { 0, 1, 0, -1, -1, 1, 1, -1 };
int ceil_div(int a, int b) {return a % b == 0 ? a / b : a / b + 1;}
const int MOD = 1000000007;
//const int MOD = 998244353;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> pbds; // find_by_order, order_of_key
/*
int k = A.order_of_key(p[i].second);
A.erase(A.find_by_order(k));
erase element from pbds multiset
*/
double r(double x1, double r1, double x2) {
x1 = x1 - x2;
x1 = x1 * x1;
x1 = x1 / (4.0 * r1);
return x1;
}
void solve(){
int n; cin >> n;
vector<pair<double, double>>a(n);
for (auto &t : a) cin >> t.first>>t.second;
vector<double>ans;
ans.push_back(a[0].second);
stack<pair<double, double>>stek;
stek.push({a[0].first, a[0].second});
for (int i=1;i<n;i++){
double mn = a[i].second;
while (!stek.empty()){
auto t = stek.top();
mn = min(mn, r(t.first, t.second, a[i].first));
if (t.first + t.second < mn + a[i].first) stek.pop();
else break;
}
ans.push_back(mn);
stek.push({a[i].first, mn});
}
for (auto t : ans){
cout << fixed <<setprecision(3);
cout <<t<<'\n';
}
}
int32_t main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
int t = 1; //cin >>t;
for (int i=1;i<=t;i++){
solve();
}
return 0;
}
