Super String

For a set of $n$ strings in array $A$, find the shortest string that has each string in $A$ as its substring. A string $p$ is a substring of string $q$ if any contiguous set of characters of $q$ match $p$. In this case, $q$ is called a superstring of $p$. ###Input Format The first line of input is an integer $n$, the number of strings to input. The next $n$ lines are the $n$ input substrin