#include<bits/stdc++.h>
using namespace std;
typedef unsigned int ll;
const int N=1e5+5;
int mu[N],a[N],b[N],n,B;
ll f[N],ans[N];
int l1[N],r1[N],l2[N],r2[N],m;
bool pd[N];
vector<int> d[N];
int s1[N],s2[N];
struct node{
	int x;ll v;
};
struct node2{
	int x,y,idx,op;
};
vector<node2> qr[N];
vector<node> vet[N];
vector<int> ad[N],bd[N];
int mp[N],l[N],r[N];
ll sum[N],val[N];
int main(){
	cin>>n;
	for(int i=1;i<=n;++i)
		scanf("%d",&a[i]);
	for(int i=1;i<=n;++i)
		scanf("%d",&b[i]);
	mu[1]=1;
	for(int i=2;i<=n;++i)if(!pd[i]){
		mu[i]=-1;
		for(int j=i+i;j<=n;j+=i)
			mu[j]=-mu[j/i],pd[j]=1;
	}
	for(int i=1;i<=n;++i)
		for(int j=i;j<=n;j+=i)
			d[j].push_back(i);
	for(int i=1;i<=n;++i)
		for(int x:d[a[i]])
			ad[x].push_back(i);
	for(int i=1;i<=n;++i)
		for(int x:d[b[i]])
			bd[x].push_back(i);
	for(int i=1;i<=n;++i)
		for(int j=1;j*i<=n;++j)
			f[i*j]+=(ll)mu[i]*j*j;
	cin>>m;
	for(int i=1;i<=m;++i)
		scanf("%d%d%d%d",&l1[i],&r1[i],&l2[i],&r2[i]);
	B=sqrt(n);
	for(int x=1;x<=B;++x){
		for(int i=1;i<=n;++i)
			s1[i]=s1[i-1]+(a[i]%x==0);
		for(int i=1;i<=n;++i)
			s2[i]=s2[i-1]+(b[i]%x==0);
		for(int i=1;i<=m;++i)
			ans[i]+=f[x]*(s1[r1[i]]-s1[l1[i]-1])*(s2[r2[i]]-s2[l2[i]-1]);
	}
	for(int x=B+1;x<=n;++x)
		for(int i:ad[x])
			for(int j:bd[x])
				vet[i].push_back({j,f[x]});

	for(int i=1;i<=n;++i){
		mp[i]=i/B;
		if(!l[mp[i]])
			l[mp[i]]=i;
		r[mp[i]]=i;
	}
	for(int i=1;i<=m;++i){
		qr[r1[i]].push_back({l2[i],r2[i],i,1});
		qr[l1[i]-1].push_back({l2[i],r2[i],i,-1});
	}
	for(int i=1;i<=n;++i){
		for(auto [x,v]:vet[i]){
			val[x]+=v;
			sum[mp[x]]+=v;
		}
		for(auto [x,y,id,op]:qr[i]){
			int bx=mp[x],by=mp[y];
			if(bx==by){
				for(int i=x;i<=y;++i)
					ans[id]+=op*val[i];
			}
			else{
				for(int i=x;i<=r[bx];++i)
					ans[id]+=op*val[i];
				for(int i=bx+1;i<by;++i)
					ans[id]+=op*sum[i];
				for(int i=l[by];i<=y;++i)
					ans[id]+=op*val[i];
			}
		}
	}
	for(int i=1;i<=m;++i)
		printf("%u\n",ans[i]);
}