#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n;cin >> n;
    vector<ll> a(n+1),b(n+1),sa(n+2),sb(n+2);
    REP(i,n+1){
        cin >> a[i];
        sa[i+1]=(sa[i]+a[i])%mod;
    }
    REP(i,n+1){
        cin >> b[i];
        sb[i+1]=(sb[i]+b[i])%mod;
    }
    ll ans=0;
    REP(i,n+1){
        (ans+=a[i]*sb[n+1-i]%mod)%=mod;
    }
    cout << ans << endl;
}