import java.util.*
import kotlin.collections.ArrayList

data class Node(val p:Int, val n:Int)

fun main() {
    val sc = Scanner(System.`in`)
    val n = sc.nextInt()
    val list = ArrayList<Node>()
    var start = 0
    var end = 0

    for(i in 0 until n) {
        var k = 0
        var minus = 0
        var plus = 0
        val s = sc.next()
        for(c in s) {
            if(c == '(') {
                if(k < 0) {
                    minus += k
                    k = 0
                }
                ++k
            } else if(c==')'){
                --k
            }
        }
        if(k > 0) {
            plus += k
        } else if(k < 0) {
            minus += k
        }

        if(minus == 0 || plus == 0) {
            start += plus
            end += minus
        } else {
            list.add(Node(plus, minus))
        }
    }

    val pq = PriorityQueue<Node>(kotlin.Comparator { o1, o2 ->
        val v1 = o1.n + o1.p
        val v2 = o2.n + o2.p
        return@Comparator v2.compareTo(v1)
    })

    list.sortByDescending { it.n }

    var idx = 0
    var isSuccess = true

    while (isSuccess && idx < list.size) {
        while(idx < list.size && list[idx].n <= start) {
            pq.add(list[idx++])
        }
        while (pq.isNotEmpty()) {
            val node = pq.poll()
            start += node.n
            if(start < 0) {
                isSuccess = false
                break
            }
            start += node.p
        }
    }
    if(isSuccess) {
        val ret = start + end
        isSuccess = ret == 0
    }

    if(isSuccess) {
        print("Yes")
    } else {
        print("No")
    }
}