#include<bits/stdc++.h>
using std::cin;
using std::cout;
using ll = long long;
using u64 = unsigned long long;
using db = long double;
const db eps = 1e-6;

struct vec3 {
	db x, y, z;
	db norm() const { return x * x + y * y + z * z; }
	db abs() const { return std::sqrt(norm()); }
};
vec3 operator + (vec3 x, vec3 y) { return {x.x + y.x, x.y + y.y, x.z + y.z}; }
vec3 operator - (vec3 x, vec3 y) { return {x.x - y.x, x.y - y.y, x.z - y.z}; }
vec3 operator * (vec3 x, db y) { return {x.x * y, x.y * y, x.z * y}; }
vec3 operator / (vec3 x, db y) { return {x.x / y, x.y / y, x.z / y}; }
vec3 operator * (vec3 x, vec3 y) { // 三维叉积需要更高的精度
	return {
		x.y * y.z - x.z * y.y,
		x.z * y.x - x.x * y.z,
		x.x * y.y - x.y * y.x
	};
}
db operator % (vec3 x, vec3 y) { return x.x * y.x + x.y * y.y + x.z * y.z; }
db area(vec3 a, vec3 b, vec3 c) { return ((b - a) * (c - a)).abs(); } // 三角形面积两倍
db volume(vec3 d, vec3 a, vec3 b, vec3 c) { // 四面体有向体积六倍
	return (d - a) % ((b - a) * (c - a));
}
struct plane { 
	vec3 n; db d; // n dot x = d
	plane() {}
	plane(vec3 a, vec3 b, vec3 c) : n((c - a) * (b - a)) {
		d = n % a;
	}
	db side(vec3 x) const { return n % x - d; }
	db dist(vec3 w) const { return side(w) / n.abs(); }
	vec3 proj(vec3 w) const { return w - n * (side(w) / n.abs()); }
};
const int N = 2005;
struct face { int a[3]; plane p; };
int vis[N][N];
std::vector<face> f;
void convex3d(const std::vector<vec3> & a) { // need clear vis maybe
											 // need to deal coplane 
	if(a.size() < 3) return ;
	auto getface = [&](int i, int j, int k) -> face { return {{i, j, k}, plane(a[i], a[j], a[k])}; };
	f = {getface(0, 1, 2), getface(0, 2, 1)};
	std::vector<face> tmp[2];
	for(int i = 3;i < (int) a.size();++i) {
		for(auto x : f) {
			if(x.p.dist(a[i]) < -eps) {
				tmp -> push_back(x);
			} else {
				tmp[1].push_back(x);
				for(int t : {0, 1, 2}) vis[x.a[t]][x.a[(t + 1) % 3]] = i;
			}
		}
		for(auto x : tmp[1]) {
			for(int t : {0, 1, 2}) {
				if(vis[x.a[t]][x.a[(t + 1) % 3]] == i && vis[x.a[(t + 1) % 3]][x.a[t]] != i)
					tmp[0].push_back(getface(x.a[t], x.a[(t + 1) % 3], i));
			}
		}
		f = tmp[0]; tmp[0].clear(); tmp[1].clear();
	}
	for(int i = 0;i < (int)a.size();++i) memset(vis[i], 0, a.size() << 2);
}
struct vec2 {
	db x, y;
	db norm() const { return x * x + y * y; }
	db abs() const { return std::sqrt(x * x + y * y); }
	db arg() const { return atan2(y, x); }
};
vec2 operator + (vec2 x, vec2 y) { return {x.x + y.x, x.y + y.y}; }
vec2 operator - (vec2 x, vec2 y) { return {x.x - y.x, x.y - y.y}; }
vec2 operator / (vec2 x, db y) { return {x.x / y, x.y / y}; }
vec2 operator * (vec2 x, db y) { return {x.x * y, x.y * y}; }
vec2 operator * (db y, vec2 x) { return {x.x * y, x.y * y}; }
db operator * (vec2 x, vec2 y) { return x.x * y.y - x.y * y.x; }
db operator % (vec2 x, vec2 y) { return x.x * y.x + x.y * y.y; }
vec2 r90(vec2 x) { return {-x.y, x.x}; }


struct circle : vec2 { db r; };
circle incircle(vec2 a, vec2 b, vec2 c) {
	db A = (b - c).abs(), B = (c - a).abs(), C = (a - b).abs();
	return {(a * A + b * B + c * C) / (A + B + C), fabs((b - a) * (c - a)) / (A + B + C)};
} // 三点确定内心，不是最小圆覆盖内容
circle circumcenter(vec2 a, vec2 b, vec2 c) { 
	vec2 bc = c - b, ca = a - c, ab = b - a;
	vec2 o = (b + c - r90(bc) * (ca % ab) / (ca * ab)) / 2;
	return {o, (a - o).abs()};
}// 三点确定外心
circle cir(vec2 a, vec2 b) { // 根据直径生成圆
	return {(a + b) / 2, (a - b).abs() / 2};
}
bool in(circle x, vec2 y) { return (vec2(x) - y).abs() <= x.r + eps; }
circle mincircle(std::vector<vec2> a) { // 最小圆覆盖，需要 shuffle
	circle o = {a[0], 0};
	int n = a.size();
	for(int i = 1;i < n;++i) {
		if(in(o, a[i])) continue;
		o = cir(a[0], a[i]);
		for(int j = 1;j < i;++j) {
			if(in(o, a[j])) continue;
			o = cir(a[j], a[i]);
			for(int k = 0;k < j;++k) {
				if(in(o, a[k])) continue;
				o = circumcenter(a[i], a[j], a[k]);
			}
		}
	}
	return o;
}

vec3 perpvec(vec3 x) {
	return fabs(x.x) > fabs(x.z) ? vec3{ x.y, -x.x, 0 } : vec3{0, -x.z, x.y};
}
int main() {
#ifdef zqj
	freopen("$.in", "r", stdin);
#endif
	std::ios::sync_with_stdio(false), cin.tie(0);
	int n;
	cin >> n;
	std::vector<vec3> a(n);
	for(auto & [x, y, z] : a) {
		cin >> x >> y >> z;
	}
	convex3d(a);
	db ans = 1e18;
	const db pi = std::acos(-1);
	for(auto x : f) {
		db h = 0;
		std::vector<vec2> b(n);
		vec3 A = x.p.n, B = perpvec(A), C = A * B;
		B = B / B.abs();
		C = C / C.abs();
		for(int i = 0;i < n;++i) {
			h = std::max(h, -x.p.dist(a[i]));
			b[i] = vec2{a[i] % B, a[i] % C};
		}
		static std::mt19937 gen(20040430);
		shuffle(b.begin(), b.end(), gen);
		auto c = mincircle(b);
		ans = std::min(ans, h * c.r * c.r * pi);
	}
	printf("%.10Lf\n", ans);
}