#include<bits/stdc++.h>
//ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//clock_t start=clock();clock_t end=clock();cout<<(double)(end-start)/CLOCKS_PER_SEC<<endl;
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int ui;
typedef pair<int,int> pii;
typedef pair<pii,int> ppii;
typedef pair<int,pii> pipi;
typedef pair<ll,ll> pll;
typedef pair<pll,ll> ppll;
typedef pair<ll,pll> plpl;
typedef pair<pii,pii> P;
typedef tuple<ll,ll,ll> tl;
typedef pair<double,double> pdd;
typedef vector<vector<ll>> mat;
ll mod=1000000007;
ll mod2=998244353;
ll mod3=1000003;
ll mod4=998244853;
ll mod5=1000000009;
ll inf=1LL<<62;
double pi=3.141592653589793238462643383279L;
double eps=1e-14;
#define rep(i,m,n) for(int i=m;i<n;i++)
#define rrep(i,n,m) for(ll i=n;i>=m;i--)
#define srep(itr,st) for(auto itr=st.begin();itr!=st.end();itr++)
#define mrep(itr,mp) for(auto& itr:mp)
#define Max(a,b) a=max(a,b)
#define Min(a,b) a=min(a,b)
int dh[4]={1,-1,0,0};
int dw[4]={0,0,1,-1};
int ddh[8]={-1,-1,-1,0,0,1,1,1};
int ddw[8]={-1,0,1,-1,1,-1,0,1};
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        // http://xorshift.di.unimi.it/splitmix64.c
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }

    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};
#define umh unordered_map<ll,ll,custom_hash>
ll gcd(ll a,ll b){
    if(a<b)swap(a,b);
    if(b==0)return a;
    if(a%b==0)return b;
    return gcd(b,a%b);
}
ll lcm(ll a,ll b){
    ll c=gcd(a,b);
    return a*b/c;
}
ll Pow(ll n,ll k){
    ll ret=1;
    ll now=n;
    while(k>0){
        if(k&1)ret*=now;
        now*=now;
        k/=2;
    }
    return ret;
}
ll beki(ll n,ll k,ll md){
  ll ret=1;
  ll now=n;
    now%=md;
  while(k>0){
    if(k%2==1){
      ret*=now;
      ret%=md;
    }
    now*=now;
    now%=md;
    k/=2;
  }
  return ret;
}
ll gyaku(ll n,ll md){
  return beki(n,md-2,md);
}
ll poc(ll n){
    ll ret=0;
    ll u=n;
    while(u>0){
        ret+=u%2;
        u/=2;
        
    }
    return ret;
}
struct MaST{
private:
    ll n;
    vector<pll> dat;
public:
    MaST(vector<ll> v){
        ll sz=v.size();
        n=1;while(n<sz)n*=2;
        pll p={-inf,-inf};
        dat.resize(2*n-1,p);
        rep(i,0,sz)dat[i+n-1]={v[i],-i};
        rrep(i,n-2,0){
            dat[i]=max(dat[i*2+1],dat[i*2+2]);
        }
    }
    void add(ll k,ll x){
        ll i=k+n-1;
        dat[i]={x,-k};
        while(i>0){
            i=(i-1)/2;
            dat[i]=max(dat[2*i+1],dat[2*i+2]);
        }
    }
    pll que(ll a,ll b,ll k=0,ll l=0,ll r=-1){
        if(r<0)r=n;
        if(b<=l||a>=r)return {-inf,-inf};
        if(a<=l&&b>=r)return dat[k];
        pll m1=que(a,b,2*k+1,l,(l+r)/2);
        pll m2=que(a,b,2*k+2,(l+r)/2,r);
        return max(m1,m2);
    }
};
bool cmp(pll p,pll q){
    ll a=p.first,c=p.second,b=q.first,d=q.second;
    ll f=max(-a,-b-c),g=max(-b,-a-d);
    return f<g;
}
int main(){
    ios::sync_with_stdio(false);cin.tie(0);
    int n;cin>>n;
    string s[n];
    int le=0,ri=0;
    int lee[n],rii[n];
    vector<pii> v;
    int mi[n];
    rep(i,0,n){
        cin>>s[i];
        lee[i]=0;rii[i]=0;
        mi[i]=0;
        rep(j,0,(int)s[i].size()){
            if(s[i][j]=='('){
                le++;
                lee[i]++;
            }
                else{
                    ri++;
                    rii[i]++;
                }
            Min(mi[i],lee[i]-rii[i]);
        }
        v.push_back({mi[i],lee[i]-rii[i]});
    }
    if(le!=ri){
        cout<<"No"<<endl;
        return 0;
    }
    sort(v.begin(),v.end());
    vector<ll> vv,w;
    rep(i,0,n){
        vv.push_back(v[i].second);
        w.push_back(v[i].first);
    }
    MaST seg(vv);
    ll now=0;
    bool used[n];
    fill(used,used+n,false);
    //rep(i,0,n)cout<<mi[i]<<" "<<lee[i]<<" "<<rii[i]<<endl;
    rep(i,0,n){
        ll y=lower_bound(w.begin(),w.end(),-now)-w.begin();
        pll p=seg.que(y,n);
        ll ma=p.first,num=-p.second;
        if(ma<0){
            vector<pll> ww;
            rep(j,0,n){
                if(used[j])continue;
                ww.push_back({w[j],vv[j]});
            }
            sort(ww.begin(),ww.end(),cmp);
            rep(j,0,ww.size()){
                if(now+ww[j].first<0){
                    cout<<"No"<<endl;
                    return 0;
                }
                now+=ww[j].second;
            }
            break;
        }
        //cout<<now<<" "<<ma<<endl;
        if(ma+now<0){
            cout<<"No"<<endl;
            return 0;
        }
        now+=ma;
        used[num]=true;
        seg.add(num,-inf);
    }
    cout<<"Yes"<<endl;
}


Measured memory_bytes: 119708