// compile: make data
// run: ./data < data.in
#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
#ifdef LOCAL
#include <debug/codeforces.h>
#define debug(x...) _debug_print(#x, x);
#else
#define debug(x...) {};
#endif
template<typename...Args> void print_(Args...args){((cout<<args<<" "),...)<<endl;}
#define rep(i,a,b) for(int i=(a);i<(int)(b);++i)
#define sz(v) ((int)(v).size())
#define print(...) print_(__VA_ARGS__);
#define INTMAX (int)(9223372036854775807)
#define INF (int)(1152921504606846976)
#define int long long
#define double long double
#define MAXN 200010

void solve() {
    int n; cin >> n;
    int sq = sqrt(2*n) + 10;
    vector<int> a(n), b(n);
    rep(i, 0, n) cin >> a[i];
    rep(i, 0, n) cin >> b[i];
    vector<vector<int32_t>> cnt(sq, vector<int32_t>(n+1, 0));
    rep(i, 0, n) if (a[i] < sq) ++cnt[a[i]][b[i]];
    long long ans = 0;
    rep(i, 0, n) {
        if (a[i] > sq) continue;
        int d = a[i]*a[i] - b[i];
        if (d < 1 || d > n) continue;
        if (b[i] == d) ans += cnt[a[i]][d] - 1;
        else ans += cnt[a[i]][d];
    }
    ans /= 2;
    rep(i, 0, n) {
        // a[i]: a[i]
        // aj: a[j] < n / a[i]
        // b[i]: b[i]
        // b[j]: a[i]*a[j] - b[i]
        rep(aj, 1, sq) {
            if (a[i] == aj) continue;
            int bj = a[i]*aj - b[i];
            if (bj < 1 || bj > n) continue;
            if (a[i] > aj) ans += cnt[aj][bj];
        }
    }
    cout << ans << endl;
}

int32_t main() {
    ios::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr);

    int _; cin >> _;
    while (_--) solve();

    return 0;
}