Problem: Petya's friends made him a birthday present — a bracket sequence. Petya was quite disappointed with his gift, because he dreamed of correct bracket sequence, yet he told his friends nothing about his dreams and decided to fix present himself. 

To make everything right, Petya is going to move at most one bracket from its original place in the sequence to any other position. Reversing the bracket (e.g. turning "(" into ")" or vice versa) isn't allowed. 

We remind that bracket sequence s is called correct if: 

  * s is empty; 
  * s is equal to "(t)", where t is correct bracket sequence; 
  * s is equal to t_1 t_2, i.e. concatenation of t_1 and t_2, where t_1 and t_2 are correct bracket sequences. 



For example, "(()())", "()" are correct, while ")(" and "())" are not. Help Petya to fix his birthday present and understand whether he can move one bracket so that the sequence becomes correct.

Input

First of line of input contains a single number n (1 ≤ n ≤ 200 000) — length of the sequence which Petya received for his birthday.

Second line of the input contains bracket sequence of length n, containing symbols "(" and ")".

Output

Print "Yes" if Petya can make his sequence correct moving at most one bracket. Otherwise print "No".

Examples

Input


2
)(


Output


Yes


Input


3
(()


Output


No


Input


2
()


Output


Yes


Input


10
)))))(((((


Output


No

Note

In the first example, Petya can move first bracket to the end, thus turning the sequence into "()", which is correct bracket sequence.

In the second example, there is no way to move at most one bracket so that the sequence becomes correct.

In the third example, the sequence is already correct and there's no need to move brackets.

Solution (in JAVA):

Solution:
//import com.sun.org.apache.xml.internal.resolver.helpers.PublicId;


import sun.reflect.generics.tree.Tree;
import java.io.IOException;
import java.io.InputStream;
import java.util.*;

public class Solution {


    public static void main(String arg[]) throws Exception {
        Fast io = new Fast(System.in);
        int n = io.nextInt();
        String s = io.next();
        StringBuilder sb = new StringBuilder();
        Stack <Character> sq = new Stack<>();
        int co = 0;
        for(int i=0;i<s.length();i++){
            if(s.charAt(i)==')'){
                if(!sq.isEmpty())
                    sq.pop();
                else
                    co ++;
            }
            else{
                sq.push(s.charAt(i));
            }
        }
        String ans = "";
        if(co == 0 && sq.empty())
            ans = "Yes";
        else if(co == 1 && sq.size() == 1)
            ans = "Yes";
        else
            ans = "No";
        System.out.println(ans);


    }
}
class N{

    int l;
    int r;
    public N(int lf, int rg){
        l = lf;
        r = rg;
    }
}
class MC implements Comparator<N>{
    public int compare(N n1, N n2){
        return n1. l - n2.l;
    }
}
class Fast{

    byte[] buf = new byte[2048];
    int index, total;
    InputStream in;

    Fast(InputStream is) {
        in = is;
    }

    int scan() throws IOException {
        if (index >= total) {
            index = 0;
            total = in.read(buf);
            if (total <= 0) {
                return -1;
            }
        }
        return buf[index++];
    }

    String next() throws IOException {
        int c;
        for (c = scan(); c <= 32; c = scan());
        StringBuilder sb = new StringBuilder();
        for (; c > 32; c = scan()) {
            sb.append((char) c);
        }
        return sb.toString();
    }

    int nextInt() throws IOException {
        int c, val = 0;
        for (c = scan(); c <= 32; c = scan());
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }

    long nextLong() throws IOException {
        int c;
        long val = 0;
        for (c = scan(); c <= 32; c = scan());
        boolean neg = c == '-';
        if (c == '-' || c == '+') {
            c = scan();
        }
        for (; c >= '0' && c <= '9'; c = scan()) {
            val = (val << 3) + (val << 1) + (c & 15);
        }
        return neg ? -val : val;
    }
}