Contests | Virtual Contests | Problems | Submit | Runs Status | Rank List | Forum |

Time Limit: 5.0 Seconds Memory Limit: 65536K

Total Runs: 197 Accepted Runs: 42 Multiple test files

An *edit step* is a transformation from one word *x* to another
word *y* such that *x* and *y* are words in the dictionary,
and *x* can be
transformed to *y* by adding, deleting, or changing one letter.
So the transformation from *dig* to *dog* or from
*dog* to *do* are both edit steps. An *edit step ladder*
is a lexicographically ordered sequence of words
*w*_{1}, w_{2}, ... w_{n}
such that the transformation from *w*_{i} to *w*_{i+1}
is an edit step for all *i* from 1 to *n-1*.
### Sample Input

### Output for Sample Input

For a given dictionary, you are to compute the length of the longest edit step ladder. The input to your program consists of the dictionary - a set of lower case words in lexicographic order - one per line. No word exceeds 16 letters and there are no more than 25000 words in the dictionary. The output consists of a single integer, the number of words in the longest edit step ladder.

cat dig dog fig fin fine fog log wine

5

Maintance:G.D.Retop. Developer: SuperHacker, G.D.Retop