#include <iostream>
#include <vector>
#include <algorithm>
#include <map>
#include <queue>
#include <cstdio>
#include <ctime>
#include <assert.h>
#include <chrono>
#include <random>
#include <numeric>
#include <set>
using namespace std;
typedef long long int ll;
typedef unsigned long long ull;

constexpr ll mod=1e9+7;

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n; cin >> n;
    vector<ll> a(n+1),b(n+1);
    for(int i=0;i<n+1;i++){
        cin >> a[i];
    }
    for(int i=0;i<n+1;i++){
        cin >> b[i];
    }
    ll res=0;
    ll sum=0;
    reverse(a.begin(), a.end());
    for(int i=0;i<n+1;i++){
        (sum+=b[i])%=mod;
        (res+=a[i]*sum)%=mod;
    }
    printf("%lld\n",res);
}