Gene and Gina have a particular kind of farm. Instead of growing animals and vegetables, as it is usually the case in regular farms, they grow strings. A string is a sequence of characters. Strings have the particularity that, as they grow, they add characters to the left and/or to the right of themselves, but they never lose characters, nor insert new characters in the middle. Gene and Gina have a collection of photos of some strings at different times during their growth. The problem is that the collection is not annotated, so they forgot to which string each photo belongs to. They want to put together a wall to illustrate strings growing procedures, but they need your help to find an appropriate sequence of photos. Each photo illustrates a string. The sequence of photos must be such that if \textbf{s_i} comes immediately before \textbf{s_\{i+1\}} in the sequence, then \textbf{s_\{i+1\}} is a string that may have grown from \textbf{s_i} (i.e., \textbf{s_i} appears as a consecutive substring of \textbf{s_\{i+1\}}). Also, they do not want to use repeated pictures, so all strings in the sequence must be different. Given a set of strings representing all available photos, your job is to calculate the size of the largest sequence they can produce following the guidelines above. \InputFile Each test case is given using several lines. The first line contains an integer \textbf{N} representing the number of strings in the set (\textbf{1} ≤ \textbf{N} ≤ \textbf{10^4}). Each of the following \textbf{N} lines contains a different non-empty string of at most \textbf{1000} lowercase letters of the English alphabet. Within each test case, the sum of the lengths of all strings is at most \textbf{10^6}. The last test case is followed by a line containing one zero. \OutputFile For each test case output a single line with a single integer representing the size of the largest sequence of photos that can be produced.