#include<bits/stdc++.h>
#define fo(i,l,r) for(int i=(l);i<=(r);++i)
#define ll long long
using namespace std;
const int N=2003;
int n;ll c1,c2,c3,c4;
char s[N][N];
bitset<N>s1[N],s2[N];
int main()
{
	scanf("%d",&n);
	fo(i,1,n)
	{
		scanf("%s",s[i]+1);
		fo(j,1,n) if(i!=j)
		{
			if(s[i][j]=='B') s1[i][j]=1;
			else s2[i][j]=1;
		}
	}
	c1=1ll*n*(n-1)*(n-2)*(n-3)/24;
	fo(i,1,n)
	{
		int Y=0,B=0;
		fo(j,1,n) if(i!=j)
		{
			int u=(s1[i]&s1[j]).count(),v=(s2[i]&s2[j]).count();
			if(s[i][j]=='B') B++,c3+=u*(u-1),c4+=v*(v-1);
			else Y++,c4+=u*(u-1),c3+=v*(v-1);
		}
		c2+=2ll*(n-3)*Y*B;
	}
	printf("%lld",-3*c1+c2/4+(c3-c4)/8);
}