#!/usr/bin/env python3
n = int(input())
paths = sorted([input().split('/')[1:] for i in range(n)])
total = sum(map(len,paths))
low, upp, i = 0,n,0
while len(paths[upp-1])>i:
    while len(paths[low]) <= i: low += 1
    while paths[n//2][i] != paths[low][i]: low += 1
    while paths[n//2][i] != paths[upp-1][i]: upp -= 1
    if (d := 2*(upp-low) - n) <= 0: break
    total -= d
    i += 1
print(total)