#include <bits/stdc++.h>
namespace // my guiding star
{
#define filein(x) freopen(x".in", "r", stdin);
#define fileout(x) freopen(x, "w", stdout);
#define fileerr(x) freopen(x, "w", stderr);
#define file(x) freopen(x".in", "r", stdin), freopen(x".out", "w", stdout);
#define files(x) freopen(x".in", "r", stdin), freopen(x".ans", "w", stdout);
using namespace std;
#define cT const T&
template<typename T>
inline T chkmin(T& x, cT y){if (x > y) x = y; return x;}
template<typename T>
inline T chkmax(T& x, cT y){if (x < y) x = y; return x;}
template <typename T>
inline bool inrange(cT x, cT l, cT r){return (l <= x) && (x <= r);}
template <typename T>
inline bool inrange(cT l, cT r, cT L, cT R){return (L <= l) && (r <= R);}
#undef cT
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
typedef long double ldb;
typedef unsigned u32;
template <typename T>
using pr = pair<T, T>;
typedef pr<int> pii;
typedef pr<ll> pll;
typedef pr<db> pdd; 
typedef complex<double> cp;
typedef vector<int> vi;
inline void YN(bool x){puts(x ? "Yes" : "No");}
}
const int N = 2010;
int n;
bitset<N> Y[N], B[N];
string s;
int main()
{
	scanf("%d", &n);
	for (int i=1; i<=n; i++)
	{
		cin >> s;
		for (int j=1; j<=n; j++)
		{
			if (s[j - 1] == 'Y') Y[i][j] = 1;
			if (s[j - 1] == 'B') B[i][j] = 1;
		}
	}
	ll P = 0, Q = 0;
	for (int i=1; i<=n; i++)
		for (int j=i+1; j<=n; j++)
		{
			P += 1ll * (Y[i] & B[j]).count() * (Y[j] & B[i]).count();
			if (B[i][j]){int S = (Y[i] & Y[j]).count(); Q += 1ll * S * (S - 1) / 2;}
			if (Y[i][j]){int S = (B[i] & B[j]).count(); Q += 1ll * S * (S - 1) / 2;}

		}
	printf("%lld\n", P / 2 - Q);
	return 0;
}