0pts

#include <bits/stdc++.h>
#define double long double
using namespace std;
double n,x1,x2,y6,y2,p[10],q[10],r[10],ans,xm,ym,xn,yin;
bool vis[10];
double s(int k){
	return k*k*3.1415926;
}
double dis(double x3,double y3,
		   double x4,double y4){
	return sqrt((x3-x4)*(x3-x4)+
		        (y3-y4)*(y3-y4));
}
double f(double x,double y,int k){
	double res=0x3f3f3f3f;
	for(int i=1;i<=n;i++){
		if(vis[i]&&i!=k){
			if(dis(x,y,p[i],q[i])-r[i]<0){
				res=0;
				break;
			}
			res=min(res,dis(x,y,p[i],q[i])-r[i]);
		}
	}
	return res;
}
void dfs(int u,double w){
	if(u>n){
		ans=max(w,ans);
	}	
	for(int i=u;i<=n;i++){
		if(!vis[i]){
			vis[i]=1;
			r[i]=min(min(p[i]-xn,xm-p[i]),min(q[i]-yin,ym-q[i]));
			r[i]=min(r[i],f(p[i],q[i],i));
			dfs(i,w+s(r[i]));
			vis[i]=0;
			r[i]=0;
		}
	}
}
int main(){
	cin>>n>>x1>>y6>>x2>>y2;
	xm=max(x1,x2);
	xn=min(x1,x2);
	yin=min(y6,y2);
	ym=max(y6,y2);
	for(int i=1;i<=n;i++){
		cin>>p[i]>>q[i];
	}
	dfs(1,0);
	double s1=abs((x1-x2)*(y6-y2));
	cout<<(int)(s1-ans);
}