"""
a,b の convolution の、n-1 次までの和を r^{i} の重み付きで求める
a,b は n 次以上
"""
def sum_of_convolution(a,b,n,r):
    assert len(a) >= n and len(b) >= n
    if r != 1:
        R = 1
        for i in range(n):
            a[i] = a[i]*R%MOD
            b[i] = b[i]*R%MOD
            R = R*r%MOD
    acc = res = 0
    for i in range(n):
        acc += a[i]
        acc %= MOD
        res += acc*b[n-1-i]
        res %= MOD
    return res
    
# coding: utf-8
# Your code here!
import sys
readline = sys.stdin.readline
read = sys.stdin.read

#n,q = map(int,readline().split())
n = int(readline())+1
a = [int(readline()) for _ in range(n)]
b = [int(readline()) for _ in range(n)]
MOD = 10**9+7
print(sum_of_convolution(a,b,n,1))