#include<bits/stdc++.h>
using namespace std;
char ch[2001][2001];
int b[2001],y[2001],cnt1[2001][2001],cnt2[2001][2001];
bitset<2001>B[2001],Y[2001];
int main(){
	int n;
	scanf("%d",&n);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
		{
			cin>>ch[i][j];
			if(ch[i][j]=='B')
				b[i]++,B[i][j]=1;
			if(ch[i][j]=='Y')
				y[i]++,Y[i][j]=1;
		}
	long long c1=0,c2=0,c3=0,c4=0;
	c1=n*(n-1ll)*(n-2ll)*(n-3ll)/24;
	for(int i=1;i<=n;i++)
		c2+=2ll*b[i]*y[i];
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			char col=ch[i][j];
			int secB=(B[i]&B[j]).count(),secY=(Y[i]&Y[j]).count();
			if(col=='B')
				cnt1[i][j]=secB,cnt2[i][j]=secY;
			else
				cnt1[i][j]=secY,cnt2[i][j]=secB;
		}
	for(int i=1;i<=n;i++)
		for(int j=i+1;j<=n;j++)
		{
			c3+=2*cnt1[i][j]*(cnt1[i][j]-1ll);
			c4+=2*cnt2[i][j]*(cnt2[i][j]-1ll);
		}
	c2=c2*(n-3)/4;c3/=4;c4/=4;
	long long ans=-3*c1+c2+(c3-c4)/2;
	printf("%lld\n",ans);
	
	return 0;
}