/*
author: madhav_1999 aka orthodoxparadox
10 May 2020 at 6:00 PM
*/

#include <bits/stdc++.h>
#include <ext/pb_ds/detail/standard_policies.hpp>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;

#define dbl long double
#define int ll
#define ll long long
#define pii pair<int, int>
#define len(x) (int) x.size()
#define rev(a) reverse(all(a))
#define oiint ostream_iterator<int>(cout, " ") 
#define pb push_back
#define mp make_pair
#define ff first
#define ss second
#define endl '\n'
#define all(a) a.begin(), a.end()
#define initialise(a, x) memset(a, x, sizeof(a))
#define onlyunique(v) v.erase(unique(all(v)), v.end()); //only for sorted vector
#define inf 2e18
#pragma GCC optimize ("O3")
#pragma GCC optimize ("unroll-loops")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define _CRT_SECURE_NO_WARNINGS
#ifdef MADHAV
#define dbg(...) __f(#__VA_ARGS__, __VA_ARGS__)
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){cerr << name << " : " << arg1 << endl;}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
	const char* comma = strchr(names + 1, ',');
	cerr.write(names, comma - names) << " : " << arg1 << "  ";
	__f(comma + 1, args...);}
#else
#define dbg(...) 42
#endif
template <typename X> ostream& operator << (ostream& x,const vector<X>& v){for(int i=0;i<(int)v.size();++i) x<<v[i]<<" ";return x;} 
template <typename X> ostream& operator << (ostream& x,const set<X>& v){for(auto it:v) x<<it<<" ";return x;} 
template <typename X> ostream& operator << (ostream& x,const multiset<X>& v){for(auto it:v) x<<it<<" ";return x;} 
template <typename X, typename Y> ostream& operator << (ostream& x, const pair<X,Y>& v) {x<<v.ff<<" "<<v.ss;return x;} 
template <typename T, typename S> ostream& operator << (ostream& os, const map<T, S>& v) { for (auto it : v) os << it.first << "=>" << it.second << endl; return os; }
typedef tree <int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
struct pair_hash {inline std::size_t operator()(const std::pair<int, int> & v) const {return v.first*31+v.second;}};
const int MOD = 1e9 + 7;

int takemod(int a, int mod = MOD){a%=mod;if(a<0)a+=mod;return a;}

int fast_exp(int base, int expo, int mod = MOD) {
	int res=1;
	while(expo>0) {
		if(expo&1) res=(res*base)%mod;
		base=(base*base)%mod;
		expo>>=1;}
	return res;}

int modinv(int a, int mod = MOD){return takemod(fast_exp(takemod(a, mod), mod-2, mod), mod);}

bool mysort(const pii &a, const pii &b) {
	int x = a.ff + b.ss;
	int y = b.ff + a.ss;
	return x < y;
}

void solve()
{
	int n;
	cin >> n;
	int minx[n]{}, diff[n]{};
	pii px[n]{};
	int totd = 0;
	int curd = 0;
	vector<pii> triv;
	vector<pii> untriv;
	for(int i = 0; i < n; i++) {
		string s;
		cin >> s;
		int cur = 0, mini = 0;
		int p = len(s);
		for(int j = 0; j < p; j++) {
			if(s[j] == ')') cur--;
			else cur++;
			mini = min(mini, cur);
		}
		minx[i] = mini;
		diff[i] = cur;
		totd += diff[i];
		dbg(diff[i], totd);
		px[i] = make_pair(minx[i], diff[i]);
		if(minx[i] >= 0 and diff[i] >= 0) {
			curd += diff[i];
			continue;
		}
		if(diff[i] >= 0) {
			triv.push_back({minx[i], diff[i]});
		}
		else {
			untriv.push_back({minx[i], diff[i]});
		}
	}
	if(totd != 0) {
		cout << "No";
		return;
	}
	dbg(curd, triv, untriv);
	sort(all(triv), greater<pii>());
	for(pii p : triv) {
		if(curd + p.ff >= 0) {
			curd += p.ss;
			continue;
		}
		else {
			cout << "No";
			return;
		}
	}
	sort(all(untriv), mysort);
	for(pii p : untriv) {
		if(curd + p.ff >= 0) {
			curd += p.ss;
			continue;
		}
		else {
			cout << "No\n";
			return;
		}
	}
	cout << "Yes";

}

signed main(){
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	#ifdef MADHAV
	freopen("input.txt", "r", stdin);
	freopen("output.txt", "w", stdout);
	freopen("error.txt", "w", stderr);
	#endif
	clock_t t1, t2;
	t1 = clock();

	int tt = 1;
	// cin >> tt;
	while(tt--)
	{
		solve();
	}
	#ifdef MADHAV
	t2 = clock(); cout << "\n\ntime taken: " << (t2-t1)/(dbl)CLOCKS_PER_SEC;
	#endif
	return 0;
}

Measured memory_bytes: 42824