# include <bits/stdc++.h>
using namespace std;
typedef long long ll;
char s[4010][4010];
bitset<4001> G[4010];
int du[4010];
ll C2(ll n){return n*(n-1)/2;}
ll C3(ll n){return n*(n-1)*(n-2)/6;}
int main()
{
	int n,m=0;
	ll ans=0;
	cin>>n;
	for(int i=1;i<=n;i++) scanf("%s",s[i]+1);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)
			if(s[i][j]=='Y') G[i][j]=1,du[i]++,m++;
	m/=2;ans=2*C2(m)-m*C2(n-2);
	for(int i=1;i<=n;i++) ans+=2*C2(du[i])*(n-4)-3*C3(du[i]);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=n;j++)if(G[i][j])
		{
			int t=(G[i]&G[j]).count();
			if(i<j) ans-=t*(n-3);
			ans+=t*(du[i]-2)-(du[i]-1)*(du[j]-1)+t;
		}
	cout<<ans<<endl;
	return 0;
}