/** gnu specific **/
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
/** contains everything I need in std **/
#include <bits/stdc++.h>

#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define sz(S) ((int)S.size())
#define FOR(i, st_, n) for(int i = st_; i < n; ++i)
#define RFOR(i, n, end_) for(int i = (n)-1; i >= end_; --i)
#define x first
#define y second
#define pb push_back
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
typedef pair<double, double> pdd;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ull, ull> pull;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
using namespace std;
#ifdef ONPC
mt19937 rnd(228);
#else
mt19937 rnd(chrono::high_resolution_clock::now().time_since_epoch().count());
#endif


int32_t main()
{
    ios::sync_with_stdio(0);
    cin.tie(0);
    string s;
    vector<ll> ar(26);
    getline( cin, s );
    ll cc = 0;
    FOR(i,0,sz(s))
    {
        if(s[i] >= 'a' && s[i] <= 'z')
            s[i] += 'A' - 'a';
        if(s[i] >= 'A' && s[i] <= 'Z'){
            ar[s[i]-'A']++;
            cc++;
        }
    }
    sort(rall(ar));
    vector<ll> arr = {1,3,3,5,5,5,7,7,7,7,7,9,9,9,9,9,9,9,9,11,11,11,11,11,11,11,11,11,11};
    pll a;
    a.x = 1;
    a.y = 3;
    ll res=0;
    FOR(i,0,26)
    {
        res += ar[i] * arr[i];
    }
    res += (cc-1) * 3;
    cout << res;
}