#include<bits/stdc++.h>
using namespace std;
#define rep(i,a,b) for(int i=a;i<b;i++)
#define rrep(i,a,b) for(int i=a;i>=b;i--)
#define fore(i,a) for(auto& i:a)
#define ff first 
#define ss second 
#define all(a) begin(a),end(a)
#define allr(a) rbegin(a),rend(a)
#define pb push_back
using ll =long long;
using pii=pair<int,int>;
using pll=pair<ll,ll>;
using vi=vector<int>;
using vll=vector<ll>;
template<class T> inline bool chmin(T& a,T b){return a>b?a=b,1:0;}
template<class T> inline bool chmax(T& a,T b){return a<b?a=b,1:0;}

const int INFI=numeric_limits<int>::max()/2;
const ll INFL=numeric_limits<ll>::max()/2;


void solve(){
    
}

int main(){
    int n;
    string s;cin>>n>>s;
    int cnt{};
    rep(i,0,n){
        if(s[i]=='(')cnt++;
        else cnt--;
        if(cnt<0){
            cout<<"No"<<endl;
            return 0;
        }
    }
    if(cnt==0)cout<<"Yes"<<endl;
    else cout<<"No"<<endl;
    return 0;
}
/*

*/