#include<bits/stdc++.h>

using namespace std;

#define fi first

#define se second

#define mp make_pair

#define pi pair<int,int>

#define int long long

pi a[(<<)+];

int ans,wh[],n,m,sum[],cnt1,mx;

char s[];

inline void dfs1(int p,int lim,int now,int tot){

    if(p>lim){

      a[++cnt1]=mp(now,tot);

      return;

    }

    dfs1(p+,lim,now^wh[p],tot+);

    dfs1(p+,lim,now,tot);

    return;

}

inline void dfs2(int p,int lim,int now,int tot){

    if(p>lim){

      pi *le=lower_bound(a+,a+cnt1+,mp(now,-1ll));

      pi *ri=lower_bound(a+,a+cnt1+,mp(now+,-1ll));

      ans+=(ri-le);

      ri--;

      if((ri->fi)==now)mx=max(mx,(ri->se)+tot);

      return;

    }

    dfs2(p+,lim,now^wh[p],tot+);

    dfs2(p+,lim,now,tot);

    return;

}

signed main(){

    int i,j,k;

    scanf("%lld",&n);

    for(i=;i<=n;i++){

      memset(sum,,sizeof(sum));

      scanf("%s",s);

      m=strlen(s);

      for(j=;j<m;j++)sum[s[j]-'a']^=;

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

        wh[i]|=((<<j)*sum[j]);

    }

    dfs1(,n/,,);

    sort(a+,a+cnt1+);

    dfs2(n/+,n,,);

    printf("%lld %lld\n",ans-1ll,mx);

    return ;

}