#include<bits/stdc++.h>
using namespace std;
using ll = long long;

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; }

#define FOR(i,a,b) for(ll i=(a);i<(b);++i)
#define ALL(v) (v).begin(), (v).end()
#define p(s) cout<<(s)<<endl
#define p2(s, t) cout << (s) << " " << (t) << endl
#define br() p("")
#define pn(s) cout << (#s) << " " << (s) << endl
#define p_yes() p("Yes")
#define p_no() p("No")

const ll mod = 1e9 + 7;
const ll inf = 1e18;

template < typename T >
void vprint(T &V){
	for(auto v : V){
    	cout << v << " ";
	}
	cout << endl;
}

struct AccSum{
    vector<ll> Ac;
    ll L;
    AccSum(vector<ll> &A){
        L = A.size();
        Ac.resize(L+1);
        FOR(i, 0, L){
            Ac[i+1] = Ac[i] + A[i];
        }
    }
 
    // sum of [a, b]
    ll sum(ll a, ll b){
        if(a<0){
            p("error");
            return -1;
        } 
        if(b>L-1){
            p("error");
            return -1;
        }
        ll ans = Ac[b+1] - Ac[a];
        if(ans < 0){
            p("error");
        }
        return ans % mod;
    }
};

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);

    // input
    ll N;
    cin >> N;

    vector<ll> A(N+1);
    FOR(i, 0, N+1){
        cin >> A.at(i);
    }

    vector<ll> B(N+1);
    FOR(i, 0, N+1){
        cin >> B.at(i);
    }

    auto Acc = AccSum(B);

    ll sum = 0;
    FOR(i, 0, N+1){
        sum += (A[i] * (Acc.sum(0, N-i) % mod)) % mod;
        sum %= mod;
    }

    p(sum);

    return 0;
}