#include <stdio.h>
int n, a[300005], x[300005], y[300005];
long long dp[300005];
namespace segmentTree
{
	int val[400005];
	long long k[400005], b[400005];
	inline int lson(int x) { return x << 1; }
	inline int rson(int x) { return x << 1 | 1; }
	inline long long function(long long k, long long b, long long x) { return (x - k) * (x - k) + b; }
	inline long long min(long long x, long long y) { return x < y ? x : y; }
	void build(int root, int tl, int tr)
	{
		k[root] = 1000000000;
		b[root] = 1e18;
		if (tl != tr)
		{
			int tm = (tl + tr) >> 1;
			build(lson(root), tl, tm);
			build(rson(root), tm + 1, tr);
		}
	}
	void update(int newk, long long newb, int root, int tl, int tr)
	{
		bool lbetter = function(k[root], b[root], tl) > function(newk, newb, tl);
		bool rbetter = function(k[root], b[root], tr) > function(newk, newb, tr);
		if (lbetter && rbetter)
		{
			k[root] = newk;
			b[root] = newb;
			return;
		}
		if (!lbetter && !rbetter)
			return;
		int tm = (tl + tr) >> 1;
		bool mlbetter = function(k[root], b[root], tm) > function(newk, newb, tm);
		if (lbetter && mlbetter)
		{
			k[root] ^= newk ^= k[root] ^= newk;
			b[root] ^= newb ^= b[root] ^= newb;
			return update(newk, newb, rson(root), tm + 1, tr);
		}
		bool mrbetter = function(k[root], b[root], tm + 1) > function(newk, newb, tm + 1);
		if (rbetter && mrbetter)
		{
			k[root] ^= newk ^= k[root] ^= newk;
			b[root] ^= newb ^= b[root] ^= newb;
			return update(newk, newb, lson(root), tl, tm);
		}
		if (lbetter)
			update(newk, newb, lson(root), tl, tm);
		else
			update(newk, newb, rson(root), tm + 1, tr);
	}
	long long query(int i, int root, int tl, int tr)
	{
		if (i < tl || tr < i)
			return 2e18;
		long long res = function(k[root], b[root], i);
		if (tl == tr)
			return res;
		int tm = (tl + tr) >> 1;
		return min(res, i <= tm ? query(i, lson(root), tl, tm) : query(i, rson(root), tm + 1, tr));
	}
}
int main()
{
	scanf("%d", &n);
	for (int i = 1; i <= n; ++i)
		scanf("%d", a + i);
	for (int i = 1; i <= n; ++i)
		scanf("%d", x + i);
	for (int i = 1; i <= n; ++i)
		scanf("%d", y + i);
	segmentTree::build(1, 0, 100000);
	for (int i = 1; i <= n; ++i)
	{
		segmentTree::update(x[i], dp[i - 1] + y[i] * (long long)(y[i]), 1, 0, 100000);
		dp[i] = segmentTree::query(a[i], 1, 0, 100000);
	}
	printf("%lld\n", dp[n]);
	return 0;
}