#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <queue>
#include <deque>
#include <map>
#include <set>
#include <cmath>
#include <iomanip>
#define rep(i, n) for(int i = 0; i < (int)(n); ++i)
using namespace std;

int main(void) {
    constexpr int mod = 1000000007;
    
    int n;
    cin >> n;
    vector<int> a(n + 1), b(n + 1);
    rep(i, n + 1) cin >> a[i];
    rep(i, n + 1) cin >> b[i];
    
    vector<int> s(n + 2, 0);
    rep(i, n + 1) s[i + 1] = (s[i] + b[i]) % mod;
    int ans = 0;
    rep(i, n + 1) {
        ans += (long long)a[i] * s[n - i + 1] % mod;
        ans %= mod;
    }
    cout << ans << endl;
    return 0;
}