#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define ll              long long
#define pb              push_back
#define ppb             pop_back
#define endl            '\n'
#define mii             map<ll,ll>
#define pii             pair<ll,ll>
#define vi              vector<ll>
#define vs              vector<string>
#define all(a)          (a).begin(),(a).end()
#define F               first
#define S               second
#define sz(x)           ((ll)x.size())
#define hell            (1000000007)
#define inf             ((ll)5e18 + 5)
#define PI              ((double)3.14159265358979323844)
#define DECIMAL(n)      cout << fixed << setprecision(n);
#define rep(i,a,b)      for (ll i=a;i<b;i++)
#define repr(i,a,b)     for (ll i=a-1;i>=b;i--)
#define bitcount(a)     (ll)__builtin_popcount(a)
#define lbnd            lower_bound
#define ubnd            upper_bound
#define mp              make_pair
#define ios             ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ordered_set     tree<ll, null_type,less<ll>, rb_tree_tag,tree_order_statistics_node_update>
#define trace(...)      __f(#__VA_ARGS__, __VA_ARGS__)

template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
    std::cerr << name << " : " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
    const char* comma = strchr(names + 1, ',');std::cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...);
}

using namespace std;
using namespace __gnu_pbds;

/*----------------------Graph Moves----------------*/
//const int fx[]={+1,-1,+0,+0};
//const int fy[]={+0,+0,+1,-1};
//const int fx[]={+0,+0,+1,-1,-1,+1,-1,+1};   // Kings Move
//const int fy[]={-1,+1,+0,+0,+1,+1,-1,-1};  // Kings Move
//const int fx[]={-2, -2, -1, -1,  1,  1,  2,  2};  // Knights Move
//const int fy[]={-1,  1, -2,  2, -2,  2, -1,  1}; // Knights Move
/*------------------------------------------------*/

//primes for hashing 937,991,1013,1409,1741

bool cmp1(const pii &a, const pii &b){
	return a.F<b.F;
}
bool cmp2(const pii &a, const pii &b){
	return a.S>b.S;
}

void solve() {
    ll n;
    cin>>n;
    string s;
    ll arr[n][2];
    rep(i,0,n){
    	ll temp=0;
    	cin>>s;
    	rep(i,0,sz(s)){
    		if (s[i]=='('){
    			temp++;
    		}
    		else{
    			temp=max(0LL,temp-1);
    		}
    	}
    	arr[i][1]=temp;
    	temp=0;
    	repr(i,sz(s),0){
    		if (s[i]==')'){
    			temp++;
    		}
    		else{
    			temp=max(0LL,temp-1);
    		}
    	}
    	arr[i][0]=temp;
    }
    vector <pii> vpos,vneg,v;
    rep(i,0,n){
    	if (arr[i][1]-arr[i][0]>=0){
    		vpos.pb({arr[i][0],arr[i][1]});
    	}
    	else{
    		vneg.pb({arr[i][0],arr[i][1]});
    	}
    }
    sort(all(vpos),cmp1);
    sort(all(vneg),cmp2);
    rep(i,0,sz(vpos)){
    	v.pb(vpos[i]);
    }
    rep(i,0,sz(vneg)){
    	v.pb(vneg[i]);
    }
    ll cur=0;
    rep(i,0,n){
    	if (cur<v[i].F){
    		cout<<"No"<<endl;
    		return;
    	}
    	else{
    		cur+=(v[i].S-v[i].F);
    	}
    }
    if (cur==0){
    	cout<<"Yes"<<endl;
    	return;
    }
    cout<<"No"<<endl;
}

signed main() {
    ios
    ll test=1;
    //cin>>test;
    while (test--) solve();
    return 0;
}

Measured memory_bytes: 50856