//Слава Україні, Героям слава

#include <bits/stdc++.h>

using namespace std;

template <int ALPHA_SIZE = 62>
struct Aho {
    struct Node {
        int p, char_p, link = -1, str_idx = -1, nxt[ALPHA_SIZE];
        bool has_end = false;
        Node(int _p = -1, int _char_p = -1) : p(_p), char_p(_char_p) {
            fill(nxt, nxt + ALPHA_SIZE, -1);
        }
    };

    vector<Node> nodes = { Node() };
    int ans, cnt = 0;
    bool build_done = false;
    vector<pair<int, int>> rep;
    vector<int> ord, occur, occur_aux;

    // change this if different alphabet
    int remap(char c) {
        if (islower(c)) return c - 'a';
        if (isalpha(c)) return c - 'A' + 26;
        return c - '0' + 52;
    }

    void add(string& p, int id = -1) {
        int u = 0;
        if (id == -1) id = cnt++;

        for (char ch : p) {
            int c = remap(ch);
            if (nodes[u].nxt[c] == -1) {
                nodes[u].nxt[c] = (int)nodes.size();
                nodes.push_back(Node(u, c));
            }

            u = nodes[u].nxt[c];
        }

        if (nodes[u].str_idx != -1) rep.push_back({ id, nodes[u].str_idx });
        else nodes[u].str_idx = id;
        nodes[u].has_end = true;
    }

    void build() {
        build_done = true;
        queue<int> q;

        for (int i = 0; i < ALPHA_SIZE; i++) {
            if (nodes[0].nxt[i] != -1) q.push(nodes[0].nxt[i]);
            else nodes[0].nxt[i] = 0;
        }

        while (q.size()) {
            int u = q.front();
            ord.push_back(u);
            q.pop();

            int j = nodes[nodes[u].p].link;
            if (j == -1) nodes[u].link = 0;
            else nodes[u].link = nodes[j].nxt[nodes[u].char_p];

            nodes[u].has_end |= nodes[nodes[u].link].has_end;

            for (int i = 0; i < ALPHA_SIZE; i++) {
                if (nodes[u].nxt[i] != -1) q.push(nodes[u].nxt[i]);
                else nodes[u].nxt[i] = nodes[nodes[u].link].nxt[i];
            }
        }
    }

    int match(string& s) {
        if (!cnt) return 0;
        if (!build_done) build();

        ans = 0;
        occur = vector<int>(cnt);
        occur_aux = vector<int>(nodes.size());

        int u = 0;
        for (char ch : s) {
            int c = remap(ch);
            u = nodes[u].nxt[c];
            occur_aux[u]++;
        }

        for (int i = (int)ord.size() - 1; i >= 0; i--) {
            int v = ord[i];
            int fv = nodes[v].link;
            occur_aux[fv] += occur_aux[v];
            if (nodes[v].str_idx != -1) {
                occur[nodes[v].str_idx] = occur_aux[v];
                ans += occur_aux[v];
            }
        }

        for (pair<int, int> x : rep) occur[x.first] = occur[x.second];
        return ans;
    }
};

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    int n;
    while(cin >> n) {
        if(!n) break;
        vector<string> v(n);
        vector<vector<int>> adj(n);
        vector<int> in(n), topo, dist(n, 1);
        Aho<26> aho;
        for(int i = 0; i < n; i++) {
            cin >> v[i];
            aho.add(v[i]);
        }
        aho.build();
        for(int i = 0; i < n; i++) {
            aho.match(v[i]);
            for(int j = 0; j < n; j++) {
                if(i != j and aho.occur[j]) {
                    adj[j].push_back(i);
                    in[i]++;
                }
            }
        }
        queue<int> q;
        for(int i = 0; i < n; i++) {
            if(!in[i]) {
                q.push(i);
            }
            if(!adj[i].size()) dist[i] = 1;
        }
        while(!q.empty()) {
            int x = q.front(); q.pop();
            topo.push_back(x);
            for(auto e : adj[x]) {
                if(in[e] > 0 and --in[e] == 0) {
                    q.push(e);
                }
            }
        }
        reverse(topo.begin(), topo.end());
        for(auto e : topo) {
            for(auto i : adj[e]) {
                dist[e] = max(dist[e], dist[i] + 1);
            }
        }
        cout << *max_element(dist.begin(), dist.end()) << "\n";
    }
    return 0;
}