Problem:
Score : 600 points

Problem Statement

A bracket sequence is a string that is one of the following:

An empty string;

The concatenation of (, A, and ) in this order, for some bracket sequence A ;

The concatenation of A and B in this order, for some non-empty bracket sequences A and B /

Given are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?

Constraints

1 \leq N \leq 10^6

The total length of the strings S_i is at most 10^6.

S_i is a non-empty string consisting of ( and ).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

If a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.

Sample Input 1

2
)
(()

Sample Output 1

Yes

Concatenating (() and ) in this order forms a bracket sequence.

Sample Input 2

2
)(
()

Sample Output 2

No

Sample Input 3

4
((()))
((((((
))))))
()()()

Sample Output 3

Yes

Sample Input 4

3
(((
)
)

Sample Output 4

No

Solution in Python (3.8.2) (judge verdict: Wrong Answer)

import numpy as np
#import math
#from decimal import *
#from numba import njit

#@njit
def main():
    N = int(input())
    A = np.zeros((N,2), dtype='int16')
    for i in range(N):
        string = input()
        m = 0
        s = 0
        for c in string:
            if c == '(':
                s += 1
            else:
                s -= 1
                m = max(m, -s)
        A[i] = [m,s]
    
    A = A[np.argsort(A[:,1])]
    A = A[np.argsort(A[:,0])][::-1]
    #print(A)
    s = 0
    while len(A) > 0:
        index = np.where(A[:,0] >= s)[0]
        if len(index) <= 0:
            print('No')
            return
        s += A[index][0][1]
        A = np.delete(A, index[0], 0)
    
    print('Yes')

main()