#include<iostream>
#include<cstdio>
#include<cstring>
#include<string>
#include<algorithm>
#include<cstdlib>
#include<iomanip>
#define maxn 1000010
using namespace std;
typedef long long ll;
typedef unsigned long wf;
typedef unsigned int u32;
typedef unsigned long long u64;
ll x1,y1,x2,y2;
ll n,r1=0,r2=0;
ll k[maxn][2];
ll d1(int x,int y,int z){
    return k[z][0]=(x-x1)*(x-x1)+(y-y1)*(y-y1);
}
ll d2(int x,int y,int z){
    return k[z][1]=(x-x2)*(x-x2)+(y-y2)*(y-y2);
}
int main(){
    scanf("%lld%lld%lld%lld",&x1,&y1,&x2,&y2);
    cin>>n;
    for(int i=1;i<=n;i++){
        int a,b;
        scanf("%d%d",&a,&b);
        d1(a,b,i);
        d2(a,b,i);
    }
    for(int i=1;i<=n;i++){
        if(k[i][0]<=r1||k[i][1]<=r2) continue;
        if(k[i][0]-r1<=k[i][1]-r2) r1=max(r1,k[i][0]);
        else r2=max(r2,k[i][1]);
    }
    printf("%lld",r1+r2);
    return 0;
}