#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define F first
#define S second
#define pii pair<int, int>
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define rep(i, n) for (int i = 0; i < n; ++i)
#define rep3(i, l, n) for (int i = l; i < n; ++i)
#define chmax(a, b) a = max(a, b)
#define chmin(a, b) a = min(a, b)
#define out(a) cout << a << endl
#define SZ(v) (int)v.size()
#define inf (int)(1e9+7)

const ll mod = (ll)(1e9+7);

int main() {
    int n; cin >> n;
    int a[n + 1]; rep(i, n + 1) cin >> a[i];
    int b[n + 1]; rep(i, n + 1) cin >> b[i];
    int bb[n + 2]; fill_n(bb, n + 2, 0); rep(i, n + 1) { bb[i + 1] = bb[i] + b[i]; bb[i + 1] %= mod; }
    
    ll ans = 0;
    rep(i, n + 1) {
        ll tmp = a[i];
        
        (tmp *= (ll)bb[n - i + 1]) %= mod;
        (ans += tmp) %= mod;
    }
    out(ans);
}