Farmer John has a small field in the shape of an n by n grid where the j-th square from the left of the i-th row from the top is denoted by (i, j) for all 1 ≤ i, j ≤ n. He is interested in planting sweet corn and alfalfa in his field. To do so, he needs to install some special sprinklers.

A sweet corn sprinkler in square (I, J) will sprinkle all squares to the bottom-left: i.e. (i, j) with I ≤ i and j ≤ J.

An alfalfa sprinkler in square (I, J) will sprinkle all squares to the top-right: i.e. (i, j) with i ≤ I and J ≤ j.

A square sprinkled by one or multiple sweet corn sprinklers can grow sweet corn; a square sprinkled by one or multiple alfalfa sprinklers can grow alfalfa. But a square sprinkled by both types of sprinklers (or neither type) can grow nothing.

Help FJ determine the number of ways (modulo 109 + 7) to install sprinklers in his field, at most one per square, so that every square is fertile (i.e., sprinkled by exactly one type of sprinkler).

Some of the squares are already occupied by woolly cows; this doesn't prevent these squares from being fertile, but no sprinklers can be installed in such squares.

Input

The first line contains a single integer n (1 ≤ n ≤ 2000). For each i (1 ≤ i ≤ n), the i + 1 - st line contains a string of length n denoting the i-th row of the grid. Each character of the string is one of 'W' (indicating a square occupied by a woolly cow), or '.' (unoccupied).

Output

Print the remainder when the number of ways to install sprinklers is divided by 109 + 7.

Example

Here are all fourteen possibilities when sweet corn can grow at (1, 1).

CC  .C  CA  CC  .C  CA  CA  C.  CA  C.  CC  .C  CC  .C  
CC, CC, CC, .C, .C, .C, CA, CA, .A, .A, C., C., .., ..