import Control.Applicative ((<$>))
import Control.Monad (replicateM)
import Data.List (partition, foldl', nub)
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 = search pv uks
  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 []
        rnk v = (+1) . length . nub $ foldl' (\xs i -> if v ! i > v ! 0 then (v ! i):xs else xs) [] [1..n-1]
        search v [] = rnk v
        search v ((i,j):rs) = min (search (V.accum (+) v [(i,1)]) rs) (search (V.accum (+) v [(j,1)]) rs)