import java.io.*; import java.util.*; import java.util.function.*; import java.util.stream.*; public class Main { static List list; static int[][] dp; public static void main(String[] args) throws Exception { Scanner sc = new Scanner(); int n = sc.nextInt(); list = IntStream.range(0, n).mapToObj(i -> new MyWord(sc.next())).sorted().toList(); dp = new int[n][26]; for (int[] arr : dp) { Arrays.fill(arr, -1); } System.out.println(dfw(n - 1, 25)); } static int dfw(int idx, int v) { if (idx < 0) { return 0; } if (dp[idx][v] < 0) { if (v < list.get(idx).right) { dp[idx][v] = dfw(idx - 1, v); } else { dp[idx][v] = Math.max(dfw(idx - 1, v), dfw(idx - 1, list.get(idx).left) + list.get(idx).value); } } return dp[idx][v]; } static class MyWord implements Comparable { int left; int right; int value; public MyWord(int left, int right, int value) { this.left = left; this.right = right; this.value = value; } public MyWord(String s) { this(s.charAt(0) - 'a', s.charAt(s.length() - 1) - 'a', isGood(s) ? s.length() : 0); } public int compareTo(MyWord another) { if (right == another.right) { return left - another.left; } else { return right - another.right; } } private static boolean isGood(String s) { return IntStream.range(0, s.length() - 1).allMatch(i -> s.charAt(i) <= s.charAt(i + 1)); } } } class Scanner { BufferedReader br; StringTokenizer st = new StringTokenizer(""); StringBuilder sb = new StringBuilder(); public Scanner() { try { br = new BufferedReader(new InputStreamReader(System.in)); } catch (Exception e) { } } public int nextInt() { return Integer.parseInt(next()); } public long nextLong() { return Long.parseLong(next()); } public double nextDouble() { return Double.parseDouble(next()); } public String next() { try { while (!st.hasMoreTokens()) { st = new StringTokenizer(br.readLine()); } } catch (Exception e) { e.printStackTrace(); } finally { return st.nextToken(); } } }