#include <iostream>
using namespace std;
const int mod=1000000007;
int n,x,l,r;
long long ans,q1[500005],q2[500005],q3[500005],q4[500005],q5[500005];
int main(void){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&x);
		q1[i]=q1[i-1]+x;
		q3[i]=(q3[i-1]+q1[i]%mod)%mod;
	}
	for(int i=1;i<=n;i++){
		scanf("%d",&x);
		q2[i]=q2[i-1]+x;
		q4[i]=(q4[i-1]+q2[i]%mod)%mod;
		q5[i]=(q5[i-1]+(q1[i]%mod)*(q2[i]%mod)%mod)%mod;
	}
	ans=((n+1)*q5[n]-q3[n]*q4[n]+mod)%mod;
    printf("%lld",ans);
}