#!/usr/bin/env python3
paths = sorted([input().split('/')[1:] for i in range(int(input()))])
total,low,upp,i,n = sum(map(len,paths)),0,len(paths),-1,len(paths)
while len(paths[upp-1])>(i := i+1) and not all(len(path)==i+1 for path in paths[low:upp]):
    while len(paths[low]) <= i or 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: total -= d
print(total)