#include<bits/stdc++.h>
using namespace std;
long long x,xx,y,yy,n;
long long f[100001],g[100001],max0,max1;
int main(){
	cin>>x>>y>>xx>>yy;
	cin>>n;
	for(int i=1;i<=n;i++){
		int a,b;
		cin>>a>>b;
		f[i]=(a-x)*(a-x)+(b-y)*(b-y);
		g[i]=(a-xx)*(a-xx)+(b-yy)*(b-yy);
		if(max0>=f[i]||max1>=g[i]) continue;
		if(f[i]-max0>g[i]-max1){
			max1=max(max1,g[i]);
		}else{
			max0=max(max0,f[i]);
		}
	}
	cout<<max1+max0;
}