#include <iostream>
#include <vector>
#include <string>
#include <cstring>
#include <math.h>
#include <cmath>
#include <limits.h>
#include <map>
#include <unordered_map>
#include <set>
#include <queue>
#include <algorithm>
#include <functional>
#include <stdio.h>
using namespace std;

long long MOD = 1000000007;

int main() {

    int N;
    cin >> N;
    N;
    vector<long long> A(N+1);
    vector<long long> 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];
    }

    vector<long long> BS(N+2);
    BS[0] = 0;
    for ( int i = 1; i <= N+1; i++ ) {
        BS[i] = BS[i-1] + B[i-1];
        BS[i] %= MOD;
    }

    long long ans = 0;
    for ( int i = 0; i < N+1; i++ ) {
        ans += A[i] * BS[ N-i+1 ];
        ans %= MOD;
    }

    cout << ans << endl;

    return 0;

}