// XD XD
#include <bits/stdc++.h>
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define el cout << "\n";
using namespace std;
using ll = long long;
const int MAXN = 16;
const int MOD = 1e9 + 7;
const int INF = 1e9 + 7;
const ll LLINF = 1e18 + 7;
template <typename T>
bool ckmin(T& a, T b) {
return a > b ? a = b, true : false;
}
template <typename T>
bool ckmax(T& a, T b) {
return a < b ? a = b, true : false;
}
int n;
int cnt[MAXN][26];
int dp[1 << MAXN];
void solve(int id) {
// cout << "Case " << id << ": ";
cin >> n;
memset(dp, 0x3f, sizeof dp);
for (int i = 0; i < n; i++) {
string s;
cin >> s;
for (char x : s) {
cnt[i][x - 'a']++;
}
dp[1 << i] = s.size();
}
dp[0] = 0;
for (int mask = 1; mask < (1 << n); mask++) {
int tot = 0;
for (int i = 0; i < 26; i++) {
int mn = INF;
for (int j = 0; j < n; j++) {
if (mask >> j & 1) {
ckmin(mn, cnt[j][i]);
}
}
tot += mn;
}
for (int sub = (mask - 1) & mask; sub; sub = (sub - 1) & mask) {
ckmin(dp[mask], dp[sub] + dp[mask ^ sub] - tot);
}
}
cout << dp[(1 << n) - 1] + 1 << "\n";
}
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int T = 1;
// cin >> T;
for (int i = 1; i <= T; i++) {
solve(i);
}
return 0;
}
