#include<bits/stdc++.h>
using namespace std;
const int N = 10;
const double p = 3.1415926535;
int n;
double maxn, x[N], y[N], sx, sy, bx, by, r[N];
bool vis[N];
double check (int j) {
	double ans = min(min(fabs(x[j] - sx), fabs(x[j] - bx)), min(fabs(y[j] - sy), fabs(y[j] - by)));
	for (int i = 1; i <= n; i++) {
		if (vis[i]) {
			ans = min(ans, max(0.00, sqrt(abs(x[i] - x[j]) * abs(x[i] - x[j]) + abs(y[i] - y[j]) * abs(y[i] - y[j])) - r[j]));
		}
	}
	return ans;
}
void dfs (int x, double sum) {
	if (x == n + 1) {
		maxn = max(maxn, sum);
		return;
	}
	for (int i = 1; i <= n; i++) {
		if (!vis[i]) {
			r[i] = check(i);
			vis[i] = true;
			dfs(x + 1, sum + r[i] * r[i] * p);
			vis[i] = false;
		}
	}
}
int main () {
	cin >> n >> sx >> sy >> bx >> by;
	for (int i = 1; i <= n; i++) cin >> x[i] >> y[i];
	dfs(1, 0);
	cout << (int)(fabs(sx - bx) * fabs(sy - by) - maxn + 0.5);
	return 0;
}