#include <bits/stdc++.h>
using namespace std;
#define OPTM ios_base::sync_with_stdio(0); cin.tie(0);
#define INF int(1e9+7)
#define ln '\n'
#define ll long long
#define ull unsigned long long
#define ui unsigned int
#define us unsigned short
#define FOR(i,s,n) for (int i = s; i < n; i++)
#define FORR(i,n,s) for (int i = n; i > s; i--)
#define FORX(u, arr) for (auto u : arr)
#define PB push_back
#define in(v,x) (v.find(x) != v.end())
#define F first
#define S second
#define PII pair<int, int>
#define PLL pair<ll, ll>
#define UM unordered_map
#define US unordered_set
#define PQ priority_queue
#define ALL(v) v.begin(), v.end()
const ll LLINF = 1e18+1;
const int MAXN = 2e5+1;
int n;
double x[MAXN], r[MAXN], a[MAXN];
double susify(int p, int q) {
return ((x[p]-x[q])*(x[p]-x[q]))/(4*a[q]);
}
signed main() {
OPTM;
cin >> n;
FOR(i,0,n) cin >> x[i] >> r[i];
stack<int> st;
a[0] = r[0];
st.push(0);
FOR(i,1,n) {
a[i] = r[i];
if (r[i] < r[i-1]) {
a[i] = min(a[i], susify(i,i-1));
st.push(i);
}
else {
while (!st.empty()) {
int cur = st.top();
a[i] = min(a[i], susify(i,cur));
if (r[cur] > r[i]) break;
st.pop();
}
st.push(i);
}
}
FOR(i,0,n) cout << fixed << setprecision(3) << a[i] << ln;
}
