#include <bits/stdc++.h>

using namespace std;

#define fst(t) std::get<0>(t)
#define snd(t) std::get<1>(t)
#define thd(t) std::get<2>(t)
#define unless(p) if(!(p))
#define until(p) while(!(p))

using ll = long long;
using P = std::tuple<int,int>;

const int dx[8] = {-1, 1, 0, 0, -1, -1, 1, 1}, dy[8] = {0, 0, -1, 1, -1, 1, -1, 1};

constexpr ll MOD = 1e9 + 7;
int N, A[100100], B[100100];

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

    std::cin >> N;

    for(int i=0;i<=N;++i){
        std::cin >> A[i];
    }

    for(int i=1;i<=N;++i){
        A[i] = (A[i] + A[i-1]) % MOD;
    }

    for(int i=0;i<=N;++i){
        std::cin >> B[i];
    }

    ll res = 0;
    for(int i=0;i<=N;++i){
        int j = N - i;
        res = (res + 1ll * A[j] * B[i] % MOD) % MOD;
    }

    std::cout << res << std::endl;
}