#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef tuple<int, int, int> tii;

#define eb emplace_back
#define all(s) (s).begin(), (s).end()
#define rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define per(i, a, b) for (int i = (a); i >= (b); --i)

inline int rd() {
    int x = 0;
    bool f = 0;
    char c = getchar();
    for (; !isdigit(c); c = getchar()) f |= (c == '-');
    for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
    return f ? -x : x;
}

const int N = 1000007;

const ll inf = 1000000000000000000ll;

ll c[N], t[N];

inline void work() {
    int n = rd();
    bool fl = false;
    rep(i, 1, n) {
        t[i] = rd(); c[i] = rd();
        if (i > 2 && t[i - 2] == t[i]) fl = true;
    }
    if (fl) {puts("-1"); return;}
    auto check = [&](ll spd) {
        ll L = -inf, R = inf;
        rep(i, 2, n) {
            ll D = spd * (t[i] - t[i - 1]);
            bool fl1 = abs(c[i] - c[i - 1]) <= D;
            bool fl2 = (L - D <= c[i] && c[i] <= R + D);
            if (!fl1 && !fl2) return false;
            if (fl1 && fl2) {L = min(L, c[i - 1]); R = max(R, c[i - 1]);}
            else if (!fl1) L = R = c[i - 1];
            L -= D; L = max(L, -inf);
            R += D; R = min(R, inf);
        }
        return true;
    };
    int L =  0, R = 1000000000;
    while (L < R) {
        int m = (L + R) / 2;
        check(m) ? R = m : L = m + 1;
    }
    printf("%d\n", L);
}

int main() {
    per(t, rd(), 1) work();
    return 0;
}