ソースコード
#include<iostream>
#include<cstdio>
#include<cmath>
#include<cstring>
#include<string>
#include<stack>
#include<queue>
#include<vector>
#include<algorithm>
#include <iomanip>
typedef long long int ll;
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define REP(i,n) for (int i=0;i<(n);i++)
#define EREP(i,n) for (int i=1;i<=(n);i++)
//#define EVEL 1
#define KETA 2
#ifndef EVEL
#define DEB(X) cout << #X << ":" <<std::setw(KETA) << std::setfill('0')<<X<<" " ;
#define TF(f) f ? cout<<"true " : cout<<"false ";
#define END cout<<"\n";
#else
#define DEB(X) {X;}
#define TF(f) {f;}
#define END {}
#endif
const int MOD = 1000000007;
const int INF = 1000000;
ll N,ans=0,sum=0;
string S;
ll f,s;
int main(){
cin>>N;
REP(i,N){
cin>>S;
if(S.size()==5)f++;
else s++;
}
//fC2*sC1;
cout<<s*f*(f-1);
return 0;
}