#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#define popcount __builtin_popcount
using namespace std;
typedef long long int ll;
typedef pair<int, ll> P;
int n;
ll a[300030], x[300030], y[300030];
ll dp[300030];
vector<P> monotone_minima(int h, int w, const function<ll(int, int)> &f){
	vector<P> dp(h);
	const ll INF=1e18;
	auto solve=[&](auto solve, int d, int u, int l, int r)->void{
		if(d>u) return;
		int m=(d+u)/2;
		ll mn=INF;
		int k;
		for(int i=l; i<=r; i++){
			ll v=f(m, i);
			if(mn>v){
				mn=v;
				k=i;
			}
		}
		dp[m]=P(k, mn);
		solve(solve, d, m-1, l, k);
		solve(solve, m+1, u, k, r);
	};
	solve(solve, 0, h-1, 0, w-1);
	return dp;
}
void solve(int l, int r){
	if(l>r) return;
	int m=(l+r)/2;
	solve(l, m-1);
	vector<P> dp1=monotone_minima(r-m+1, m-l+1, [&](int i, int j){ return dp[j+l-1]+y[j+l]*y[j+l]*y[j+l]+abs(x[j+l]-a[i+m])*abs(x[j+l]-a[i+m])*abs(x[j+l]-a[i+m]);});
	for(int i=m; i<=r; i++) dp[i]=min(dp[i], dp1[i-m].second);
	solve(m+1, r);
}
int main()
{
	scanf("%d", &n);
	const ll INF=1e18;
	fill(dp, dp+n+1, INF);
	dp[0]=0;
	for(int i=1; i<=n; i++) scanf("%lld", &a[i]);
	for(int i=1; i<=n; i++) scanf("%lld", &x[i]);
	for(int i=1; i<=n; i++) scanf("%lld", &y[i]);
	solve(1, n);
	printf("%lld\n", dp[n]);
    return 0;
}