/*
TASK:abc
LANG:C++
*/

#include <stdio.h>
#include <math.h>
#include <string.h>
#include <stdlib.h>

int sort_function1( const void *a, const void *b)
{
   return( strcmp((char *)a,(char *)b) );
}
int main()
{
    int n,i,j;
    unsigned long br = 1;
    double sum = 0;
    char in[1024][22]={0,0};
    scanf("%d",&n);
    for(i = 0;i < n;i++)
    {
          scanf("%s",&in[i]);
    }
    qsort((void *)in, n, sizeof(in[0]), sort_function1);
    if(in[0][0] == 'A')
    {
                 for(j = 0;in[j][0] == 'A';j=i)
                 {
                       i = j+1;
                       while(strncmp(in[j],in[i],strlen(in[j])) == 0 && i < n)
                       {
                        in[i][0] = 'Q';
                        i++;
                       }
                 }
    }
    if(j < n && in[j][0] == 'B')
    {
                for(;in[j][0] == 'B';j=i)
                 {
                       i = j+1;
                       while(strncmp(in[j],in[i],strlen(in[j])) == 0 && i < n)
                       {
                        in[i][0] = 'Q';
                        i++;
                       }
                 }
    }
    if(j < n && in[j][0] == 'C')
    {
                  for(;in[j][0] == 'C';j=i)
                 {
                       i = j+1;
                       while(strncmp(in[j],in[i],strlen(in[j])) == 0 && i < n)
                       {
                        in[i][0] = 'Q';
                        i++;
                       }
                 }
    }
    
    if(j < n && in[j][0] == 'O')
    {
                  for(;in[j][0] == 'O';j=i)
                 {
                       i = j+1;
                       while(strncmp(in[j],in[i],strlen(in[j])) == 0 && i < n)
                       {
                        in[i][0] = 'Q';
                        i++;
                       }
                 }
    }
      for(i = 0;i < n;i++)
      {
            if(in[i][0] == 'Q')
            {
                        continue;
            }
            sum += 1.0/(pow(4,strlen(in[i])));
      }
      while(sum - floor(sum) > 0)
      {
                  sum*=2;
                  br*=2;
      }
      printf("%.0lf %u\n",sum,br);
    return 0;
}
