#include <bits/stdc++.h>
using namespace std;

int main(){
  int n; cin >> n;
  vector<long long> a(n), x(n), y(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> x[i];
  }
  for (int i = 0; i < n; i++) {
    cin >> y[i];
  }
  int look = n-1; long long ans = 0;
  vector<long long> v(n+1, -1); v[n] = 0;
  while(look >= 0) {
    long long mi = -1; long long m = 1e18;
    for (int i = 0; i <= look; i++) {
      long long f = (a[look] - x[i]) * (a[look] - x[i]) + y[i]*y[i];
      if (v[i] > f + v[look+1] || v[i] == -1) {
        v[i] = f + v[look+1];
      }
      if (m >= v[i]) {
        m = v[i];
        mi = i;
      }
    }
    if (look == 0) break;
    look = mi-1;
  }
  cout << v[0] << endl;
  return 0;
}