#include <algorithm>
#include <array>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <numeric>
#include <optional>
#include <queue>
#include <set>
#include <sstream>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

int main() {
    int32_t n;
    cin >> n;
    vector<int64_t> as(n + 1), bs(n + 1);
    for (auto i = 0; i <= n; ++i) {
        cin >> as[i];
    }
    for (auto i = 0; i <= n; ++i) {
        cin >> bs[i];
    }
    const auto MOD = int64_t(1e9) + 7;
    vector<int64_t> acc(n + 1);
    acc[0] = as[0];
    for (auto i = 0; i < n; ++i) {
        acc[i + 1] = (as[i + 1] + acc[i]) % MOD;
    }
    int64_t ans = 0;
    for (auto i = 0; i <= n; ++i) {
        ans = (ans + (bs[i] * acc[n - i]) % MOD) % MOD;
    }
    cout << ans << endl;
    return 0;
}