1
//能按照树构建的顺序计算出ans的确没想到
2
//string类不存在访问到边界以外的位置导致内存错误
3
#include <bits/stdc++.h>
4
#define endl '\n'
5
using namespace std;
6
typedef long long ll;
7
int main(){
8
    string str;
9
    while(getline(cin,str)&&str!="END"){
10
        sort(str.begin(),str.end());
11
        priority_queue<ll,vector<ll>,greater<ll>> pq;
12
        ll num=1;
13
        for(ll i=1;i<=str.size();i++){
14
            if(str[i]!=str[i-1]){
15
                pq.push(num);
16
                num=1;
17
            }else num++;
18
        }
19
        ll ans=0;
20
        if(pq.size()==1)ans=str.size();
21
        while(pq.size()>1){
22
            ll a=pq.top();
23
            pq.pop();
24
            ll b=pq.top();
25
            pq.pop();
26
            ans+=a+b;
27
            pq.push(a+b);
28
        }
29
        printf("%lld %lld %.1lf\n",str.size()*8,ans,double(str.size())*8/ans);
30
    }
31
    return 0;
32
}