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();
        ArrayList<St> liL = new ArrayList<St>();
        ArrayList<St> liR = new ArrayList<St>();
        int total = 0;
        for(int i = 0 ; i < n; i++){
            int h = 0;
            int b = 0;
            char[] s = sc.next().toCharArray();
            for(char c : s){
                if(c == '('){
                    h++;
                }else{
                    h--;
                    b = Math.min(b,h);
                }
            }
            total += h;
            if(h > 0){
                liL.add(new St(h,b));
            }else{
                liR.add(new St(-h,b-h));
            }
        }
        int now = 0;
        Collections.sort(liL);
        for(St s : liL){
            //System.out.println(s.cnt+" "+s.min+" "+now);
            if(now+s.min < 0){
                System.out.println("No");
                return;
            }
            now += s.cnt;
        }
        now = 0;
        Collections.sort(liR);
        for(St s : liR){
            //System.out.println(s.cnt+" "+s.min+" "+now);
            if(now+s.min < 0){
                System.out.println("No");
                return;
            }
            now += s.cnt;
        }
        if(total == 0){
            System.out.println("Yes");
        }else{
            System.out.println("No");
        }
    }
}
class St implements Comparable<St>{
    int cnt,min;
    public St(int cnt, int min){
        this.cnt = cnt;
        this.min = min;
    }
    
    public int compareTo(St s){
        if(this.min > s.min){
            return -1;
        }else if(this.min < s.min){
            return 1;
        }else{
            if(this.cnt > s.cnt){
                return -1;
            }else if(this.cnt < s.cnt){
                return 1;
            }else{
                return 0;
            }
        }
    }
}

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;
    } 
}
