//霍夫曼编码问题
#include<iostream>
#include<string>
#include<algorithm>
#include<cstdio>
using namespace std;
int al[27],i,cnt;
string s;
int main(void){
while(cin>>s){
if(s=="END")break;
cnt=0;
for(i=0;i<27;i++)
al[i]=0;
for(i=0;i<s.size();i++){
if(s[i]>='A'&&s[i]<='Z')
al[(int)(s[i]-'A')]++;
else al[26]++;
}
sort(al,al+27);
for(i=0;i<=26&&al[i]==0;i++);
if(i==26)cnt+=al[i];
while(i<26){
cnt+=al[i+1]=al[i]+al[i+1];
al[i]=0;
i++;
sort(al+i,al+27);
}
cout<<s.size()*8<<" "<<cnt<<" ";
printf("%.1f\n",8.0*s.size()/cnt);
}
return 0;
}