#include <bits/stdc++.h>
#define Loop(x,l,r) for (ll x = (l); x < (ll)(r); ++x)
#define LoopR(x,l,r) for (ll x = (r)-1; x >= (ll)(l); --x)
typedef long long ll;
typedef std::pair<int, int> pii;
typedef std::pair<ll , ll > pll;
using namespace std;
typedef pair<double, double> pdd;
pdd in()
{
ll x, y;
cin >> x >> y;
return {x, y};
}
const int N = 200'010;
double a[N], b[N];
int len = 0;
void insert(pdd f)
{
a[len] = f.first;
b[len] = f.second;
++len;
}
__attribute__((optimize("Ofast,unroll-loops"),target("avx2,fma")))
double get(double x, bool side)
{
#define MIN(x, y) ((x)>(y)?(y):(x))
double ans = 1e30;
if (side) {
Loop (i,0,len) {
double tmp = a[i]*x + b[i];
ans = MIN(ans, tmp);
}
} else {
LoopR (i,0,len) {
double tmp = a[i]*x + b[i];
ans = MIN(ans, tmp);
}
}
return ans;
#undef MIN
}
int main()
{
cin.tie(0) -> sync_with_stdio(false);
cout << fixed << setprecision(3);
int n;
cin >> n;
Loop (i,0,n) {
auto [x, r] = in();
r = sqrt(r);
r = min(r, get(x, i&1));
cout << r*r << '\n';
insert({0.5/r, -x*0.5/r});
}
}
