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 PYTHON):

Solution:
import decimal,math
from collections import *
from fractions import gcd
from bisect import bisect_right,bisect_left
import sys

def primeFactors(n): 
	arr=[]
	while n % 2 == 0: 
		arr.append(2) 
		n = n / 2
	for i in xrange(3,int(math.sqrt(n))+1,2): 
		while n % i== 0: 
			arr.append(i) 
			n = n / i 
	if n > 2: 
		arr.append(n)
		# print n
	return arr	 
def z_advanced(s):
	Z = [0] * len(s)
	Z[0] = len(s) 
	rt = 0
	lt = 0
	for k in xrange(1, len(s)):
		if k > rt:
			n = 0
			while n + k < len(s) and s[n] == s[n+k]:
				n += 1
			Z[k] = n
			if n > 0:
				lt = k
				rt = k+n-1
		else:
			p = k - lt  # Pair index.
			right_part_len = rt - k + 1 
			if Z[p] < right_part_len:
				Z[k] = Z[p]
			else:
				i = rt + 1
				while i < len(s) and s[i] == s[i - k]:
					i += 1
				Z[k] = i - k
 
				lt = k
				rt = i - 1
	return max(Z)

def SieveOfEratosthenes(n): 
	prime = [True for i in xrange(n+1)] 
	p = 2
	while (p * p <= n): 
		if (prime[p] == True): 
			
			for i in xrange(p * p, n+1, p): 
				prime[i] = False
		p += 1
	arr=[]
	for p in xrange(2, n): 
		if prime[p]: 
			arr.append(p)
	return arr

def invmod(i,mod):
	return pow(i,mod-2,mod)	
def fact(mod):
	fac= [1,1]
	ifac = [1,1]
	for i in xrange(2,(3*10**5+ 2)):
		fac.append((fac[-1]*i)%mod)
		# ifac.append((ifac[-1]*invmod(i,mod))%mod)
	return fac,ifac	
def divisors(n) : 
	list = []  
	for i in range(1, int(math.sqrt(n) + 1)) : 
		  
		if (n % i == 0) : 
			if (n / i == i) :
				list.append(i) 
			else : 
				list.append(i)
				list.append(int(n / i)) 
	list.sort()
	return list
				
def fi():
	return int(sys.stdin.readline())
 
def fi2():
	return map(int, sys.stdin.readline().split())
 
def fi3():
	return sys.stdin.readline()
 
def fo(*args):
	for s in args:
		sys.stdout.write(str(s)+' ')
	sys.stdout.write('\n')


decimal.getcontext().prec = 15

def check(expression): 
	queue = [] 
	for i in expression:
		if(len(queue)==0):
			queue.append(i)
		elif i =="(": 
			queue.append(i) 
		elif i==")": 
			if  "(" != queue.pop(): 
				return 0
	if(len(queue)==0 or len(queue)==2):
		return 1			
	return 0



s= fi()
b= raw_input().strip()
# print check(b)
if(s%2==1):
	print "No"
else:	
	f=b.count("(")
	g=b.count(")")
	if(f!=g):
		print "No"
	else:	
		u=check(b)
		if(u==1):
			print "Yes"
		else:
			print "No"