Example

Input

3
()(()((
))()()(()
)())(())


Output

Yes
#include <bits/stdc++.h>
#define ll long long
#define INF 1000000005
#define MOD 1000000007
#define EPS 1e-10
#define rep(i,n) for(int i=0;i<(int)(n);++i)
#define rrep(i,n) for(int i=(int)(n)-1;i>=0;--i)
#define srep(i,s,t) for(int i=(int)(s);i<(int)(t);++i)
#define each(a,b) for(auto (a): (b))
#define all(v) (v).begin(),(v).end()
#define len(v) (int)(v).size()
#define zip(v) sort(all(v)),v.erase(unique(all(v)),v.end())
#define cmx(x,y) x=max(x,y)
#define cmn(x,y) x=min(x,y)
#define fi first
#define se second
#define pb push_back
#define show(x) cout<<#x<<" = "<<(x)<<endl
#define spair(p) cout<<#p<<": "<<p.fi<<" "<<p.se<<endl
#define svec(v) cout<<#v<<":";rep(kbrni,v.size())cout<<" "<<v[kbrni];cout<<endl
#define sset(s) cout<<#s<<":";each(kbrni,s)cout<<" "<<kbrni;cout<<endl
#define smap(m) cout<<#m<<":";each(kbrni,m)cout<<" {"<<kbrni.first<<":"<<kbrni.second<<"}";cout<<endl

using namespace std;

typedef pair<int,int> P;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<double> vd;
typedef vector<P> vp;
typedef vector<string> vs;

const int MAX_N = 100005;

int main()
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    int n;
    cin >> n;
    vs s(n);
    vvi a(n);
    int cri = 0;
    rep(i,n){
        cin >> s[i];
        a[i] = vi(len(s[i]));
        rep(j,len(s[i])){
            if(s[i][j] == '('){
                a[i][j] = 1;
            }else{
                a[i][j] = -1;
            }
        }
        // svec(a[i]);
        cri += accumulate(all(a[i]),0);
    }
    if(cri != 0){
        cout << "No\n";
        return 0;
    }
    vp pl,mn;
    rep(i,n){
        vi sm(len(s[i])+1,0);
        rep(j,len(s[i])){
            sm[j+1] = sm[j] + a[i][j];
        }
        if(sm[len(s[i])] > 0){
            pl.pb(P(*min_element(all(sm)),sm[len(s[i])]));
        }else{
            mn.pb(P(sm[len(s[i])],*min_element(all(sm))));
        }
    }
    int aa = len(pl),bb = len(mn);
    sort(all(pl),greater<P>());
    int nw = 0;
    // rep(i,aa){
    //     spair(pl[i]);
    // }
    // rep(i,bb){
    //     spair(mn[i]);
    // }
    rep(i,aa){
        if(nw + pl[i].fi < 0){
            cout << "No\n";
            return 0;
        }
        nw += pl[i].se;
    }
    vp vec(bb);
    rep(i,bb){
        vec[i] = P(mn[i].fi-mn[i].se,i);
    }
    sort(all(vec),greater<P>());
    rep(i,bb){
        if(nw + mn[vec[i].se].se < 0){
            cout << "No\n";
            return 0;
        }
        nw += mn[vec[i].se].fi;
    }
    cout << "Yes\n";
    return 0;
}

