N = int(eval(input()))



coordinates = []

for i in range(N):

    x, y = list(map(int, input().split()))

    coordinates.append((x, y))



import itertools

paths = list(itertools.permutations(list(range(N))))



total_length = 0

for i in paths:

    for j in range(N - 1):

        x1, y1 = coordinates[i[j]]

        x2, y2 = coordinates[i[j + 1]]

        total_length += ((x1 - x2)**2 + (y1 - y2)**2)**0.5



average_length = total_length / len(paths)

print(average_length)

n = int(eval(input()))



C = []

for _ in range(n):

    x, y = list(map(int, input().split()))

    C.append((x, y))



l = 0

for i in range(n - 1):

    for j in range(i + 1, n):

        xi, yi = C[i][0], C[i][1]

        xj, yj = C[j][0], C[j][1]

        l += ((xi - xj)**2 + (yi - yj)**2)**0.5



print(((2 * l) / n))

N = int(eval(input()))
coordinates = []
for i in range(N):
    x, y = list(map(int, input().split()))
    coordinates.append((x, y))
import itertools

paths = list(itertools.permutations(list(range(N))))
total_length = 0
for i in paths:
    for j in range(N - 1):
        x1, y1 = coordinates[i[j]]
        x2, y2 = coordinates[i[j + 1]]
        total_length += ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5
average_length = total_length / len(paths)
print(average_length)

n = int(eval(input()))
C = []
for _ in range(n):
    x, y = list(map(int, input().split()))
    C.append((x, y))
l = 0
for i in range(n - 1):
    for j in range(i + 1, n):
        xi, yi = C[i][0], C[i][1]
        xj, yj = C[j][0], C[j][1]
        l += ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5
print(((2 * l) / n))

-N = int(eval(input())) -coordinates = [] -for i in range(N): +n = int(eval(input())) +C = [] +for _ in range(n): -    coordinates.append((x, y)) -import itertools - -paths = list(itertools.permutations(list(range(N)))) -total_length = 0 -for i in paths: -    for j in range(N - 1): -        x1, y1 = coordinates[i[j]] -        x2, y2 = coordinates[i[j + 1]] -        total_length += ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5 -average_length = total_length / len(paths) -print(average_length) +    C.append((x, y)) +l = 0 +for i in range(n - 1): +    for j in range(i + 1, n): +        xi, yi = C[i][0], C[i][1] +        xj, yj = C[j][0], C[j][1] +        l += ((xi - xj) ** 2 + (yi - yj) ** 2) ** 0.5 +print(((2 * l) / n))