#include<bits/stdc++.h>
using namespace std;
   
#define ll long long
#define ld long double
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define INF 999999999999999
#define endl "\n"
#define MOD 1000000007
 
const ll mod = 1000000007;
ll po(ll x,ll n){ll ans=1;while(n>0){if(n&1)
ans=(ans*x);x=(x*x);n/=2;}return ans;}


void func(){

    ll n; cin>>n;
    vector<ll> a(n+1);
    vector<ll> b(n+1);

    for(int i=1;i<=n;i++) cin>>a[i];
    for(int j=1;j<=n;j++) cin>>b[j];

    ll dp[n+1][n+1];
    vector<ll> sum(n+5,0);

    for(int i=1;i<=n;i++) sum[i] =+ sum[i-1] + a[i]*b[i];

    for(int i=1;i<=n;i++){
        ll l = i;
        ll r = i;
        ll p = a[i]*b[i];
        dp[1][i] = p;
        l--;
        r++;

        while(l>=1 && r<=n){
            p += a[l]*b[r] + a[r]*b[l];
            dp[r-l+1][l] = p;
            l--;
            r++;
        }
    }

    for(int i=1;i<n;i++){
        ll l = i;
        ll r = i+1;
        ll p = 0;

        while(l>=1 && r<=n){
            p += a[l]*b[r] + a[r]*b[l];
            dp[r-l+1][l] = p;
            l--;
            r++;
        }
    }

    ll ans = sum[n];

    for(int len=2;len<=n;len++){
        for(int i=1;i+len-1<=n;i++){
            ll temp = sum[n]-sum[i+len-1]+sum[i-1];
            temp += dp[len][i];
            ans = max(ans,temp);
        }
    }

    cout<<ans<<endl;


}
 
int main(){
        ios_base::sync_with_stdio(false);
        cin.tie(0);
        cout.tie(0);  
   
        #ifndef ONLINE_JUDGE
        freopen("input.txt", "r" , stdin);
        freopen("output.txt", "w" , stdout);
        #endif
   
     ll t=1;
     //cin>>t;
     while(t--) 
     func();
     
}