#include<bits/stdc++.h>
using namespace std;
char s[10005];
int mp[2005][2005];
bitset<2005>bs[2005];
int main()
{
	int n;
	cin>>n;
	for(int i=1;i<=n;i++)
	{
		scanf("%s",s+1);
		for(int j=1;j<=n;j++)
		{
			if(s[j]=='Y')mp[i][j]=1;
			else mp[i][j]=0;
			bs[i][j]=mp[i][j];
		}
	}
	long long C1=0,C2=0,C3=0,C4=0;
	C1=1ll*n*(n-1)*(n-2)*(n-3)/24;
	for(int i=1;i<=n;i++)
	{
		int a1=0,a2=0;
		for(int j=1;j<=n;j++)if(i!=j)
		{
			if(!mp[i][j])a1++;
			else a2++;
		}
		C2+=1ll*a1*a2;
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i<j)
	{
		if(mp[i][j])
		{
			bitset<2005>sb=bs[i]&bs[j];
			sb[i]=sb[j]=0;
			int tt=sb.count();
			C3+=1ll*tt*(tt-1)/2;
		}else
		{
			bitset<2005>sb=bs[i]|bs[j];
			sb[i]=sb[j]=1;
			int tt=n-sb.count();
			C3+=1ll*tt*(tt-1)/2;
		}
	}
	for(int i=1;i<=n;i++)for(int j=1;j<=n;j++)if(i<j)
	{
		if(!mp[i][j])
		{
			bitset<2005>sb=bs[i]&bs[j];
			sb[i]=sb[j]=0;
			int tt=sb.count();
			C4+=1ll*tt*(tt-1)/2;
		}else
		{
			bitset<2005>sb=bs[i]|bs[j];
			sb[i]=sb[j]=1;
			int tt=n-sb.count();
			C4+=1ll*tt*(tt-1)/2;
		}
	}
	cout<<(n-3)*C2/2-3*C1+(C3-C4)/2<<endl;
	return 0;
}