#include <bits/stdc++.h>

using namespace std;

#define REP(i,n) for(int i=0; i<(int)(n); i++)
#define FOR(i,b,e) for (int i=(int)(b); i<(int)(e); i++)
#define ALL(x) (x).begin(), (x).end()

const double PI = acos(-1);
const long long MOD = 1e9 + 7;

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);

  int n;
  cin >> n;

  vector<long long> a(n+1), b(n+1), pref(n+1);
  REP (i, n+1) cin >> a[i];
  REP (i, n+1) cin >> b[i];  

  REP (i, n+1) {
    pref[i] = a[i];
    if (i)
      pref[i] = (pref[i] + pref[i-1]) % MOD;
  }
    
  long long ret = 0;
  for (int i = 0; i <= n; i++) {
    ret += b[i] * pref[n-i] % MOD;
    ret %= MOD;
  }
  cout << ret << endl;
  
  return 0;
}