#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <utility>
#define FAST_IO ios::sync_with_stdio(false);cin.tie(0);
#define pb push_back
#define all(x) begin(x), end(x)
#define space " "
#define TEST_CASES int a; cin >> a; for (int i = 0; i < a; i++) {solve(); cout << endl;}
using namespace std;
using namespace __gnu_pbds;
typedef long long ll;
typedef long double ld;
template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
mt19937 rng((uint32_t)chrono::steady_clock::now().time_since_epoch().count());
void solve() {
int n; cin >> n;
vector<pair<ld, ld>> vec(n);
for (int i = 0; i < n; i++) {
cin >> vec[i].first >> vec[i].second;
for (int j = i - 1; j >= 0; j--) {
vec[i].second = min(vec[i].second, (vec[i].first - vec[j].first) * (vec[i].first - vec[j].first) / 4 / vec[j].second);
}
cout << vec[i].second << endl;
}
}
int main() {
FAST_IO;
//freopen("snowboots.in", "r", stdin);
//freopen("snowboots.out", "w", stdout);
//TEST_CASES;
solve(); cout << endl;
/*int a; cin >> a;
for (int i = 1; i <= a; i++){
cout << "Case #" << i << ": ";
solve();
cout << endl;
}*/
}
