#include <bits/stdc++.h>
using namespace std;
const long long INF = 1 << 28;
const long long LINF = 1ll << 61;
inline long long getnum() {
  register long long r = 0;
  register bool ng = 0;
  register char c;
  c = getchar();
  while (c != '-' && (c < '0' || c > '9')) c = getchar();
  if (c == '-') ng = 1, c = getchar();
  while (c != ' ' && c != '\n') r = r * 10 + c - '0', c = getchar();
  if (ng) r = -r;
  return r;
}
template <class T>
inline void putnum(T x) {
  if (x < 0) putchar('-'), x = -x;
  register short a[20] = {}, sz = 0;
  while (x > 0) a[sz++] = x % 10, x /= 10;
  if (sz == 0) putchar('0');
  for (int i = sz - 1; i >= 0; i--) putchar('0' + a[i]);
}
inline void putsp() { putchar(' '); }
inline void putendl() { putchar('\n'); }
inline char mygetchar() {
  register char c = getchar();
  while (c == ' ' || c == '\n') c = getchar();
  return c;
}
int n, xa, ya, xb, yb;
int x[2111], y[2111];
pair<long long, long long> t[2111];
long long mx[2111];
int main() {
  n = getnum();
  xa = getnum(), ya = getnum();
  xb = getnum(), yb = getnum();
  for (int i = 1; i <= n; i++) {
    x[i] = getnum(), y[i] = getnum();
    t[i].first =
        1ll * (x[i] - xa) * (x[i] - xa) + 1ll * (y[i] - ya) * (y[i] - ya);
    t[i].second =
        1ll * (x[i] - xb) * (x[i] - xb) + 1ll * (y[i] - yb) * (y[i] - yb);
  }
  sort(t + 1, t + n + 1);
  for (int i = n; i >= 1; i--) mx[i] = max(mx[i + 1], t[i].second);
  long long tmx = 0;
  long long ans = mx[1];
  for (int i = 1; i <= n; i++) {
    tmx = max(tmx, t[i].first);
    ans = min(ans, tmx + mx[i + 1]);
  }
  cout << ans << endl;
  return 0;
}
