import java.util.*
import kotlin.math.min

data class ParenParts(val min: Int, val sum: Int)

fun main() {
//    val builder = StringBuilder()

    val n = readInputLine().toInt()

    val up = PriorityQueue<ParenParts> { x, y -> y.min.compareTo(x.min) }
    val down = PriorityQueue<ParenParts> { x, y -> (y.sum - y.min).compareTo(x.sum - x.min) }

    repeat(n) {
        val s = readInputLine()

        var minTmp = 0
        var sumTmp = 0

        for (c in s) {
            when(c) {
                '(' -> {
                    sumTmp++
                }
                else -> {
                    sumTmp--
                    minTmp = min(minTmp, sumTmp)
                }
            }
        }

        if (sumTmp >= 0) {
            up.add(ParenParts(minTmp, sumTmp))
        } else {
            down.add(ParenParts(minTmp, sumTmp))
        }
    }

    var current = 0

    while (up.isNotEmpty()) {
        val (min, sum) = up.poll()
        if (current + min < 0) {
            println("No")
            return
        }
        current += sum
    }

    while (down.isNotEmpty()) {
        val (min, sum) = down.poll()
        if (current + min < 0) {
            println("No")
            return
        }
        current += sum
    }

    if (current == 0) {
        println("Yes")
    } else {
        println("No")
    }

//    builder.appendln(ans)

//    print(builder.toString())
}

fun readInputLine(): String {
    return readLine()!!
}
