#include <bits/stdc++.h>
using namespace std;
template <class T>
T sqr(T x) {
  return x * x;
}
template <class T>
T gcd(T a, T b) {
  return (b != 0 ? gcd<T>(b, a % b) : a);
}
template <class T>
T lcm(T a, T b) {
  return (a / gcd<T>(a, b) * b);
}
template <class T>
inline T bigmod(T p, T e, T M) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigmod(p, e / 2, M);
    return (T)((t * t) % M);
  }
  return (T)((long long int)bigmod(p, e - 1, M) * (long long int)p) % M;
}
template <class T>
inline T bigexp(T p, T e) {
  if (e == 0) return 1;
  if (e % 2 == 0) {
    long long int t = bigexp(p, e / 2);
    return (T)((t * t));
  }
  return (T)((long long int)bigexp(p, e - 1) * (long long int)p);
}
template <class T>
inline T modinverse(T a, T M) {
  return bigmod(a, M - 2, M);
}
int dx4[] = {1, 0, -1, 0};
int dy4[] = {0, 1, 0, -1};
int dx8[] = {1, 1, 0, -1, -1, -1, 0, 1};
int dy8[] = {0, 1, 1, 1, 0, -1, -1, -1};
int month[] = {31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31};
int n;
long long int x, y, x2, y2, a[2005][2], d[2005][3], mx1, mx2, res, res1, mx3,
    mx4;
long long int d1(long long int i, long long int j) {
  i = i - x;
  i *= i;
  j = j - y;
  j *= j;
  return i + j;
}
long long int d2(long long int i, long long int j) {
  i = i - x2;
  i *= i;
  j = j - y2;
  j *= j;
  return i + j;
}
int main() {
  scanf("%d", &n);
  scanf("%I64d %I64d %I64d %I64d", &x, &y, &x2, &y2);
  for (int i = 1; i <= n; i++) {
    scanf("%I64d %I64d", &a[i][0], &a[i][1]);
  }
  for (int i = 1; i <= n; i++) {
    d[i][1] = d1(a[i][0], a[i][1]);
    d[i][2] = d2(a[i][0], a[i][1]);
  }
  res = 100000000000000000;
  res1 = 100000000000000000;
  for (int i = 1; i <= n; i++) {
    mx1 = d[i][1];
    mx2 = 0;
    mx3 = 0;
    mx4 = d[i][2];
    for (int j = 1; j <= n; j++) {
      if (d[j][1] > mx1) {
        if (d[j][2] > mx2) mx2 = d[j][2];
      }
      if (d[j][2] > mx4) {
        if (d[j][1] > mx3) mx3 = d[j][1];
      }
    }
    res = min(res, mx1 + mx2);
    res1 = min(res1, mx3 + mx4);
  }
  printf("%I64d", min(res, res1));
  return 0;
}
