import java.util.Scanner;
import java.util.List;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Collections;
import java.util.Comparator;

public class No1512 {
	
	private static class MyComparator implements Comparator<String> {
		@Override
		public int compare(String s1, String s2) {
			if (s1.charAt(0) < s2.charAt(0)) {
				return -1;
			} else if (s1.charAt(0) > s2.charAt(0)) {
				return 1;
			} else {
				return s1.charAt(s1.length()-1) - s2.charAt(s2.length()-1);
			}
		}
	}

	public static void main(String[] args) {
		Scanner scan = new Scanner(System.in);
		int N = scan.nextInt();
		List<String> S = new ArrayList<String>();
		for (int i=0; i < N; i++) {
			String s = scan.next();
			boolean reverse = false;
			char prev = 0;
			for (int j=0; j < s.length(); j++) {
				char c = s.charAt(j);
				if (prev > c) {
					reverse = true;
					break;
				}
				prev = c;
			}
			if (!reverse) {
				S.add(s);
			}
		}
		scan.close();
		Collections.sort(S, new MyComparator());
		int[][] DP = new int[S.size()+1][26];
		for (int i=0; i < S.size(); i++) {
			String s = S.get(i);
			int e = s.charAt(s.length()-1) - 'a';
			int n = DP[i][s.charAt(0) - 'a'] + s.length();
			for (int j = 0; j < e; j++) {
				DP[i+1][j] = DP[i][j];
			}
			for (int j=e; j < 26; j++) {
				DP[i+1][j] = Math.max(DP[i][j], n);
			}
		}
		System.out.println(DP[S.size()][25]);
	}

}