#define _GLIBCXX_DEBUG
#import <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, n) for (int i = 1; i < (int)(n); i++)
typedef long long ll;

#define updiv(N,X) (N + X - 1) / X
#define l(n) n.begin(),n.end()
#define YesNo(Q) Q==1?cout<<"Yes":cout<<"No"

const long long MOD = 1000000007LL;
vector<long long> fact, fact_inv, inv;
/*  init_nCk :二項係数のための前処理
    計算量:O(n)
*/
void init_nCk(int SIZE) {
    fact.resize(SIZE + 5);
    fact_inv.resize(SIZE + 5);
    inv.resize(SIZE + 5);
    fact[0] = fact[1] = 1;
    fact_inv[0] = fact_inv[1] = 1;
    inv[1] = 1;
    for (int i = 2; i < SIZE + 5; i++) {
        fact[i] = fact[i - 1] * i % MOD;
        inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;
        fact_inv[i] = fact_inv[i - 1] * inv[i] % MOD;
    }
}
/*  nCk :MODでの二項係数を求める(前処理 int_nCk が必要)
    計算量:O(1)
*/
long long nCk(int n, int k) {
    assert(!(n < k));
    assert(!(n < 0 || k < 0));
    return fact[n] * (fact_inv[k] * fact_inv[n - k] % MOD) % MOD;
}

ll POW(ll x,ll k,ll n){
	if(k==0)return 1;
	ll ret=POW(x,k/2,n);
	ret*=ret%n;
	if(k%2==1){ ret*=x%n; }
	return ret%n;
}

int main() {ll anss=0; 
  ll a;cin>>a;vector<tuple<double long,ll,ll>>v(a);ll ans=0;
          rep(i,a){
    cin >> get<2>(v[i]);  
  }
  rep(i,a){
    cin >> get<1>(v[i]);  
    
  }  
  do{
 
  //sort(l(v));reverse(l(v));
  ll bite = 1;ll ans = 0;
  rep(i,a){
    ans += (bite%MOD)*((get<2>(v[i]))%MOD);
    ans = ans % MOD;
    bite *= get<1>(v[i]);
  }
  anss = max(anss,ans);
  //if(ans == 2048669LL){rep(i,a){cout << get<2>(v[i]) << " ";}cout<<endl;rep(i,a){cout << get<1>(v[i]) << " ";}cout<<endl;}  
  }while(next_permutation(l(v)));
  cout << anss << endl;
}