#include using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return std::vector(arg, init); else return std::vector(arg, vec(init, args...)); } template auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template > T &chmin(T &l, T r, Compare &&f = less()) { return l = min(l, r, f); } template > T &chmax(T &l, T r, Compare &&f = less()) { return l = max(l, r, f); } int main() { int n; cin >> n; auto ctoi = [](char c) { return c - 'a' + 1; }; auto s = vec>(uns, 0); while (n--) { string v; cin >> v; if (is_sorted(begin(v), end(v))) { s.push_back({ ctoi(v.front()), ctoi(v.back()), size(v) }); } } sort(begin(s), end(s), [](auto x, auto y) { return make_tuple(get<1>(x), get<0>(x)) < make_tuple(get<1>(y), get<0>(y)); }); auto dp = vec(0, size(s) + 1, ctoi('z') + 1); dp[0][0] = 0; for (int i = 1; i <= size(s); ++i) { auto [f, b, l] = s[i - 1]; for (int j = 0; j <= ctoi('z'); ++j) { dp[i][j] = dp[i - 1][j]; if (b <= j) { chmax(dp[i][j], dp[i - 1][f] + l); } } } cout << dp[size(s)][ctoi('z')] << endl; }