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

#define mod 1000000007

int main() {
    int n; cin >> n;
    vector<long long> a(n+1, 0), b(n+1, 0);
    for (int i = 0; i <= n; ++i) {
        cin >> a[i];
    }
    for (int i = 0; i <= n; ++i) {
        cin >> b[i];
        if (i > 0) {
            b[i] += b[i-1]; b[i] %= mod;
        }
    }
    long long ans = 0;
    for (int i = 0; i <= n; ++i) {
        ans += (a[i] * b[n-i]) % mod;
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}