#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <unordered_map>
#include <unordered_set>
#include <random>
using namespace std;
typedef long long int ll;
typedef pair<ll, ll> P;
const ll MOD=1e9+7;
int main()
{
	int n;
	cin>>n;
	ll sa[100002];
	sa[0]=0;
	for(int i=1; i<=n+1; i++){
		ll ai; cin>>ai;
		sa[i]=(sa[i-1]+ai)%MOD;
	}
	ll ans=0;
	for(int i=0; i<=n; i++){
		ll b; cin>>b;
		ans=(ans+b*sa[n+1-i])%MOD;
	}
	cout<<ans<<endl;
	return 0;
}