You are given a group of n strings: s 1 , s 2 , ..., s n . You should find a subgroup s i 1 , s i 2 , ..., s i k (1 ≤ i 1 < i 2 < ... < i k ≤ n ) of the group. The following two conditions must hold: there exists a string t such, that each string from found subgroup is its suffix; the number of strings in the found subgroup is as large as possible. Your task is to print the number of strings in the found subgroup. The first line contains an integer n (1 ≤ n ≤ 10 5 ) — the number of strings in the group. Each of the next n lines contains a string. The i -th line contains non-empty string s i . Each string consists only from lowercase Latin letters. The sum of all strings s i doesn't exceed 10 5 . Output a single integer — the number of strings in the found subgroup. Look at the test sample. The required subgroup is s 1 , s 2 , s 3 .