#include<bits/stdc++.h>
#define ll long long
using namespace std;
int n;
char c[2010];
bitset<2010>a[2010],b[2010];
int main(){
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%s",c+1);
		for(int j=1;j<=n;j++)if(i!=j){
			if(c[j]=='Y')a[i][j]=1;
			else b[i][j]=1;
		}
	}
	ll s1=0,s2=0;
	for(int i=1;i<n;i++)for(int j=i+1;j<=n;j++){
		int ne=0;
		if(a[i][j])ne=(b[i]&b[j]).count();
		else ne=(a[i]&a[j]).count();
		s1+=ne*(ne-1)/2;
		s2+=(a[i]&b[j]).count()*(a[j]&b[i]).count();
	}
	return printf("%lld",s2/2-s1),0;
}