#include<bits/stdc++.h>
#define uint unsigned int
using namespace std;
typedef long long ll;
const int N=1e5+5;
int n,B,a[N],b[N];
uint pa[N][333],pb[N][333];
int posa[N],posb[N];
uint f[N],mu[N];
bool vis[N];
int p[N],cnt,m;
unordered_map<int,uint> t[N];
void pre(){
	mu[1]=1;
	for(int i=2;i<N;i++){
		if(!vis[i])p[++cnt]=i,mu[i]=-1;
		for(int j=1;j<=cnt&&p[j]*i<N;j++){
			vis[p[j]*i]=true;
			if(i%p[j]==0)break;
			mu[p[j]*i]=-mu[i];
		} 
	}
}
void insert(int x,int y,uint z){
	for(int i=x;i<=n;i+=(i&(-i)))
	for(int j=y;j<=n;j+=(j&(-j)))
	t[i][j]+=z;
}
uint sum(int x,int y){
	uint ss=0;
	for(int i=x;i;i-=(i&(-i)))
	for(int j=y;j;j-=(j&(-j)))
	ss+=t[i][j];return ss;
}
uint solve(int l,int r){
	if(!l||!r)return 0;
	uint ss=0;
	for(int i=1;i<=B;i++)
	ss+=pa[l][i]*pb[r][i]*f[i];
	ss+=sum(l,r);
	return ss;
}
int main(){
	scanf("%d",&n);B=pow(n,0.6667);pre();
	for(int i=1;i<=n;i++)scanf("%d",&a[i]),posa[a[i]]=i;
	for(int i=1;i<=n;i++)scanf("%d",&b[i]),posb[b[i]]=i;
	for(int i=1;i<=B;i++)
	for(int j=1;j<=n;j++){
		pa[j][i]=pa[j-1][i]+(a[j]%i==0);
		pb[j][i]=pb[j-1][i]+(b[j]%i==0);
	} 
	for(uint i=1;i<=n;i++)
	for(uint j=i;j<=n;j+=i)
	f[j]+=i*i*mu[j/i];
	for(int i=B+1;i<=n;i++)
	for(int j=i;j<=n;j+=i)
	for(int z=i;z<=n;z+=i)insert(posa[j],posb[z],f[i]);
	scanf("%u",&m);
	while(m--){
		uint l,r,L,R;
		scanf("%u%u%u%u",&l,&r,&L,&R);
		printf("%u\n",(solve(r,R)-solve(l-1,R)-solve(r,L-1)+solve(l-1,L-1)+(1ll<<32)));
	}
	return 0;
}