#include <bits/stdc++.h>
using namespace std;

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;

const int K = 26;

int solve()
{
	string str;
	string s = "";
	while ((cin >> str))
	{
		//cerr << "-_-\n";
		for (char ch: str)
		{
			if (ch >= 'A' && ch <= 'Z')
			{
				s += ch;
			}
			else if (ch >= 'a' && ch <= 'z')
			{
				s += (ch - 'a' + 'A');
			}
		}
	}
		
	//cerr << "s = " << s << '\n';	
	
	int n = sz(s);
	vector<int> cnt(K);
	FOR (i, 0, n)
		cnt[s[i] - 'A']++;
	
	vector<int> ord(K);
	iota(all(ord), 0);
	sort(all(ord), [&](int l, int r) -> bool
	{
		return cnt[l] > cnt[r];
	});
	
	vector<int> wei;
	FOR (len, 1, 8)
	{
		FOR (i, 0, 1 << len)
		{
			int cost = 0;
			FOR (j, 0, len)
			{
				if (i & 1 << j)
				{
					cost++;
				}
				else
				{
					cost += 3;
				}
			}
			cost += len - 1;
			wei.pb(cost);
		}
	}
	
	sort(all(wei));
	ll ans = 3 * (n - 1);
	FOR (i, 0, K)
	{
		//cerr << "wei = " << wei[i] << ' ' << "cnt = " << cnt[ord[i]] << '\n';
		ans += wei[i] * cnt[ord[i]];
	}
	cout << ans << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1;
	//cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}