#include<bits/stdc++.h>
using namespace std;


#define li          long long int
#define rep(i,to)   for(li i=0;i<((li)(to));i++)
#define repp(i,start,to)    for(li i=(li)(start);i<((li)(to));i++)
#define pb          push_back
#define sz(v)       ((li)(v).size())
#define bgn(v)      ((v).begin())
#define eend(v)     ((v).end())
#define allof(v)    (v).begin(), (v).end()
#define dodp(v,n)       memset(v,(li)n,sizeof(v))
#define bit(n)      (1ll<<(li)(n))
#define mp(a,b)     make_pair(a,b)
#define rin rep(i,n)
#define EPS 1e-12
#define ETOL 1e-8
#define MOD 998244353
typedef pair<li, li> PI;

#define INF bit(60)

#define DBGP 1


#define idp if(DBGP)
#define F first
#define S second
#define p2(a,b)     idp cout<<a<<"\t"<<b<<endl
#define p3(a,b,c)       idp cout<<a<<"\t"<<b<<"\t"<<c<<endl
#define p4(a,b,c,d)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<endl
#define p5(a,b,c,d,e)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<endl
#define p6(a,b,c,d,e,f)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<endl
#define p7(a,b,c,d,e,f,g)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<endl
#define p8(a,b,c,d,e,f,g,h)     idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<endl
#define p9(a,b,c,d,e,f,g,h,i)       idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<endl
#define p10(a,b,c,d,e,f,g,h,i,j)        idp cout<<a<<"\t"<<b<<"\t"<<c<<"\t"<<d<<"\t"<<e<<"\t"<<f<<"\t"<<g<<"\t"<<h<<"\t"<<i<<"\t"<<j<<endl
#define foreach(it,v)   for(__typeof((v).begin()) it=(v).begin(); it!=(v).end(); ++it)
#define p2p(x)      idp p2((x).F, (x).S)
#define dump(x,n)   idp{rep(i,n){cout<<x[i]<<" ";}puts("");}
#define dump2(x,n)  idp{rep(i,n){cout<<"["<<x[i].F<<" , "<<x[i].S<<"] ";}puts("");}
#define dumpi(x)    idp{foreach(it, x){cout<<(*it)<<" ";}puts("");}
#define dumpi2(x)   idp{foreach(it, x){cout<<"["<<(it)->F<<" , "<<(it)->S<<"] ";}puts("");}

#define read2d(a,w,h)   rep(i,h)rep(j,w)cin>>a[i][j]
#define dump2d(a,w,h)   rep(i,h){rep(j,w)cout<<a[i][j]<<" ";puts("");}

typedef pair<li, li> PI;

li n;

PI ss[1001000];

inline li solve() {
    vector<PI> pos;
    vector<PI> neg;
    vector<PI> eq;
    rin{
        if (ss[i].S < 0) {
            neg.pb({ss[i].F - ss[i].S, -ss[i].S});
        } else if (ss[i].S > 0) {
            pos.pb(ss[i]);
        } else {
            eq.pb(ss[i]);
        }
    }
    // miの降順
    sort(allof(pos));
    reverse(allof(pos));
    li now = 0;
    for (auto p : pos) {
        if (now + p.F < 0) {
            return false;
        }
        now += p.S;
        if (now < 0) {
            return false;
        }
    }
    for (auto p : eq) {
        if (now + p.F < 0) {
            return false;
        }
    }


    // miがでかい順
    sort(allof(neg));
    reverse(allof(neg));
    now = 0;
    //dumpi2(neg);
    for (auto p : neg) {
        if (now + p.F < 0) {
            return false;
        }
        now += p.S;
        if (now < 0) {
            return false;
        }
    }
    return true;
}

int main() {
    cin >> n;
    li sum = 0;
    rin{
        string s;
        cin >> s;
        li cur = 0;
        li mi = 0;
        for (auto c : s) {
            if (c == '(') {
                cur++;
            } else {
                cur--;
            }
            mi = min(mi, cur);
        }
        ss[i] = {mi, cur};
        sum += cur;
    }
    if (sum != 0) {
        puts("No");
        return 0;
    }

    cout << (solve() ? "Yes" : "No") << endl;

    return 0;
}

Measured memory_bytes: 34688