import Control.Monad
import Data.List

main = do
  n <- readLn
  ws <- replicateM n $ words <$> getLine
  
  let ws' = map (\[x, y] -> (read x :: Int, length y)) ws
  let result = map solve ws'
  let ans1 = sum $ map fst result
  let ans2 = sum $ map snd result
  
  putStrLn $ (show ans1) ++ " " ++ (show ans2)

solve :: (Int, Int) -> (Int, Int)
solve (t, l) = (min c l, max 0 (l - c))
  where c = (t * 12) `div` 1000