/* #region Head */

// #include <bits/stdc++.h>
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert> // assert.h
#include <cmath>   // math.h
#include <cstring>
#include <ctime>
#include <deque>
#include <fstream>
#include <functional>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <memory>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pll = pair<ll, ll>;
template <class T> using vc = vector<T>;
template <class T> using vvc = vc<vc<T>>;
using vll = vc<ll>;
using vvll = vvc<ll>;
using vld = vc<ld>;
using vvld = vvc<ld>;
using vs = vc<string>;
using vvs = vvc<string>;
template <class T, class U> using um = unordered_map<T, U>;
template <class T> using pq = priority_queue<T>;
template <class T> using pqa = priority_queue<T, vc<T>, greater<T>>;
template <class T> using us = unordered_set<T>;

#define TREP(T, i, m, n) for (T i = (m), i##_len = (T)(n); i < i##_len; ++(i))
#define TREPM(T, i, m, n) for (T i = (m), i##_max = (T)(n); i <= i##_max; ++(i))
#define TREPR(T, i, m, n) for (T i = (m), i##_min = (T)(n); i >= i##_min; --(i))
#define TREPD(T, i, m, n, d) for (T i = (m), i##_len = (T)(n); i < i##_len; i += (d))
#define TREPMD(T, i, m, n, d) for (T i = (m), i##_max = (T)(n); i <= i##_max; i += (d))

#define REP(i, m, n) for (ll i = (m), i##_len = (ll)(n); i < i##_len; ++(i))
#define REPM(i, m, n) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; ++(i))
#define REPR(i, m, n) for (ll i = (m), i##_min = (ll)(n); i >= i##_min; --(i))
#define REPD(i, m, n, d) for (ll i = (m), i##_len = (ll)(n); i < i##_len; i += (d))
#define REPMD(i, m, n, d) for (ll i = (m), i##_max = (ll)(n); i <= i##_max; i += (d))
#define REPI(itr, ds) for (auto itr = ds.begin(); itr != ds.end(); itr++)
#define REPIR(itr, ds) for (auto itr = ds.rbegin(); itr != ds.rend(); itr++)
#define ALL(x) begin(x), end(x)
#define SIZE(x) ((ll)(x).size())
#define ISIZE(x) ((int)(x).size())
#define PERM(c)                                                                                                        \
    sort(ALL(c));                                                                                                      \
    for (bool c##p = 1; c##p; c##p = next_permutation(ALL(c)))
#define UNIQ(v) v.erase(unique(ALL(v)), v.end());
#define CEIL(a, b) (((a) + (b)-1) / (b))

#define endl '\n'

constexpr ll INF = 1'010'000'000'000'000'017LL;
constexpr int IINF = 1'000'000'007LL;
constexpr ll MOD = 1'000'000'007LL; // 1e9 + 7
// constexpr ll MOD = 998244353;
constexpr ld EPS = 1e-12;
constexpr ld PI = 3.14159265358979323846;

// 前方宣言
template <typename T> istream &operator>>(istream &is, vc<T> &vec);
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec);
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec);
template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr);
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr);
template <typename T, size_t _Nm> ostream &operator>>(ostream &os, const array<T, _Nm> &arr);
template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var);
template <class T> ostream &out_iter(ostream &os, const T &map_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var);
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var);
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var);
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var);
template <typename T> ostream &operator<<(ostream &os, const queue<T> &queue_var);
template <typename T> ostream &operator<<(ostream &os, const stack<T> &stk_var);

template <typename T> istream &operator>>(istream &is, vc<T> &vec) { // vector 入力
    for (T &x : vec)
        is >> x;
    return is;
}
template <typename T> ostream &operator<<(ostream &os, const vc<T> &vec) { // vector 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}
template <typename T> ostream &operator>>(ostream &os, const vc<T> &vec) { // vector 出力 (inline)
    REP(i, 0, SIZE(vec)) os << vec[i] << (i == i_len - 1 ? "\n" : " ");
    return os;
}

template <typename T, size_t _Nm> istream &operator>>(istream &is, array<T, _Nm> &arr) { // array 入力
    REP(i, 0, SIZE(arr)) is >> arr[i];
    return is;
}
template <typename T, size_t _Nm> ostream &operator<<(ostream &os, const array<T, _Nm> &arr) { // array 出力 (for dump)
    os << "{";
    REP(i, 0, SIZE(arr)) os << arr[i] << (i == i_len - 1 ? "" : ", ");
    os << "}";
    return os;
}

template <typename T, typename U> istream &operator>>(istream &is, pair<T, U> &pair_var) { // pair 入力
    is >> pair_var.first >> pair_var.second;
    return is;
}
template <typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &pair_var) { // pair 出力
    os << "(" << pair_var.first << ", " << pair_var.second << ")";
    return os;
}

// map, um, set, us 出力
template <class T> ostream &out_iter(ostream &os, const T &map_var) {
    os << "{";
    REPI(itr, map_var) {
        os << *itr;
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    return os << "}";
}
template <typename T, typename U> ostream &operator<<(ostream &os, const map<T, U> &map_var) {
    return out_iter(os, map_var);
}
template <typename T, typename U> ostream &operator<<(ostream &os, const um<T, U> &map_var) {
    os << "{";
    REPI(itr, map_var) {
        auto [key, value] = *itr;
        os << "(" << key << ", " << value << ")";
        auto itrcp = itr;
        if (++itrcp != map_var.end()) os << ", ";
    }
    os << "}";
    return os;
}
template <typename T> ostream &operator<<(ostream &os, const set<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const us<T> &set_var) { return out_iter(os, set_var); }
template <typename T> ostream &operator<<(ostream &os, const pq<T> &pq_var) {
    pq<T> pq_cp(pq_var);
    os << "{";
    if (!pq_cp.empty()) {
        os << pq_cp.top(), pq_cp.pop();
        while (!pq_cp.empty())
            os << ", " << pq_cp.top(), pq_cp.pop();
    }
    return os << "}";
}

// tuple 出力
template <size_t N = 0, bool end_line = false, typename... Args> ostream &operator<<(ostream &os, tuple<Args...> &a) {
    if constexpr (N < std::tuple_size_v<tuple<Args...>>) {
        os << get<N>(a);
        if constexpr (N + 1 < std::tuple_size_v<tuple<Args...>>) {
            os << ' ';
        } else if constexpr (end_line) {
            os << '\n';
        }
        return operator<< <N + 1, end_line>(os, a);
    }
    return os;
}
template <typename... Args> void print_tuple(tuple<Args...> &a) { operator<< <0, true>(std::cout, a); }

void pprint() { std::cout << endl; }
template <class Head, class... Tail> void pprint(Head &&head, Tail &&...tail) {
    std::cout << head;
    if (sizeof...(Tail) > 0) std::cout << ' ';
    pprint(move(tail)...);
}

// dump
#define DUMPOUT cerr
void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head &&head, Tail &&...tail) {
    DUMPOUT << head;
    if (sizeof...(Tail) > 0) DUMPOUT << ", ";
    dump_func(move(tail)...);
}

// chmax (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmax(T &xmax, const U &x, Comp comp = {}) {
    if (comp(xmax, x)) {
        xmax = x;
        return true;
    }
    return false;
}

// chmin (更新「される」かもしれない値が前)
template <typename T, typename U, typename Comp = less<>> bool chmin(T &xmin, const U &x, Comp comp = {}) {
    if (comp(x, xmin)) {
        xmin = x;
        return true;
    }
    return false;
}

// ローカル用
#ifndef ONLINE_JUDGE
#define DEBUG_
#endif

#ifndef MYLOCAL
#undef DEBUG_
#endif

#ifdef DEBUG_
#define DEB
#define dump(...)                                                                                                      \
    DUMPOUT << "  " << string(#__VA_ARGS__) << ": "                                                                    \
            << "[" << to_string(__LINE__) << ":" << __FUNCTION__ << "]" << endl                                        \
            << "    ",                                                                                                 \
        dump_func(__VA_ARGS__)
#else
#define DEB if (false)
#define dump(...)
#endif

#define VAR(type, ...)                                                                                                 \
    type __VA_ARGS__;                                                                                                  \
    assert((std::cin >> __VA_ARGS__));

template <typename T> istream &operator,(istream &is, T &rhs) { return is >> rhs; }
template <typename T> ostream &operator,(ostream &os, const T &rhs) { return os << ' ' << rhs; }

struct AtCoderInitialize {
    static constexpr int IOS_PREC = 15;
    static constexpr bool AUTOFLUSH = false;
    AtCoderInitialize() {
        ios_base::sync_with_stdio(false), std::cin.tie(nullptr), std::cout.tie(nullptr);
        std::cout << fixed << setprecision(IOS_PREC);
        if (AUTOFLUSH) std::cout << unitbuf;
    }
} ATCODER_INITIALIZE;

void Yn(bool p) { std::cout << (p ? "Yes" : "No") << endl; }
void YN(bool p) { std::cout << (p ? "YES" : "NO") << endl; }

template <typename T> constexpr void operator--(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]--;
}
template <typename T> constexpr void operator++(vc<T> &v, int) noexcept {
    for (int i = 0; i < ISIZE(v); ++i)
        v[i]++;
}

/* #endregion */

// #include <atcoder/all>
// using namespace atcoder;

namespace euclidean_distance_map {

// 距離
using dist_t = ll;
// 座標
using coord_t = ll;

// 距離の最大値
constexpr dist_t MAXDIST = std::numeric_limits<int>::max() >> 1;

// 交点座標を求める
inline constexpr int get_intersection_x_2(coord_t x0, coord_t x1, coord_t y0, coord_t y1) {
    assert(x0 != x1);
    if (x0 > x1) std::swap(x0, x1), std::swap(y0, y1);
    const int numerator = ((int)x1 * x1 - (int)x0 * x0) + (y1 - y0);
    const int denominator = 2 * (x1 - x0);
    return (numerator + denominator - 1) / denominator; // CEIL
}
inline constexpr int get_intersection_x(coord_t x0, coord_t x1, coord_t y0, coord_t y1) {
    assert(x0 != x1);
    if (x0 > x1) std::swap(x0, x1), std::swap(y0, y1);
    // x0 <= x1

    const int numerator = ((int)x0 + x1) + ((int)y1 - y0);
    const int denominator = 2;
    const int ans = CEIL(numerator, denominator);
    if (ans > x1) return MAXDIST;
    if (ans < x0) return -MAXDIST;
    return ans;
}

// ユークリッド距離マップを作成する
void generate_euclidean_distance_map(
    const vc<short> &table,  // 画像データ （on/off テーブル (width * height), 0=off, 1以上=on）
    const coord_t width,     // 幅
    const coord_t height,    // 高さ
    vc<dist_t> &distmap,     // ユークリッド距離マップ
    vc<coord_t> &distmap_src // 最近点の座標
) {
    // using src_t = std::array<coord_t, 2>;
    // using distmap_line_t = std::vector<dist_t>;
    // using distmap_line_src_t = std::vector<src_t>;
    // using distmap_t = std::vector<distmap_line_t>;
    // using distmap_src_t = std::vector<distmap_line_src_t>;

    // phase 1
    dist_t *const distmap_phase1 = new dist_t[(int)height * width];

    // 列内で、何行目が最近点か
    coord_t *const distmap_phase1_src = new coord_t[(int)height * width];

    // #pragma omp parallel for
    for (coord_t col = 0; col < width; ++col) {
        // 列内でユークリッド距離マップを作る
        dist_t *const distmap_phase1_forward = new dist_t[height];
        dist_t *const distmap_phase1_backward = new dist_t[height];
        coord_t *const distmap_phase1_src_forward = new coord_t[height];
        coord_t *const distmap_phase1_src_backward = new coord_t[height];

        // 上から走査
        coord_t src_row = -1;
        dist_t curdist = MAXDIST;
        for (coord_t row = 0; row < height; ++row) {
            if (++curdist > MAXDIST) curdist = MAXDIST;
            if (table[width * row + col] > 0) {
                curdist = 0;
                src_row = row;
                distmap_phase1_forward[row] = curdist;
                distmap_phase1_src_forward[row] = src_row;
            } else {
                distmap_phase1_forward[row] = curdist;
                distmap_phase1_src_forward[row] = src_row;
            }
        }

        // 下から走査
        src_row = -1;
        curdist = MAXDIST;
        for (coord_t row = height - 1; row >= 0; --row) {
            if (++curdist > MAXDIST) curdist = MAXDIST;
            if (table[width * row + col] > 0) {
                curdist = 0;
                // src = { row, col };
                src_row = row;
                distmap_phase1_backward[row] = curdist;
                distmap_phase1_src_backward[row] = src_row;
            } else {
                distmap_phase1_backward[row] = curdist;
                distmap_phase1_src_backward[row] = src_row;
            }
        }

        // 結果を格納
        for (short row = 0; row < height; ++row) {
            if (distmap_phase1_forward[row] <= distmap_phase1_backward[row]) {
                distmap_phase1[width * row + col] = distmap_phase1_forward[row];
                distmap_phase1_src[width * row + col] = distmap_phase1_src_forward[row];
            } else {
                distmap_phase1[width * row + col] = distmap_phase1_backward[row];
                distmap_phase1_src[width * row + col] = distmap_phase1_src_backward[row];
            }
        }
        delete[] distmap_phase1_forward;
        delete[] distmap_phase1_backward;
        delete[] distmap_phase1_src_forward;
        delete[] distmap_phase1_src_backward;
    }

    // phase 2
    // #pragma omp parallel for
    for (coord_t row = 0; row < height; ++row) {
        // 行内を左方向から走査

        using col_pair = std::pair<dist_t, coord_t>; // (x, f) := 境界値 x から先はインデックス f の領域
        std::stack<col_pair, std::vector<col_pair>> stk;

        // 初期化
        stk.push({-MAXDIST, 0});

        // 左から走査
        for (coord_t col = 1; col < width; ++col) {
            if (distmap_phase1[width * row + col] == MAXDIST) continue;
            assert(stk.size() > 0ul);

            coord_t tf = stk.top().second;
            if (distmap_phase1[width * row + tf] == MAXDIST) {
                stk.top().second = col;
                continue;
            }
            int x_intersection =
                get_intersection_x(tf, col, distmap_phase1[width * row + tf] * distmap_phase1[width * row + tf],
                                   distmap_phase1[width * row + col] * distmap_phase1[width * row + col]);
            while (x_intersection <= stk.top().first) {
                stk.pop();
                if (stk.empty()) break;
                tf = stk.top().second;
                x_intersection =
                    get_intersection_x(tf, col, distmap_phase1[width * row + tf] * distmap_phase1[width * row + tf],
                                       distmap_phase1[width * row + col] * distmap_phase1[width * row + col]);
            }
            stk.push({x_intersection, col});
        }
        {
            auto stk2 = stk;
            dump(stk2.size());
            while (stk2.size()) {
                dump(stk2.top());
                stk2.pop();
            }
        }

        // 右から走査
        while (stk.top().first >= width)
            stk.pop();
        for (coord_t col = width - 1; col >= 0; --col) {
            if (col < stk.top().first) stk.pop();
            if (stk.size() == 0) {
                vc<dist_t> data(distmap_phase1, distmap_phase1 + (width * height));
                dump(row, col, data, distmap, width, height);
            }
            assert(stk.size() > 0ul);
            coord_t col_target = stk.top().second;
            const int delta_row = distmap_phase1[width * row + col_target];
            const int delta_col = col - col_target;
            distmap[width * row + col] =
                (dist_t)std::min<dist_t>(MAXDIST, delta_row * delta_row + delta_col * delta_col);
            distmap_src[2 * (width * row + col) + 0] = col_target;
            distmap_src[2 * (width * row + col) + 1] = distmap_phase1_src[width * row + col_target];
        }
    }
    delete[] distmap_phase1;
    delete[] distmap_phase1_src;
}
}; // namespace euclidean_distance_map

// Problem
void solve() {
    VAR(ll, n);
    vll x(n), y(n);
    REP(i, 0, n) cin >> x[i], y[i];
    VAR(ll, m);
    vll z(m), w(m);
    REP(i, 0, m) cin >> z[i], w[i];

    ll height = 1;
    ll width = 1;
    REP(i, 0, n) {
        chmax(width, x[i] + 1);
        chmax(height, y[i] + 1);
    }
    REP(i, 0, m) {
        chmax(width, z[i] + 1);
        chmax(height, w[i] + 1);
    }

    vc<short> table(height * width, 0);
    REP(i, 0, n) {
        table[width * y[i] + x[i]] = 1; //
    }
    dump(table);

    vc<euclidean_distance_map::dist_t> distmap((int)height * width, 0);
    vc<euclidean_distance_map::coord_t> distmap_src(2 * height * width);
    euclidean_distance_map::generate_euclidean_distance_map(table, width, height, distmap, distmap_src);
    dump(distmap);

    ll mi = INF;
    REP(i, 0, m) {
        chmin(mi, distmap[width * w[i] + z[i]]); //
    }
    pprint(mi);
}

// entry point
int main() {
    solve();
    return 0;
}