#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")
#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define pf push_front
#define N 2000050
#define M ll(1e9 + 7)
#define inf 1e9 + 1e9
using namespace std;
using namespace __gnu_pbds;
typedef long double ld;
typedef long long ll;
typedef unsigned long long ull;
typedef short int si;
typedef array <ll, 3> a3;
typedef array <ll, 4> a4;
//typedef tree <ll, null_type, less_equal<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
gp_hash_table <int, int> mp;
ll pw[N];
ll mult(ll x, ll y) {return (x * y) % M;}
ll sm(ll x, ll y) {return (x + y) % M;}
int main()
{
//freopen("input.txt", "r", stdin); //freopen("output4.txt", "w", stdout);
ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);
pw[0] = 1;
for (register int i = 1; i < N; i++) pw[i] = mult(pw[i - 1], 31);
int n;
cin >> n;
int ans = 0;
for (int i = 0; i < n; i++)
{
string s;
cin >> s;
deque <char> l, r; l.clear(); r.clear();
int val = 1;
int hsh = 0;
for (int j = 0; j < sz(s); j++)
{
l.pb(s[j]);
r.pf(s[sz(s) - j - 1]);
hsh = sm(hsh, mult(s[j] - 'A', pw[j]));
if (l == r) val = max(val, mp[hsh] + 1);
}
mp[hsh] = val;
ans = max(ans, val);
}
cout << ans << endl;
}
