Longest Spanning Substrings

You are given $N$ strings $S_1, S_2, \ldots, S_N$. Consider a complete undirected graph with $N$ vertices (numbered $1$ through $N$), in which the weight of an edge between vertices $u$ and $v$ is equal to the length of the longest common substring of $S_u$ and $S_v$. Find the maximum possible weight of a spanning tree of this graph. ### Input - The first line of the input contains a single inte