#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
const int M=2020;
int n;
char s[M][M];
bitset<M> bl[M],ye[M];
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);

	n=read();
	F(i,1,n){
		scanf("%s",s[i]+1);
		F(j,1,i-1){
			if (s[i][j]=='Y'){
				ye[i][j]=ye[j][i]=1;
			}
			else{
				bl[i][j]=bl[j][i]=1;
			}
		}
	}
	LL a1=0,a2=0;
	F(i,1,n){
		F(j,i+1,n){
			int num;
			if (ye[i][j]){
				num=(bl[i]&bl[j]).count();
			}
			else num=(ye[i]&ye[j]).count();
			a1+=num*(num-1)/2;
			a2+=(ye[i]&bl[j]).count()*(bl[i]&ye[j]).count();
		}
	}
//	cout<<a1<<" "<<a2<<"\n";
	cout<<a2/2-a1<<"\n";
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/