CF629A.Far Relative’s Birthday Cake

Door's family is going celebrate Famil Doors's birthday party. They love Famil Door so they are planning to make his birthday cake weird!

The cake is a n × n square consisting of equal squares with side length 1. Each square is either empty or consists of a single chocolate. They bought the cake and randomly started to put the chocolates on the cake. The value of Famil Door's happiness will be equal to the number of pairs of cells with chocolates that are in the same row or in the same column of the cake. Famil Doors's family is wondering what is the amount of happiness of Famil going to be?

Please, note that any pair can be counted no more than once, as two different cells can't share both the same row and the same column.

Door 的家人将为 Famil Door 庆祝生日派对。他们非常喜爱 Famil Door，因此计划制作一个“奇特”的生日蛋糕！

该蛋糕是一个 $n \times n$ 的正方形，由边长为 1 的单位小正方形组成。每个单位小正方形要么为空，要么恰好含有一颗巧克力。他们买好了蛋糕，并随机地在蛋糕上放置巧克力。Famil Door 的幸福值定义为：所有满足“位于蛋糕同一行或同一列”的、含巧克力的单元格对的数量。Famil Door 的家人想知道，Famil Door 的幸福值将会是多少？

请注意：任意一对单元格至多被计数一次，因为两个不同的单元格不可能同时共享同一行和同一列。

In the first line of the input, you are given a single integer n (1 ≤ n ≤ 100) — the length of the side of the cake.

Then follow n lines, each containing n characters. Empty cells are denoted with '.', while cells that contain chocolates are denoted by 'C'.

输入的第一行包含一个整数 $n$（$1 \leq n \leq 100$）——表示蛋糕边长。

接下来有 $n$ 行，每行包含 $n$ 个字符。空单元格用 . 表示，含有巧克力的单元格用 C 表示。

Print the value of Famil Door's happiness, i.e. the number of pairs of chocolate pieces that share the same row or the same column.

输出 Famil Door 的幸福值，即位于同一行或同一列的巧克力块对的数量。

If we number rows from top to bottom and columns from left to right, then, pieces that share the same row in the first sample are:

1. (1, 2) and (1, 3)
2. (3, 1) and (3, 3)

Pieces that share the same column are:

1. (2, 1) and (3, 1)
2. (1, 3) and (3, 3)

如果我们从上到下对行编号，从左到右对列编号，则第一个样例中位于同一行的棋子有：

1. $(1,\,2)$ 和 $(1,\,3)$
2. $(3,\,1)$ 和 $(3,\,3)$

位于同一列的棋子有：

1. $(2,\,1)$ 和 $(3,\,1)$
2. $(1,\,3)$ 和 $(3,\,3)$