#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int N = 2000;
int n, d[N];
LL ans, res;
char s[N+5];
bitset<N> G[N];
LL C2(int x){return x * (x-1ll) >> 1;}
int main(){
	scanf("%d", &n);
	for(int i = 0;i < n;++ i){
		scanf("%s", s);
		for(int j = 0;j < n;++ j)
			if(s[j] == 'Y'){G[i].set(j); ++ d[i];}
		ans += d[i] * (n - d[i] - 1ll);
	}
	ans *= n - 3; ans >>= 1;
	ans -= n * (n-1ll) * (n-2ll) * (n-3ll) / 8;
	for(int i = 0;i < n;++ i)
		for(int j = i+1;j < n;++ j){
			int tmp = (G[i] & G[j]).count();
			if(G[i][j]) res += C2(tmp) - C2(n + tmp - d[i] - d[j]);
			else res += C2(n + tmp - 2 - d[i] - d[j]) - C2(tmp);
		}
	ans += res >> 1;
	printf("%lld\n", ans);
}