import Control.Monad

main :: IO ()
main = do
  n <- readLn
  if n == 0
    then return ()
    else do
      ls <- replicateM n readLn
      mapM_ putStrLn (solve ls)
      main

solve :: [Int] -> [String]
solve ls = toGraph (update (replicate 10 0) ls)
  where
    toGraph :: [Int] -> [String]
    toGraph = map toAst
      where
        toAst :: Int -> String
        toAst 0 = "-"
        toAst n = replicate n '*'
        
    update :: [Int] -> [Int] -> [Int]
    update counter [] = counter
    update counter (x:xs) = update (plus x counter) xs
      where
        plus :: Int -> [Int] -> [Int]
        plus 0 (x:xs) = (x+1):xs
        plus n (x:xs) = x:(plus (n-1) xs)
        