#include<bits/stdc++.h>
using u32 = unsigned;
const int N = 1e5+5;
int n, q, cnt, v[N], a[N], b[N], ra[N], rb[N], pri[N]; u32 f[N], mu[N], A[318][N], B[318][N], c[N], ans[N];
std::vector<std::pair<std::pair<int,u32>,int>> slide[N];
std::vector<std::pair<std::pair<int,int>,int>> query;
#define fi first
#define se second
void add(int x, u32 k) {
	for(; x <= n; x += x&-x) c[x] += k;
}
u32 ask(int x) {
	u32 ans = 0;
	for(; x; x -= x&-x) ans += c[x];
	return ans;
}
signed main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) scanf("%d", &a[i]), ra[a[i]] = i;
	for(int i = 1; i <= n; ++i) scanf("%d", &b[i]), rb[b[i]] = i;
	mu[1] = 1;
	for(int i = 2; i <= n; ++i) {
		if(!v[i]) pri[++cnt] = i, mu[i] = -1;
		for(int j = 1; j <= cnt && i * pri[j] <= n; ++j) {
			v[i * pri[j]] = 1;
			if(i % pri[j]) mu[i * pri[j]] = -mu[i];
			else break;
		}
	}
	
	for(int d = 1; d <= n; ++d)
		for(int x = d, i = 1; x <= n; x += d, ++i)
			f[x] += mu[d] * (u32)i * i;
	int blk = (int)sqrt(n);
	for(int i = 1; i <= blk; ++i)
		for(int j = 1; j <= n; ++j) {
			A[i][j] = A[i][j - 1] + (a[j] % i == 0);
			B[i][j] = B[i][j - 1] + (b[j] % i == 0);
		}
	for(int x = blk + 1; x <= n; ++x)
		for(int i = x; i <= n; i += x)
			slide[ra[i]].push_back({{rb[i], f[x]}, 0});
	scanf("%d", &q);
	for(int i = 1; i <= q; ++i) {
		int l, r, L, R;
		scanf("%d%d%d%d", &l, &r, &L, &R);
		for(int d = 1; d <= blk; ++d) {
			ans[i] += f[d] * A[d][l - 1] * B[d][L - 1];
			ans[i] -= f[d] * A[d][l - 1] * B[d][R];
			ans[i] -= f[d] * A[d][r] * B[d][L - 1];
			ans[i] += f[d] * A[d][r] * B[d][R];
		}
		query.push_back({{l - 1, L - 1}, 0});
		query.push_back({{l - 1, R}, 0});
		query.push_back({{r, L - 1}, 0});
		query.push_back({{r, R}, 0});
	}
	for(int i = 0; i < (int)query.size(); ++i) 
		if(query[i].fi.fi)
			slide[query[i].fi.fi].push_back({{query[i].fi.se, 0}, i});
	for(int i = 1; i <= n; ++i) {
		for(auto j: slide[i]) if(!j.se) add(j.fi.fi, j.fi.se);
		for(auto j: slide[i]) if(j.se) query[j.se].se = ask(j.fi.fi);
	}
	for(int i = 0; i < (int)query.size(); i += 4) {
		ans[i / 4 + 1] += query[i].se - query[i + 1].se - query[i + 2].se + query[i + 3].se;
	}
	for(int i = 1; i <= q; ++i) printf("%d\n", ans[i]);
	return 0;
}