#include<bits/stdc++.h>
#define uint unsigned int
#define ll long long
#define ull unsigned long long
#define PII pair<int,int>
#define PLL pair<ll,ll>
#define DU double
#define rep(i,x,n) for(int i=(x);i<=(n);i++)
#define nep(i,x,n) for(int i=(x);i>=(n);i--)
using namespace std;
const int N=10010;
ll n,maxx,a[N],b[N];
bool st[N];
struct node{
	ll c,id;
	inline bool operator<(const node &t)const{
		return c>t.c;
	}
}x[N];
inline ll read(){
	ll s=0,f=1;
	char ch=getchar();
	while(!isdigit(ch)){
		if(ch=='-') f=-1;
		ch=getchar();
	}
	while(isdigit(ch)){
		s=(s<<3)+(s<<1)+(ch^48);
		ch=getchar();
	}
	return s*f;
}
inline void print(ll x){
	if(x<0){
		putchar('-');
		x=-x;
	}
	if(x>9) print(x/10);
	putchar(x%10+'0');
}
inline void Solve(){
	n=read();
	ll ans=0;
	rep(i,1,n) a[i]=read(),ans+=a[i];
	rep(i,1,n) b[i]=read(),x[i].c=b[i],x[i].id=i;
	stable_sort(x+1,x+n+1);
	memset(st,1,sizeof st);
	rep(i,1,n){
		int id=x[i].id;
		ans+=st[id-1]*b[id-1]+st[id+1]*b[id+1];
		st[id]=0;
	}
	print(ans);
}
int main(){
//	freopen("A.in","r",stdin);
//	freopen("A.out","w",stdout);
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	int Tests=1;
	while(Tests--) Solve();
	return 0;
}