#include <bits/stdc++.h>

using i64 = long long;
using u64 = unsigned long long;

typedef std::pair<long long, long long> PII;
const int mod = 998244353;
const int N = 2e6 + 1000;
const int INF = 0x3f3f3f3f;
const long long LINF = 1e18;
const double eps = 1e-12;
const double pi = std::acos(-1);
std::mt19937_64 rnd(std::random_device{}());

void solve() {
    int n;
    std::cin >> n;
    std::vector<PII> a(n);
    for (auto &[t, p] : a) std::cin >> t >> p;

    auto check = [&](i64 v) {
        i64 l = -INF, r = INF;
        i64 pos = 0, last = 0;
        for (auto [t, p] : a) {
            if (!pos) {
                pos = p;
                last = t;
                continue;
            }

            i64 w = (t - last) * v;
            if ((pos - w <= p && p <= pos + w) && (l - w <= p && p <= r + w)) {
                l = std::min(l - w, pos - w);
                r = std::max(r + w, pos + w);
            } else if (pos - w <= p && p <= pos + w) {
                l -= w;
                r += w;
            } else if (l - w <= p && p <= r + w) {
                l = pos - w;
                r = pos + w;
            } else {
                return false;
            }
            pos = p;
            last = t;
        }
        return true;
    };

    i64 l = 0, r = 1e18;
    while (l < r) {
        i64 mid = (l + r) >> 1;
        if (check(mid)) r = mid;
        else l = mid + 1;
    }

    if (r == 1e18) r = -1;
    std::cout << r << "\n";
}

signed main() {
    std::ios::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);

    int tmp = 1;

    std::cin >> tmp;

    while (tmp--)
        solve();

    return 0;
}