$2$

Write a function:

def solution$($B$)$

which, given a square board of $NN$ size describing Aladdin's and Jafar's pawns, retums the maximum number of pawns Jafar can beat in one turn. If none of Aladdin's pawns can be beaten, the function should retum $.$

Jafar's pawn is described by the $\text{'}0\text{'}$ character, Aladdin's pawns by $x\text{'}$ characters and empty fields by : $\text{'}($dots$).$ The board is described from top to bottom and from left to right.

For example, given:

$B[]=-$dotsdots

$B[1]=$dots..

$B[2]=....X.$

$B[3]=.X$ dots

$B[4]=$dots.$x.$

$B[5]=$dots$0..$

the function should retum $2($Jafar can beat Aladdin's pawn in the upright direction and then another one in the up$-$left direction$).$

Given:

$B[]={?}^{**}$dots.

$B[1]={?}^{**}$dots.

$B[2]={?}^{**}.\mathrm{.}0$dots

$B[3]={?}^{**}$dots..

$B[4]={?}^4$dots.

the fiuntion ohneAd rotiun a

Assume that:

$.$ N is an imeger writin the range $[1.30]$

all swings in $B$ are made only of the following characters $-$ :$\text{'}?$ and$/$co $"0\%$:

the bourd is $NN$ square:

the bourd contzins eractly one pawn cowned by Jafar.