#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
using namespace std;
string A[100001];
int main(){
	freopen("trie.in","r",stdin);
	freopen("trie.out","w",stdout);
	int a=0,ans;
	while(cin.eof()==0){
	a++;
	cin>>A[a];
	}
	sort(A+1,A+a+1);
	for(int i=1;i<=a;i++){
	if(i==1)
	ans=A[1].length();
	else {
		int n=0;
	for(int j=0;j<A[i].length()&&j<A[i-1].length();j++){
		if(A[i][j]==A[i-1][j])
	n++;
	else break;}
	ans+=A[i].length()-n;
	}
	}
	cout<<ans+1<<endl;
return 0;
}