// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
template <typename T> inline void read(T &x) {
	x = 0; int f = 1; char c = getchar();
	for (; !isdigit(c); c = getchar()) if (c == '-') f = -f;
	for (; isdigit(c); c = getchar()) x = (x << 1) + (x << 3) + (c ^ 48);
	x *= f;
}
const int N = 2010;
int n;
ll ans;
string st[N];
bitset <N> y[N], b[N];//, yy[N], bb[N];
signed main() {
	read(n);
	F(i, 1, n) {
		cin >> st[i];
		st[i] = ' ' + st[i];
		F(j, 1, n) {
			if (st[i][j] == '-') continue;
			if (st[i][j] == 'Y') y[i][j] = true;
			else b[i][j] = true;//, debug << i << " " << j << endl;
		}
	}
	// int s = 0;
	// F(a, 1, n)
	// 	F(b, a + 1, n)
	// 		F(c, b + 1, n)
	// 			F(d, c + 1, n) {
	// 			}
	// F(i, 1, n) {
	// 	yy[i] = y[i];
	// 	yy[i].flip();
	// 	bb[i] = b[i];
	// 	bb[i].flip();
	// }
	F(i, 1, n)
		F(j, i + 1, n) if (st[i][j] == 'B') {
			bitset <N> w1 = b[i] & y[j];
			bitset <N> w2 = y[i] & b[j];
			ans += (ll) w1.count() * w2.count();
			// debug << i << ' ' << j << ' ' << w1.count() * w2.count() << endl;
		}
	// debug << ans << endl;
	F(i, 1, n)
		F(j, i + 1, n) if (st[i][j] == 'Y') {
			bitset <N> w1 = b[i] & y[j];
			bitset <N> w2 = y[i] & b[j];
			ans += (ll) w1.count() * w2.count();
		}
	// debug << ans << endl;
	ans /= 2;
	F(i, 1, n)
		F(j, i + 1, n) if (st[i][j] == 'B') {
			bitset <N> w = y[i] & y[j];
			int t = w.count();
			ans -= (ll) t * (t - 1) / 2;
		}
	F(i, 1, n)
		F(j, i + 1, n) if (st[i][j] == 'Y') {
			bitset <N> w = b[i] & b[j];
			int t = w.count();
			ans -= (ll) t * (t - 1) / 2;
		}
	cout << ans;
	return 0;
}
/* why?
*/