def compare(x,y):
  # 比較関数 (x<=y)

  a1,b1=x
  a2,b2=y
  if a1+b1*a2>=a2+b2*a1:
    return True
  return False

def merge(l, r):
    new = []
    ln = 0
    rn = 0
    while ln < len(l) and rn < len(r):
        if compare(l[ln],r[rn]):
            new.append(l[ln])
            ln += 1
        else:
            new.append(r[rn])
            rn += 1
    for i in range(ln, len(l)):
        new.append(l[i])
    for i in range(rn, len(r)):
        new.append(r[i])
    return new
 
def MergeSort(l):
    if len(l) == 0:
        return []
    if len(l) == 1:
        return l
    else:
        a = l[:len(l)//2]
        b = l[len(l)//2:]
        return merge(MergeSort(a), MergeSort(b))

mod=10**9+7
n=int(input())
a=list(map(int,input().split()))
b=list(map(int,input().split()))
ab=[]
for i in range(n):
  ab.append((a[i],b[i]))

ab=MergeSort(ab)
ans=0
x=1
for a,b in ab:
  ans+=a*x
  ans%=mod
  x=b*x
  x%=mod

print(ans)
#print(ab)