/*=========================================*
  * Auther: Riolu
  * Page: 
  * PID:
  * Time: 2016.
  * ©Copyright 2016 Riolu. All Rights Reserved.
  *=========================================*/
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
int i,j,n,t,k;
string a[32768];
string s;
int main()
{
	freopen("trie.in","r",stdin);
	freopen("trie.out","w",stdout);
	while(cin>>a[++n]);n--;
	sort(a+1,a+1+n);
	t=a[1].length();
	for(i=2;i<=n;i++)
	{
		j=0;
		while(a[i][j]==a[i-1][j]&&j<a[i-1].length()) j++;
		t+=a[i].length()-j;
		}
	cout<<t+1<<endl;
	return 0;
}