#include "bits/stdc++.h"

using namespace std;

#define DEBUG(x) cerr<<#x<<": "<<x<<endl;
#define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl

//typedef long long ll;
typedef __int128 ll;
#define vi vector<int>
#define vl vector<ll>
#define vii vector< vector<int> >
#define vll vector< vector<ll> >
#define vs vector<string>
#define pii pair<int,int>
#define pis pair<int,string>
#define psi pair<string,int>
#define pll pair<ll,ll>
template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); }
template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); }
template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; }
#define X first
#define Y second
#define rep(i,n) for(ll i=0;i<(ll)(n);i++)
#define rep1(i,n) for(ll i=1;i<=(ll)(n);i++)
#define rrep(i,n) for(ll i=(ll)(n)-1;i>=0;i--)
#define rrep1(i,n) for(ll i=(ll)(n);i>0;i--)
#define REP(i,a,b) for(ll i=(ll)a;i<(ll)b;i++)
#define in(x, a, b) (a <= x && x < b)
#define all(c) c.begin(),c.end()
template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; }
const ll inf = 1000000001;
const ll INF = 2e18;
const ll MOD = 1000000007;
const double pi = 3.14159265358979323846;
#define Sp(p) cout<<setprecision(15)<< fixed<<p<<endl;
int dx[4] = { 1,0, -1,0 }, dy[4] = { 0,1,0,-1 };
int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 };
#define fio() cin.tie(0); ios::sync_with_stdio(false);


//最小値クエリ
//INFの値によってはすぐオーバーフローするので注意(|ab| < LLONG_MAX/4)
//非順序add非順序query
//http://d.hatena.ne.jp/sune2/20140310/1394440369
struct CHT2 {
	CHT2() {
		// 番兵
		S.insert({ L(INF,0), L(-INF,0) });
		C.insert(cp(L(INF, 0), L(-INF, 0)));
	}
	// for debug
	void print() {
		cout << "S : "; for (auto it : S) printf("(%lld,%lld)", it.a, it.b); puts("");
		cout << "C : "; for (auto it : C) printf("(%lld,%lld)", it.n, it.d); puts("");
	}
	// |ab| < LLONG_MAX/4 ???
	void add(ll a, ll b) {
		const L p(a, b);
		It pos = S.insert(p).first;
		if (check(*it_m1(pos), p, *it_p1(pos))) {
			// 直線(a,b)が不要
			S.erase(pos);
			return;
		}
		C.erase(cp(*it_m1(pos), *it_p1(pos)));
		{
			// 右方向の削除
			It it = it_m1(pos);
			while (it != S.begin() && check(*it_m1(it), *it, p)) --it;
			C_erase(it, it_m1(pos));
			S.erase(++it, pos);
			pos = S.find(p);
		}
		{
			// 左方向の削除
			It it = it_p1(pos);
			while (it_p1(it) != S.end() && check(p, *it, *it_p1(it))) ++it;
			C_erase(++pos, it);
			S.erase(pos, it);
			pos = S.find(p);
		}
		C.insert(cp(*it_m1(pos), *pos));
		C.insert(cp(*pos, *it_p1(pos)));
	}
	ll query(ll x) {
		const L &p = (--C.lower_bound(CP(x, 1, L(0, 0))))->p;
		return p.a*x + p.b;
	}

private:

	template<class T> T it_p1(T a) { return ++a; }
	template<class T> T it_m1(T a) { return --a; }
	struct L {
		ll a, b;
		L(ll a, ll b) : a(a), b(b) {}
		bool operator<(const L &rhs) const {
			return a != rhs.a ? a > rhs.a : b < rhs.b;
		}
	};
	struct CP {
		ll n, d;
		L p;
		CP(ll _n, ll _d, const L &p) : n(_n), d(_d), p(p) {
			if (d < 0) { n *= -1; d *= -1; }
		};
		bool operator<(const CP &rhs) const {
			if (n == INF || rhs.n == -INF) return 0;
			if (n == -INF || rhs.n == INF) return 1;
			return n * rhs.d < rhs.n * d;
		}
	};
	set<L> S;
	set<CP> C;

	typedef set<L>::iterator It;

	void C_erase(It a, It b) {
		for (It it = a; it != b; ++it)
			C.erase(cp(*it, *it_p1(it)));
	}
	CP cp(const L &p1, const L &p2) {
		if (p1.a == INF) return CP(-INF, 1, p2);
		if (p2.a == -INF) return CP(INF, 1, p2);
		return CP(p1.b - p2.b, p2.a - p1.a, p2);
	}
	bool check(const L &p1, const L &p2, const L &p3) {
		if (p1.a == p2.a && p1.b <= p2.b) return 1;
		if (p1.a == INF || p3.a == -INF) return 0;
		return (p2.a - p1.a)*(p3.b - p2.b) >= (p2.b - p1.b)*(p3.a - p2.a);
	}
};

int main() {
  int n;
  cin >> n;
  vl a(n + 1), x(n), y(n);
  rep (i, n) {
    long long temp;
    cin >> temp;
    a[i] = temp;
  }
  rep (i, n) {
    long long temp;
    cin >> temp;
    x[i] = temp;

  }
  rep (i, n) {
    long long temp;
    cin >> temp;
    y[i] = temp;
  }

  vl dp(n + 1);
  CHT2 cht;
  cht.add(-2*x[0], dp[0] + x[0]*x[0] + y[0]*y[0]);
  rep1 (i, n) {
    dp[i] = cht.query(a[i - 1]) + a[i - 1] * a[i - 1];
    cht.add(-2*x[i], dp[i] + x[i]*x[i] + y[i]*y[i]);
  }
  //DEBUG_VEC(dp);
  cout << (long long)dp[n] << endl;
}