#include <bits/stdc++.h>
using namespace std;
#define double long double
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(), (x).end()
#define deb(x) cout << #x << "-" << x << endl
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector<int> vii;
typedef pair<int, int> pii;
const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0, 0, -1, 1};
const int dy[] = {-1, 1, 0, 0};
// const double PI = 2 * acos(0.0);
const int N = 2e5 + 5;
double n;
double x[N],mr[N];
double ans[N];
stack <pair<double,double>> st;
inline void test_case() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> x[i] >> mr[i];
ans[i] = mr[i];
}
for (int i = 1; i <= n; i++) {
while (!st.empty()) {
auto [ox,r] = st.top();
double c = (double)(ox-x[i])*(double)(ox-x[i]);
ans[i] = min(ans[i],(double)(c/(double)((double)(4)*r)));
if (ans[i] > r) st.pop(); else break;
}
st.push({x[i],ans[i]});
}
for (int i = 1; i <= n; i++) {
cout << ans[i] << endl;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(0); cout.tie(0);
int T = 1;
// cin >> T;
while (T--) {
test_case();
}
return 0;
}
