#include #define REP_(i, a_, b_, a, b, ...) \ for (int i = (a), END_##i = (b); i < END_##i; ++i) #define REP(i, ...) REP_(i, __VA_ARGS__, __VA_ARGS__, 0, __VA_ARGS__) #define ALL(x) std::begin(x), std::end(x) using i64 = long long; template inline bool chmax(T &a, U b) { return a < b and ((a = std::move(b)), true); } template inline bool chmin(T &a, U b) { return a > b and ((a = std::move(b)), true); } template inline int ssize(const T &a) { return (int)std::size(a); } template std::istream &operator>>(std::istream &is, std::vector &a) { for (auto &x : a) is >> x; return is; } template std::ostream &operator<<(std::ostream &os, const std::pair &a) { return os << "(" << a.first << ", " << a.second << ")"; } template std::ostream &print_seq(const Container &a, std::string_view sep = " ", std::string_view ends = "\n", std::ostream &os = std::cout) { auto b = std::begin(a), e = std::end(a); for (auto it = std::begin(a); it != e; ++it) { if (it != b) os << sep; os << *it; } return os << ends; } template struct is_iterable : std::false_type {}; template struct is_iterable())), decltype(std::end(std::declval()))>> : std::true_type {}; template ::value && !std::is_same::value && !std::is_same::value>> std::ostream &operator<<(std::ostream &os, const T &a) { return print_seq(a, ", ", "", (os << "{")) << "}"; } #ifdef ENABLE_DEBUG #include "debug_dump.hpp" #else #define DUMP(...) #endif using namespace std; auto solve() { int n; cin >> n; vector s(n); REP(i, n) cin >> s[i]; sort(ALL(s)); auto dp = vector(2, vector(26, 0)); REP(i, n) { dp[1] = dp[0]; if (not std::is_sorted(ALL(s[i]))) continue; DUMP(i, s[i]); int ch1 = s[i].front() - 'a'; int ch2 = s[i].back() - 'a'; DUMP(ch1, ch2); for (int j = 0; j <= ch1; ++j) { chmax(dp[1][ch2], dp[0][j] + ssize(s[i])); } swap(dp[0], dp[1]); DUMP(dp[0]); } return *max_element(ALL(dp[0])); } int main() { ios_base::sync_with_stdio(false), cin.tie(nullptr); cout << solve() << "\n"; }