Repetition

Input

The first line contains a positive integer $N$ (1 \leq N \leq 5) — the number of words. Each of the following $N$ lines contains one word made up of lowercase Latin letters. Each word has length at least $1$ and at most $2000$.

Output

Output a single integer — the length of the longest word that appears as a substring in each of the input words.

Examples