#include <bits/stdc++.h>
using namespace std;
#define task "main"
#define F first
#define S second
#define ii pair<int, int>
#define il pair<int, long long>
#define li pair<long long, int>
#define FOR(i, a, b) for(int i = (a); i <= (b); ++i)
#define FOD(i, b, a) for(int i = (b); i >= (a); --i)
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
int n;
string word[3003];
int dp[3003];
void solve() {
cin >> n;
FOR(i, 1, n) cin >> word[i], reverse(word[i].begin(), word[i].end());
assert(n <= 3000);
int maxx = 0;
FOR(i, 1, n) maximize(maxx, (int)word[i].size());
assert(maxx <= 3000);
FOR(i, 1, n) {
dp[i] = 1;
FOR(j, 1, i - 1) {
int len = min((int)word[i].size(), (int)word[j].size());
FOR(k, 0, min((int)word[i].size(), (int)word[j].size()) - 1) if (word[i][k] != word[j][k]) {
len = k;
break;
}
if (len >= max((int)word[i].size(), (int)word[j].size()) - 1) maximize(dp[i], dp[j] + 1);
}
}
cout << *max_element(dp + 1, dp + n + 1);
}
int32_t main() {
if (fopen(task".inp", "r")) {
freopen(task".inp", "r", stdin);
freopen(task".ans", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0); cout.tie(0);
bool multitest = 0;
int numTest = 1;
if (multitest) cin >> numTest;
while (numTest--) {
solve();
}
return 0;
}
/* Lak lu theo dieu nhac!!!! */
