#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define sz(x) (int) x.size()
#define endl '\n'
#define pb push_back
#define _ ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL);
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ii = pair<int,int>;
using iii = tuple<int,int,int>;
const int inf = 2e9+1;
const int mod = 1e9+7;
const int maxn = 2e5+100;
template<typename X, typename Y> bool ckmin(X& x, const Y& y) { return (y < x) ? (x=y,1):0; }
template<typename X, typename Y> bool ckmax(X& x, const Y& y) { return (x < y) ? (x=y,1):0; }
double v[maxn], r[maxn], ans[maxn];
double dist(int i,int j){
return (v[i]-v[j])*(v[i]-v[j]);
}
int main(){_
//freopen("in.in", "r", stdin);
//freopen("out.out", "w", stdout);
int n;cin>>n;
for(int i=1;i<=n;++i){
cin>>v[i]>>r[i];
}
stack<pair<double,double>>st;
for(int i=1;i<=n;++i){
double cur = r[i];
while(!st.empty()&&dist(i,st.top().second)/(4*st.top().first)<=r[i]){
ckmin(cur,dist(i,st.top().second)/(4*st.top().first));
st.pop();
}
ans[i] = cur;
st.push({ans[i],i});
}
for(int i=1;i<=n;++i)cout<<fixed<<setprecision(3)<<ans[i]<<endl;
}
