Arcady is a copywriter. His today's task is to type up an already well-designed story using his favorite text editor. Arcady types words, punctuation signs and spaces one after another. Each letter and each sign (including line feed) requires one keyboard click in order to be printed. Moreover, when Arcady has a non-empty prefix of some word on the screen, the editor proposes a possible autocompletion for this word, more precisely one of the already printed words such that its prefix matches the currently printed prefix if this word is unique. For example, if Arcady has already printed « codeforces », « coding » and « codeforces » once again, then there will be no autocompletion attempt for « cod », but if he proceeds with « code », the editor will propose « codeforces ». With a single click Arcady can follow the editor's proposal, i.e. to transform the current prefix to it. Note that no additional symbols are printed after the autocompletion (no spaces, line feeds, etc). What is the minimum number of keyboard clicks Arcady has to perform to print the entire text, if he is not allowed to move the cursor or erase the already printed symbols? A word here is a contiguous sequence of latin letters bordered by spaces, punctuation signs and line/text beginnings/ends. Arcady uses only lowercase letters. For example, there are 20 words in « it's well-known that tic-tac-toe is a paper-and-pencil game for two players, x and o. ». The only line contains Arcady's text, consisting only of lowercase latin letters, spaces, line feeds and the following punctuation signs: « . », « , », « ? », « ! », « ' » and « - ». The total amount of symbols doesn't exceed 3·10 5 . It's guaranteed that all lines are non-empty. Print a single integer — the minimum number of clicks. In sample case one it's optimal to use autocompletion for the first instance of « snowboarding » after typing up « sn » and for the second instance of « snowboarding » after typing up « snowb ». This will save