//#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
//#pragma GCC target("avx,avx2")
//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")

//# include <x86intrin.h>
# include <bits/stdc++.h>

# include <ext/pb_ds/assoc_container.hpp>
# include <ext/pb_ds/tree_policy.hpp>

using namespace __gnu_pbds;
using namespace std;
 
template<typename T> using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

#define _USE_MATH_DEFINES_
#define ll long long
#define ld long double
#define Accepted 0
#define pb push_back
#define mp make_pair
#define sz(x) (int)(x.size())
#define every(x) x.begin(),x.end()
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
#define For(i,x,y)  for (ll i = x; i <= y; i ++) 
#define FOr(i,x,y)  for (ll i = x; i >= y; i --)
#define SpeedForce ios_base::sync_with_stdio(0), cin.tie(0), cout.tie(0)
// ROAD to...                                                                                                                                                                                                                Red

inline void Input_Output () {
	//freopen(".in", "r", stdin);
   //freopen(".out", "w", stdout);
}

const double eps = 0.000001;
const ld pi = acos(-1);
const int maxn = 1e7 + 9;
const int mod = 1e9 + 7;
const ll MOD = 1e18 + 9;
const ll INF = 1e18 + 123;
const int inf = 2e9 + 11;
const int mxn = 1e6 + 9;
const int N = 6e5 + 123;                                          
const int M = 22;
const int pri = 997;
const int Magic = 2101;

const int dx[] = {-1, 0, 1, 0};
const int dy[] = {0, -1, 0, 1};
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#define vi vector <int>
#define ld long double
#define pii pair<int, int> 
int n, m, k;
string s[mxn];
vector <pair<pii,ll> > ga,gb;
ll cur;
vi ans;
ll sz, c[N];
set <pair<ll,ll> > st, ord;       


pair<int,int> get (string &s) {
	int bal = 0;
	int good = 0;

	for (auto e : s) {
		if(e == '(') ++bal;
		else --bal;

		good = min(good, bal);
	}

	return mp(good, bal);
}
int a[mxn], b[mxn];

int main () {
	SpeedForce;
	cin >> n;
	int cur = 0; 
	int sum = 0;
	For (i, 1, n) {
		cin >> s[i];
		auto it = get(s[i]);
		it.first *= -1;
		if(it.second >= 0) ga.pb(mp(mp(it.first, it.second), i));
		else {                  
			gb.pb(mp(mp(it.first,it.second),i));
		}
		tie(a[i], b[i]) = it;
		sum += it.second;
	}

	sort(ga.begin(), ga.end());
	for(int i = 0; i < ga.size(); i++){
		if(cur >= ga[i].f.f){
			cur += ga[i].f.s;
			ans.pb(ga[i].s);
		}
	}
	for(int i = 0; i < gb.size(); i++){
		ll d = cur - gb[i].f.f - gb[i].f.s;
		ll t = -gb[i].f.s;
		gb[i].f = mp(d,t);
	}
	sort(gb.begin(), gb.end());
	ll now = cur;
	ll res = 0;
	for(int i = 0; i < gb.size(); i++){
		if(now + b[gb[i].s] >= 0 && res + gb[i].f.s <= gb[i].f.f){
			res += gb[i].f.s;
			now += b[gb[i].s];
			st.insert(mp(gb[i].f.s,gb[i].s));
		}
		else{
			if(st.size() > 0){
				ll t = (*st.rbegin()).f;
				int id = (*st.rbegin()).s;
				if(t > gb[i].f.s){
					now -= b[id];
					now += b[gb[i].s];
					res -= t;
					res += gb[i].f.s;
					st.erase(st.find(mp(t,id)));
					st.insert(mp(gb[i].f.s,gb[i].s));
				}
			}
		}
	}
	if(n == int(ans.size()) + int(st.size()) && sum == 0) cout <<"Yes" << endl;
	else cout << "No";
}

// B...a

Measured memory_bytes: 91140