import Control.Applicative ((<$>))
import Control.Monad (replicateM)
import Data.List (partition, foldl')
import Data.Vector.Unboxed (Vector, (!), (//))
import qualified Data.Vector.Unboxed as V

main :: IO ()
main = do
  n <- readLn
  solve n <$> replicateM n getLine >>= print

solve :: Int -> [String] -> Int
solve n ss = rnk $ foldl' (\p (i, j) -> if p ! i <= p ! 0 && p ! j <= p ! 0 then
                                          if p ! i < p ! j then V.accum (+) p [(i, 1)]
                                          else V.accum (+) p [(j, 1)]
                                        else p
                          ) pv' ois
  where pis = do
          i <- [0..n-2]
          j <- [i+1..n-1]
          case ss !! i !! j of
           'o' -> return (i, 1)
           'x' -> return (j, 1)
           _ -> []
        pv = V.accum (+) (V.replicate n 0) pis :: Vector Int
        uks = do
          i <- [0..n-2]
          j <- [i+1..n-1]
          if ss !! i !! j == '-' then return (i, j) else []
        (zis, ois) = partition (\(i,_) -> i == 0) uks
        pv' = V.accum (+) pv [(0, length zis)]
        rnk v = (+1) $ foldl' (\r i -> if v ! i > v ! 0 then r+1 else r) 0 [1..n-1]