# Arup Guha
# 4/11/2025
# Solution to COP 4516 Team Contest Problem: Squirrel Territory

import math

# Returns the distance between pt1 and pt2, assumes both are in the same
# number of dimensions.
def dist(pt1, pt2):
    sumsq = 0
    for i in range(len(pt1)):
        sumsq += (pt1[i]-pt2[i])*(pt1[i]-pt2[i])
    return sumsq**.5

# Process cases.
nC = int(input())
for loop in range(1, nC+1):

    # Get case.
    n = int(input())
    pts = []
    for i in range(n):
        tmp = [int(x) for x in input().split()]
        pts.append(tmp)

    # This is good enough.
    maxDiameter = 20000

    # Try all pairs. The distance between centers is the maximum diameter
    # we could have...
    for i in range(n):
        for j in range(i+1, n):
            maxDiameter = min(maxDiameter, dist(pts[i], pts[j]))
            
    # This is our best radius, use it to get the max area.
    radius = maxDiameter/2
    area = math.pi*radius*radius
    
    # Output accordingly
    print("Campus #",loop,": ",sep="")
    print("Maximum territory area = ", end="")
    print("{:.3f}".format(area))
    print()