// ---------- begin input macro ----------
// reference: https://qiita.com/tanakh/items/0ba42c7ca36cd29d0ac8
macro_rules! input {
    (source = $s:expr, $($r:tt)*) => {
        let mut iter = $s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
    ($($r:tt)*) => {
        let s = {
            use std::io::Read;
            let mut s = String::new();
            std::io::stdin().read_to_string(&mut s).unwrap();
            s
        };
        let mut iter = s.split_whitespace();
        input_inner!{iter, $($r)*}
    };
}

macro_rules! input_inner {
    ($iter:expr) => {};
    ($iter:expr, ) => {};
    ($iter:expr, $var:ident : $t:tt $($r:tt)*) => {
        let $var = read_value!($iter, $t);
        input_inner!{$iter $($r)*}
    };
}

macro_rules! read_value {
    ($iter:expr, ( $($t:tt),* )) => {
        ( $(read_value!($iter, $t)),* )
    };
    ($iter:expr, [ $t:tt ; $len:expr ]) => {
        (0..$len).map(|_| read_value!($iter, $t)).collect::<Vec<_>>()
    };
    ($iter:expr, chars) => {
        read_value!($iter, String).chars().collect::<Vec<char>>()
    };
    ($iter:expr, bytes) => {
        read_value!($iter, String).bytes().collect::<Vec<u8>>()
    };
    ($iter:expr, usize1) => {
        read_value!($iter, usize) - 1
    };
    ($iter:expr, $t:ty) => {
        $iter.next().unwrap().parse::<$t>().expect("Parse error")
    };
}
// ---------- end input macro ----------

fn run() {
    input! {
        n: usize,
        s: [bytes; n],
    }
    let m = 26;
    let inf = 1000000i32;
    let mut add = vec![0; m];
    let mut g = vec![vec![-inf; m]; m];
    for i in 1..m {
        g[i - 1][i] = 0;
    }
    for s in s {
        let m = s.len();
        if s.windows(2).all(|s| s[0] <= s[1]) {
            let a = (s[0] - b'a') as usize;
            let b = (s[m - 1] - b'a') as usize;
            if a == b {
                add[a] += m as i32;
            } else {
                g[a][b] = g[a][b].max(m as i32);
            }
        }
    }
    let mut dp = vec![0; m];
    for i in 0..m {
        dp[i] += add[i];
        for j in (i + 1)..m {
            dp[j] = dp[j].max(dp[i] + g[i][j]);
        }
    }
    println!("{}", dp[m - 1]);
}

fn main() {
    run();
}