#include <bits/stdc++.h>
#pragma GCC optimize("O3")
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pi;
typedef pair<ll, pair<ll, ll> > pii;
typedef vector <ll> vi;
#define forw(i,a,b) for (ll i=a;i<=(b);i++)
#define forb(i,a,b) for (ll i=a;i>=(b);i--)
#define fast {ios::sync_with_stdio(false); cin.tie(0); }
#define fi first
#define se second
#define pu push
#define puf push_front
#define pb push_back
#define pof pop_front
#define pob pop_back
#define fr front
#define all(a) a.begin(),a.end()
const ll oo=1e18;
const ll mod=1e9+7;
const int base=31;
const int tx[5]={0,-1,0,1,0};
const int ty[5]={0,0,1,0,-1};
const ll maxN=1e5+5;
const ll maxM=1e6+5;
const ll block=700;
long double x,r;
ll n;
void solve()
{
cin>>n;
stack<pair<long double, long double> > p;
forw(i,1,n)
{
cin>>x>>r;
while (p.size())
{
long double x1=p.top().fi;
long double r1=p.top().se;
r=min(r,((x1-x)*(x1-x))/(4*r1));
if (r>=r1) p.pop();
else break;
}
p.pu({x,r});
cout<<fixed<<setprecision(3)<<r<<"\n";
}
}
int main()
{
fast;
//freopen("bongbong.inp","r",stdin);
//freopen("bongbong.out","w",stdout);
solve();
return 0;
}
