Description

Many databases store the data in the character fields (and especially indices) using prefix compression. This technique compresses a sequence of strings A1, ..., A

_N

by the following method: if there are strings Ai = a

_i,1

a

_i,2

...a

_i,p

and A

_{i + 1}

= a

_i+1,1

a

_i+1,2

...a

_i+1,q

such that for some j ≤ min(p, q) a_i,1

= a

_i+1,1

, a

_i,2

= a

_i+1,2

, ... a

_i,j

= a

_i+1,j

, then the second string is stored as [j]a

_i+1,j+1

a

_i+1,j+2

... a

_i+1,q

, where [j] is a single character with code j.

If j = 0, that is, strings do not have any common prefix, then the second string is prefixed with zero byte, and so the total length actually increases.

Constraints

1 ≤ N ≤ 10000, 1 ≤ length(Ai) ≤ 255.

Input

First line of input contains integer number N, with following N lines containing strings A1 ... A

_N

Output

Output must contain a single integer -- minimal total length of compressed strings.

3
abc
atest
atext

11

Source

Northeastern Europe 2003

, Far-Eastern Subregion