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

1. An empty string;
2. The concatenation of `(`, A, and `)` in this order, for some bracket sequence A ;
3. 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`.

Examples

Input

2
)
(()


Output

Yes


Input

2
)(
()


Output

No


Input

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


Output

Yes


Input

3
(((
)
)


Output

No
import java.util.*;
import java.io.*;
 
public class Main {
    static boolean[][] used;
    static int[] ans;
    public static void main(String[] args) throws Exception {
        FastScanner sc = new FastScanner(System.in);
        int n = sc.nextInt();
        boolean isLeftOnly = false;
        boolean isRightOnly = false;
        boolean isBoth = false;
        int lc = 0;
        int rc = 0;
        int leftonly = 0;
        int rightonly = 0;
        int bothleft = 0;
        int minLeft = Integer.MAX_VALUE;
        int minRight = Integer.MAX_VALUE;
        ArrayList<Integer> li = new ArrayList<Integer>();
        int bothright = 0;
        for(int i = 0 ; i < n; i++){
            char[] s = sc.next().toCharArray();
            int cnt = 0;
            int cntl = 0;
            boolean left = false;
            boolean right = false;
            for(char c : s){
                if(c == ')'){
                    cnt--;
                    if(cnt < 0){
                        cntl = Math.min(cntl,cnt);
                        left = true;
                    }
                }else{
                    cnt++;
                }
            }
            StringBuilder sb = new StringBuilder(new String(s));
            s = sb.reverse().toString().toCharArray();
            cnt = 0;
            int cntr = 0;
            for(char c : s){
                if(c == '('){
                    cnt--;
                    if(cnt < 0){
                        cntr = Math.min(cntr,cnt);
                        right = true;
                    }
                }else{
                    cnt++;
                }
            }
            if(left && right){
                li.add((0-cntl)+(0-cntr));
                minLeft = Math.min(minLeft,0-cntl);
                minRight = Math.min(minRight,0-cntr);
                bothleft += (0-cntl);
                bothright += (0-cntr);
                isBoth = true;
            }else if(left){
                leftonly += (0-cntl);
                isLeftOnly = true;
            }else if(right){
                rightonly += (0-cntr);
                isRightOnly = true;
            }
            lc += (0-cntl);
            rc += (0-cntr);
        }
        if((isLeftOnly && isRightOnly) || ((!isLeftOnly) && (!isRightOnly) && (!isBoth))){
            if(isBoth){
                Collections.sort(li,Comparator.reverseOrder());
                boolean bool = true;
                int now = 0;
                for(int a : li){
                    now += a;
                    if(leftonly-now < 0){
                        bool = false;
                        break;
                    }
                }
                if(lc == rc && leftonly >= bothright-bothleft && leftonly >= minRight && rightonly >= bothleft-bothright && rightonly >= minLeft){
                    System.out.println("Yes");
                }else{
                    System.out.println("No");
                }
            }else{
                if(lc == rc){
                    System.out.println("Yes");
                }else{
                    System.out.println("No");
                }
            }
        }else{
            System.out.println("No");
        }
    }
}


class FastScanner {
    private BufferedReader reader = null;
    private StringTokenizer tokenizer = null;
    public FastScanner(InputStream in) {
        reader = new BufferedReader(new InputStreamReader(in));
        tokenizer = null;
    }

    public String next() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                tokenizer = new StringTokenizer(reader.readLine());
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken();
    }

    public String nextLine() {
        if (tokenizer == null || !tokenizer.hasMoreTokens()) {
            try {
                return reader.readLine();
            } catch (IOException e) {
                throw new RuntimeException(e);
            }
        }
        return tokenizer.nextToken("\n");
    }

    public long nextLong() {
        return Long.parseLong(next());
    }

    public int nextInt() {
        return Integer.parseInt(next());
    }

    public double nextDouble() {
         return Double.parseDouble(next());
    }

    public int[] nextIntArray(int n) {
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
            a[i] = nextInt();
        return a;
    }

    public long[] nextLongArray(int n) {
        long[] a = new long[n];
        for (int i = 0; i < n; i++)
            a[i] = nextLong();
        return a;
    } 
}
