#include<bits/stdc++.h>

using namespace std;

using ll = long long;
using ull = unsigned long long;
using pi = pair<int, int>;
using pl = pair<ll, ll>;
using mi = map<int, int>;
using ml = map<ll, ll>;
using vi = vector<int>;
using vl = vector<ll>;

#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define F0R(i, b) FOR(i, 0, b)
#define ROF(i, b, a) for(int i = b; i >= a; --i)
#define R0F(i, b) ROF(i, b, 0)
#define trav(x, a) for(auto &x: a)

#define mp make_pair
#define mtp make_tuple
#define pb push_back
#define pf push_front

#define sz(x) int(x.size())
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()

void solve()
{
	int n; cin >> n;
    vl a(n), b(n);
    trav(v, a) cin >> v;
    trav(v, b) cin >> v;
    vl pr(n+1, 0);
    F0R(i, n)
        pr[i+1] = pr[i] + a[i]*b[i];
    ll ans = pr[n];
    F0R(i, n)
    {
        ll cur = a[i]*b[i];
        for(int l = i-1, r = i+1; l >= 0 && r < n; --l, ++r)
        {
            cur += a[l]*b[r];
            cur += a[r]*b[l];
            ans = max(ans, cur+pr[l]+pr[n]-pr[r+1]);
        }
        cur = 0;
        for(int l = i, r = i+1; l >= 0 && r < n; --l, ++r)
        {
            cur += a[l]*b[r];
            cur += a[r]*b[l];
            ans = max(ans, cur+pr[l]+pr[n]-pr[r+1]);
        }
    }
    cout << ans << "\n";
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
    
    solve();
	return 0;
}