#include<bits/stdc++.h>
#define lowbit(x) x&(-x)
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double LD;
typedef pair<ll,ll> pll;
typedef pair<int,int> pii;

const ll MOD=1e9+7;
const ll INF=0x3f3f3f3f3f3f3f3f;
const LD eps=1e-14;

inline ll read()
{
	ll ans=0, f=1;
	char c=getchar();
	while(c<'0'||c>'9')
	{
		if(c=='-') f=-1;
		c=getchar();
	}
	while(c>='0'&&c<='9') ans=ans*10+c-'0', c=getchar();
	return ans*f;
}

const int N=5050;

ll n;
vector<string> ve;
map<string,bool> mp;

bool vis[N];

void solve()
{
	n=read();
	string s;
	for(int i=1;i<=n;i++)
	{
		cin>>s;
		reverse(s.begin(),s.end());
		ve.push_back(s);
	}
	
	sort(ve.begin(),ve.end());
	
//	for(int i=0;i<n;i++) cout<<ve[i]<<endl;
	
	s=""; mp[""]=1;
	priority_queue<pair<int,pii>, vector<pair<int,pii> >, less<pair<int,pii> > > pr;
	
	for(int i=0;i<n-1;i++)
	{
		s="";
		for(int k=0;k<min(ve[i].size(),ve[i+1].size());k++)
		{
			if(ve[i][k]==ve[i+1][k])  s+=ve[i][k];
			else break;
		}
		pr.push(make_pair(s.size(),make_pair(i,i+1)));
	}
	
	set<int> se;
	for(int i=0;i<n;i++) se.insert(i);
	se.insert(-1), se.insert(114514);
	
	int a,b;
	int c,d;
	int ans=0;
	while(!pr.empty())
	{
		a=pr.top().second.first;
		b=pr.top().second.second;
		pr.pop();
		if(vis[a]||vis[b]) continue;
		
		s="";
		for(int k=0;k<min(ve[a].size(),ve[b].size());k++)
		{
			if(ve[a][k]==ve[b][k])  s+=ve[a][k];
			else break;
		}
		
		bool flag=0;
		for(int i=s.size();i;i--)
		{
			if(mp[s.substr(0,i)]==0)
			{
				flag=1;
				ans+=2;
				vis[a]=vis[b]=1;
				c=*(--se.find(a)), d=*(++se.find(b));
				se.erase(a), se.erase(b);
				mp[s.substr(0,i)]=1;
				
				break;
			}
		}
		
		if(flag)
		{
			if(c!=-1&&d!=114514)
			{
				s="";
				for(int k=0;k<min(ve[c].size(),ve[d].size());k++)
				{
					if(ve[c][k]==ve[d][k])  s+=ve[c][k];
					else break;
				}
				pr.push(make_pair(s.size(),make_pair(c,d)));
			}
		}
	}
	
	cout<<ans;
	
	return ;
}

int main()
{
//	freopen("ex_data4.in","r",stdin);
	solve();
	
	return 0;
}