

N = int(eval(input()))

xy = []

for i in range(N):

    xy.append(list(map(int,input().split())))



from itertools import permutations

a = list(range(N))

Ps = list(permutations(a))

#print('Ps', Ps)



keiro = []

for P in Ps:

    #print('P', P)

    for i in range(N-1):

        keiro.append( ((xy[P[i]][0] - xy[P[i+1]][0])**2 + (xy[P[i]][1] - xy[P[i+1]][1])**2 )**0.5 )

out=sum(keiro)/len(Ps)

#print('keiro', keiro)

print(out)
N = int(eval(input()))

xy = []

for i in range(N):

    xy.append(list(map(int,input().split())))



from itertools import permutations

a=list(range(1,N+1))

ps = list(permutations(a))

#print(ps)



dammy=0

for p in ps:

    #print('p:',p)

    for j in range(1,N):

        dammy += ((xy[p[j-1]-1][0] - xy[p[j]-1][0])**2 + (xy[p[j-1]-1][1] - xy[p[j]-1][1])**2) ** (1/2)

        #print(dammy)

print((dammy/len(ps)))



N = int(eval(input()))
xy = []
for i in range(N):
    xy.append(list(map(int, input().split())))
from itertools import permutations

a = list(range(N))
Ps = list(permutations(a))
# print('Ps', Ps)
keiro = []
for P in Ps:
    # print('P', P)
    for i in range(N - 1):
        keiro.append(
            (
                (xy[P[i]][0] - xy[P[i + 1]][0]) ** 2
                + (xy[P[i]][1] - xy[P[i + 1]][1]) ** 2
            )
            ** 0.5
        )
out = sum(keiro) / len(Ps)
# print('keiro', keiro)
print(out)

N = int(eval(input()))
xy = []
for i in range(N):
    xy.append(list(map(int, input().split())))
from itertools import permutations

a = list(range(1, N + 1))
ps = list(permutations(a))
# print(ps)
dammy = 0
for p in ps:
    # print('p:',p)
    for j in range(1, N):
        dammy += (
            (xy[p[j - 1] - 1][0] - xy[p[j] - 1][0]) ** 2
            + (xy[p[j - 1] - 1][1] - xy[p[j] - 1][1]) ** 2
        ) ** (1 / 2)
        # print(dammy)
print((dammy / len(ps)))

-a = list(range(N)) -Ps = list(permutations(a)) -# print('Ps', Ps) -keiro = [] -for P in Ps: -    # print('P', P) -    for i in range(N - 1): -        keiro.append( -            ( -                (xy[P[i]][0] - xy[P[i + 1]][0]) ** 2 -                + (xy[P[i]][1] - xy[P[i + 1]][1]) ** 2 -            ) -            ** 0.5 -        ) -out = sum(keiro) / len(Ps) -# print('keiro', keiro) -print(out) +a = list(range(1, N + 1)) +ps = list(permutations(a)) +# print(ps) +dammy = 0 +for p in ps: +    # print('p:',p) +    for j in range(1, N): +        dammy += ( +            (xy[p[j - 1] - 1][0] - xy[p[j] - 1][0]) ** 2 +            + (xy[p[j - 1] - 1][1] - xy[p[j] - 1][1]) ** 2 +        ) ** (1 / 2) +        # print(dammy) +print((dammy / len(ps)))