시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 128 MB 5 1 1 20.000%

문제

Many databases store the data in the character fields (and especially indices) using prefix compression. This technique compresses a sequence of strings A1, ..., AN by the following method: if there are strings Ai = ai,1ai,2...ai,p and Ai + 1 = ai+1,1ai+1,2...ai+1,q such that for some j ≤ min(p, q) ai,1 = ai+1,1, ai,2 = ai+1,2, ... ai,j = ai+1,j, then the second string is stored as [j]ai+1,j+1ai+1,j+2... ai+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. 

입력

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

출력

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

제한

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

예제 입력 1

3
abc
atest
atext

예제 출력 1

11

예제 입력 2

2
test
notest

예제 출력 2

11