#include<iostream>
#include<vector>
#include<algorithm>
#include<set>
#include<map>
#include<unordered_map>
#include<queue>
#include<iomanip>
#include<math.h>
#include<bitset>
#include<cassert>
#include<random>
#include<time.h>
using namespace std;
using ll=long long;
using ld=long double;
using P=pair<int,int>;
#define MOD 1000000007LL
#define INF 1000000000LL
#define EPS 1e-10
#define FOR(i,n,m) for(ll i=n;i<(ll)m;i++)
#define REP(i,n) FOR(i,0,n)
#define DUMP(a) REP(d,a.size()){cout<<a[d];if(d!=a.size()-1)cout<<" ";else cout<<endl;}
#define ALL(v) v.begin(),v.end()
#define UNIQUE(v)  sort(ALL(v));v.erase(unique(ALL(v)),v.end());
#define pb push_back

/* --------------------------------------- */

int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll n;
	cin >> n;
	vector<ll> a(n + 1), b(n + 1);
	REP(i,n + 1) cin >> a[i];
	REP(i,n + 1) cin >> b[i];
	vector<ll> acm(n + 1);
	acm[0] = b[0];
	FOR(i, 1, n + 1) {
		acm[i] = acm[i - 1] + b[i];
		acm[i] %= MOD;
	}
	ll ans = 0;
	REP(i,n + 1) {
		ans += a[i] * acm[n - i];
		ans %= MOD;
	}
	cout << ans << endl;
	return 0;
}

/* --------------------------------------- */