#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int n;
bitset<2000>Y[2000],B[2000];
char s[2000];
ll C2(int x){
	return x*(x-1ll)/2;
}
int main(){
	scanf("%d",&n);
	for(int i=0;i<n;i++){
		scanf("%s",s);
		for(int j=0;j<n;j++){
			if(i^j) (s[j]=='Y'?Y:B)[i].set(j);
		}
	}
	ll AC=0,YC=0;
	for(int i=0;i<n;i++) for(int j=i+1;j<n;j++){
		if(Y[i][j]) AC+=C2((B[i]&B[j]).count());
		else AC+=C2((Y[i]&Y[j]).count());
		YC+=1ll*(Y[i]&B[j]).count()*(Y[j]&B[i]).count();
	} 
	cout<<YC/2-AC<<"\n";
}