#include <stdio.h>

 #include <string.h>

 #include <iostream>

 #include <string>

 #include <algorithm>

 #include <vector>

 #include <map>

 using namespace std;

 const int N=;

 int vis[N];

 vector<string>v[N];

 map<string,int>mp;

 struct node

 {

     int Size;

     int num;

     friend bool operator < (node a,node b)

     {

         if (a.Size == b.Size)

         {

             return v[a.num][] < v[b.num][];

         }

         return a.Size > b.Size;

     }

 } G[N];

 int main()

 {

     string s[N],s2[N];

     char ss[N];

     int  i = ;

     mp.clear();

     while(scanf("%s",ss)!=EOF)

     {

         if(ss[]=='')

             break;

         mp[ss]++;

         if(mp[ss]==)

         {

             s[i] = ss;

             sort(ss,ss+strlen(ss));

             s2[i++] = ss;

         }

     }

     int n = i;

     int p = ;

     memset(vis,,sizeof(vis));

     for (int j = ; j < n; j++)

     {

         if (vis[j])

             continue;

         int Size = ;

         for (int k = j; k < n; k++)

         {

             if (s2[j]==s2[k])

             {

                 vis[k] = ;

                 v[p].push_back(s[k]);

                 if(mp[s[k]]>)

                     Size+=mp[s[k]]-;

             }

         }

         G[p].Size = v[p].size()+Size;

         G[p].num = p;

         sort(v[p].begin(),v[p].end());

         p++;

     }

     sort(G,G+p);

     if (p > )

         p = ;

     for (int j = ; j < p; j++)

     {

         printf("Group of size %d:",G[j].Size);

         for (int k = ; k < v[G[j].num].size(); k++)

         {

             cout<<" "<<v[G[j].num][k];

         }

         printf(" .\n");

     }

     return ;

 }