#include<cstdio>

#include<algorithm>

#include<cstring>

#include<iostream>

#define LL long long

// #define int long long

using namespace std;

const int MAXN = , INF = 1e9 + , mod = ;

inline int read() {

    char c = getchar(); int x = , f = ;

    while(c < '' || c > '') {if(c == '-') f = -; c = getchar();}

    while(c >= '' && c <= '') x = x *  + c - '', c = getchar();

    return x * f;

}

int N;

string s[MAXN];

int f[MAXN];

bool suf(string a, string b) {

    int cur = ;

    for(int i = ; i < a.length(); i++) {

        if(a[i] != b[cur]) return ;

        cur++;

    }

    return ;

}

main() {

    cin >> N;

    for(int i = ; i <= N; i++) cin >> s[i];

    int ans = ;

    for(int i = ; i <= N; i++) {

        f[i] = ;

        for(int j = ; j < i; j++) {

            if(suf(s[j], s[i])) f[i] = max(f[i], f[j] + );

        }

        ans = max(ans, f[i]);

    }

    printf("%d", ans);

    return ;

}

/*

*/