{-# LANGUAGE FlexibleContexts #-}
{-# LANGUAGE GeneralizedNewtypeDeriving #-}
{-# LANGUAGE Rank2Types #-}
{-# LANGUAGE BinaryLiterals #-}
{-# LANGUAGE BangPatterns #-}

-- Default Imports

import Control.Monad
import Control.Monad.ST
import Control.Monad.Trans.Class

import qualified Control.Monad.Reader as Reader
import Control.Monad.Reader (Reader, ReaderT, runReader, runReaderT)

import qualified Data.Array.MArray as MArray
import qualified Data.Array.ST as STArray
import Data.Array.ST (STArray, STUArray, runSTArray, runSTUArray)
import Data.Ix (Ix)

import qualified Data.Bits as Bits
import Data.Bits ((.&.), (.|.))

import qualified Data.ByteString.Char8 as BS
import Data.ByteString.Char8 (ByteString)

import qualified Data.Char as Char
import qualified Data.List as List
import qualified Data.Map.Strict as Map
import Data.Map.Strict (Map)
import qualified Data.Maybe as Maybe
import qualified Data.Set as Set
import Data.Set (Set)

import qualified Data.Vector as Vector
import qualified Data.Vector.Generic as GVector
import qualified Data.Vector.Mutable as MVector
import Data.Vector.Mutable (STVector)
import qualified Data.Vector.Unboxed as UVector

import Numeric

import Debug.Trace
-- ----------

-- Custom Import Here


-- ----------

-- Default Definitions

type Vector = Vector.Vector
-- type GVector = GVector.Vector
type UVector = UVector.Vector

readIntToList :: ByteString -> [Int]
readIntToList = List.unfoldr (fmap (second $ BS.dropWhile Char.isSpace) . BS.readInt)

readToList :: Read a => ByteString -> [a]
readToList = List.unfoldr $ fmap (mapTaken . mapRemain) . span' (not . Char.isSpace)
	where
		mapTaken  = first $ read . BS.unpack
		mapRemain = second $ BS.dropWhile Char.isSpace
		span' pred s
			| BS.null taken = Nothing
			| otherwise     = Just (taken, remain')
			where
				(taken, remain) = BS.span pred s
				remain' = BS.dropWhile Char.isSpace remain

readToListN :: Read a => Int -> ByteString -> [a]
readToListN n = take n . readToList

readIntToVector :: ByteString -> Vector Int
readIntToVector = Vector.unfoldr (fmap stripRemain . BS.readInt)
	where stripRemain = second $ BS.dropWhile Char.isSpace

readIntToUVector :: ByteString -> UVector.Vector Int
readIntToUVector = UVector.unfoldr (fmap stripRemain . BS.readInt)
	where stripRemain = second $ BS.dropWhile Char.isSpace

readIntToVectorN :: Int -> ByteString -> Vector.Vector Int
readIntToVectorN n = Vector.unfoldrN n (fmap stripRemain . BS.readInt)
	where stripRemain = second $ BS.dropWhile Char.isSpace

readIntToUVectorN :: Int -> ByteString -> UVector.Vector Int
readIntToUVectorN n = UVector.unfoldrN n (fmap stripRemain . BS.readInt)
	where stripRemain = second $ BS.dropWhile Char.isSpace


first :: (a -> a') -> (a, b) -> (a', b)
first f (a, b) = (f a, b)

second :: (b -> b') -> (a, b) -> (a, b')
second f (a, b) = (a, f b)

average :: Fractional a => [a] -> a
average xs = sum xs / (fromIntegral . length) xs

-- ----------

app :: String -> Int
app "" = 0
app (')':ss) = app ss - 1
app ('(':ss) = app ss + 1

need :: String -> Int
need ss = max 0 $ need' ss
	where
		need' "" = 0
		need' (')':ss) = 1 + need ss
		need' ('(':ss) = need ss - 1

red :: Int -> [(Int, Int)] -> Maybe Int
red acc [] = Just acc
red acc ((a, n):remains) = if acc < n
	then Nothing
	else red (acc + a) remains

negatePair :: (Int, Int) -> (Int, Int)
negatePair (a, n) = ((-a), a + n)

calc :: [(Int, Int)] -> Maybe Int
calc pairs = do
	let zeros = filter ((== 0) . fst) pairs
	let positives = List.sortOn snd . filter ((> 0) . fst) $ pairs
	let negatives = filter ((< 0) . fst) pairs
	let negatives' = List.sortOn snd . map negatePair $ negatives
	pn <- red 0 positives
	nn <- red 0 negatives'
	let zeros' = map snd zeros
	let zn = if null zeros'
		then 0
		else maximum zeros'
	if pn == nn && zn <= pn
		then Just pn
		else Nothing

main :: IO ()
main = do
	n <- readLn
	ss <- replicateM n $ getLine
	let pairs =  zip (map app ss) (map need ss)
	let zeros = filter ((== 0) . fst) pairs
	let positives = filter ((> 0) . fst) pairs
	let negatives = filter ((< 0) . fst) pairs
	-- print $ red
	-- print zeros
	-- print positives
	-- print negatives
	-- print $ red 0 positives
	-- print $ map negatePair negatives
	putStrLn $ case calc pairs of
		Nothing -> "No"
		Just _  -> "Yes"

Measured memory_bytes: 274064