#include<bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 1e9 + 7;

const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}


template< typename T, typename Compare=less< T > >
vector< T > monotone_minima(int N, const function< T(int, int) > &f, T ident, const Compare &comp = Compare()) {
  vector< T > dp(N + 1, ident);
  function< void(int, int, int, int) > solve2 = [&](int l, int r, int a, int b) {
    if(l == r) return;
    int md = (l + r) / 2;
    T ma = ident;
    int mi = -1;
    for(int i = a; i < b; i++) {
      T cst = dp[i + 1] + f(i, md);
      if(comp(cst, ma)) {
        ma = cst;
        mi = i;
      }
    }
    dp[md] = min(dp[md], ma);
    solve2(l, md, a, mi + 1);
    solve2(md + 1, r, mi, b);
  };
  function< void(int, int) > solve = [&](int l, int r) {
    if(l + 1 == r) {
      T cst = f(l, l) + dp[r];
      if(comp(cst, dp[l])) dp[l] = cst;
    } else {
      int md = (l + r) / 2;
      solve(md, r);
      solve2(l, md, md, r);
      solve(l, md);
    }
  };
  dp.back() = 0;
  solve(0, N);
  return dp;
}


int main() {
  int n;
  cin >> n;
  vector< int > 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];
  function< int64_t(int, int) > dist = [&](int i, int j) {
    int s = abs(a[i] - x[j]);
    int t = abs(y[j]);
    return 1LL * s * s * s + 1LL * t * t * t;
  };
  constexpr int64_t ident = 1LL << 60;
  cout << monotone_minima(n, dist, ident)[0] << endl;
}