#include <bits/stdc++.h>
#ifdef dbg
#define D(...) fprintf(stderr, __VA_ARGS__)
#define DD(...) D(#__VA_ARGS__ " = "), debug_helper::debug(__VA_ARGS__), D("\n")
#include "C:\Users\wsyear\Desktop\OI\templates\debug.hpp"
#else
#define D(...) ((void)0)
#define DD(...) ((void)0)
#endif
#define rep(i, j, k) for (int i = (j); i <= (k); ++i)
#define per(i, j, k) for (int i = (j); i >= (k); --i)
#define SZ(v) int((v).size())
#define ALL(v) (v).begin(),(v).end()
#define fi first
#define se second
using ll = long long;
using pii = std::pair<int, int>;
using pll = std::pair<ll, ll>;

using namespace std;

const int maxn = 2010;

int n;
char s[maxn][maxn];
bitset<maxn> Y[maxn], B[maxn];

int main() {
  cin.tie(nullptr) -> ios::sync_with_stdio(false);
  cin >> n;
  rep (i, 1, n) cin >> (s[i] + 1);
  rep (i, 1, n) rep (j, 1, n) {
    if (s[i][j] == 'Y') Y[i].set(j);
    if (s[i][j] == 'B') B[i].set(j);
  }
  ll x = 0, y = 0;
  rep (i, 1, n) rep (j, 1, n) {
    x += 1ll * (Y[i] & B[j]).count() * (B[i] & Y[j]).count();
    if (s[i][j] == 'Y') y += 1ll * (B[i] & B[j]).count() * ((B[i] & B[j]).count() - 1) / 2;
    if (s[i][j] == 'B') y += 1ll * (Y[i] & Y[j]).count() * ((Y[i] & Y[j]).count() - 1) / 2;
  }
  cout << (x / 2 - y) / 2 << '\n';
}