#include <iostream>

 #include <string>

 #include <queue>

 #include <cstdio>

 using namespace std;

 class node{

 public:

     int key; //a,b,c...

     int count;//频率

     int p;//父亲结点

     friend bool operator < (const node &a, const node &b)

     {

         if(b.count < a.count)

             return true;

         else

             return false;

     }

 };

 int value(char c)

 {

     if(c=='_')

         return ;

     else

         return(c-'A');

 }

 int main()

 {

     string str;

     cin >> str;

     while(str!="END")

     {

         node c[];

         for(int i=;i<;i++)

         {

             c[i].key=i;

             c[i].count=;

         }

         int length=str.length();

         priority_queue<node> q;

         for(int i=;i<length;i++)

         {

             (c[value(str.at(i))]).count++;

         }

         for(int i=;i<=;i++)

         {

             if(c[i].count!=)

                 q.push(c[i]);

         }

         if(q.size()==)

         {

             printf("%d %d 8.0\n",*length,length);

         }

         else

         {

             int high=;

             int n=;

             while(q.size()>)

             {

                 node s1=q.top();

                 q.pop();

                 node s2=q.top();

                 q.pop();

                 c[n].count=s1.count+s2.count;

                 c[s1.key].p=n;

                 c[s2.key].p=n;

                 high=high+c[n].count;

                 q.push(c[n]);

                 n++;

             }

             printf("%d %d %.1lf\n",*length,high,(((double)(*length))/((double)high)));

         }

         cin >> str;

     }

 }