#include <vector>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <algorithm>
#include <numeric>
#include <functional>
#include <sstream>
#include <iostream>
#include <iomanip>
#define _USE_MATH_DEFINES
#include <cmath>
#include <climits>
#include <cstdlib>
#include <cstring>
#include <cfloat>
#include <cmath>
#include <ctime>
#include <cassert>
#include <cctype>
#include <cstdio>
#include <cassert>
using namespace std;

#define EPS 1e-12
#define ull unsigned long long
#define ll long long
#define VI vector<ll>
#define PII pair<ll, ll> 
#define VVI vector<vector<ll> >
#define VVVI vector<vector<vector<ll>>>
#define VVVVI vector<vector<vector<vector<ll>>>>
#define REP(i,n) for(ll i=0,_n=(n);(i)<(ll)_n;++i)
#define REPR(i,n) for(ll i=(ll)(n)-1;0<=(i);--i)
#define RANGE(i,a,b) for(ll i=(ll)a,_b=(ll)(b);(i)<_b;++i)
#define RANGER(i,a,b) for(ll i=(ll)(b)-1,_a=(ll)(a);(_a)<=i;--i)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define ALL(c) (c).begin(), (c).end()
#define ALLR(c) (c).rbegin(), (c).rend()
#define PB push_back
#define MP(a, b) make_pair(a, b)
#define POPCOUNT __builtin_popcount
#define POPCOUNTLL __builtin_popcountll
#define CLEAR(table, v) memset(table, v, sizeof(table));
#define UNIFORM_DOUBLE(a, b) (((b-a)*(double)rand()/RAND_MAX)+a) // [a, b) 
#define UNIFORM_LL(a, b) (ll)UNIFORM_DOUBLE(a, b) // [a, b) 
#define IN(v, lo, hi) ((lo)<=(v) && (v)<(hi))
#define DD(v) cout<<#v<<": "<<v<<endl
#define FI first
#define SE second
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const pair<T0, T1>& v) { os << v.first << ": " << v.second << " "; return os; }
template <typename T0, typename T1> std::ostream& operator<<(std::ostream& os, const map<T0, T1>& v) { for( typename map<T0, T1>::const_iterator p = v.begin(); p!=v.end(); p++ ){os << p->first << ": " << p->second << " ";} return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<T>& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << " "; } return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const set<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const deque<T>& v) { vector<T> tmp(v.begin(), v.end()); os << tmp; return os; }
template <typename T> std::ostream& operator<<(std::ostream& os, const vector<vector<T> >& v) { for( int i = 0; i < (int)v.size(); i++ ) { os << v[i] << endl; } return os; }
template<typename T>void maxUpdate(T& a, T b) {a = max(a, b);}
template<typename T>void minUpdate(T& a, T b) {a = min(a, b);}
string YN(bool v) { return v ? "Yes":"No"; }
void uniq(VI& es) { sort(ALL(es)); es.erase(unique(ALL(es)), es.end()); }

#define INF (1LL<<60)

/*
単独でカッコ列なものは除いて良い

カッコ列な部分はすべて削除して考えて良い

→残るは )*(* のパターンだけ -> (a, b) で表す
必要条件: )(の数が等しい
どう配置するか?
途中で0<=depthでないといけない

0<=d-a
d+=b-a

途中のdを最大化するには? b-aが大きい順に選ぶ→だめ
b-aが大きくてもaが大きいとd<0になる
(a, b-a) でソートしておいて(d, INF)以下で最大のものを選ぶ

*/
PII nor(string& s) {
	deque<char> q;
	for(char c: s) {
		if(c==')' && q.size() && q.back()=='(') q.pop_back();
		else q.push_back(c);
	}
	ll a=0, b=0;
	REP(i, q.size()) if(q[i]==')') a++; else b++;
//	DD(s);DD(ab);
	if(0<=b-a) return MP(a, b-a);
	return MP(b, b-a);
}
int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	ll N;
	string s;
	while(cin>>N) {
		vector<PII> u, d;
		REP(i, N) {
			cin>>s;
			auto t = nor(s);
			if(0<=t.SE) u.PB(t);
			else d.PB(t);
		}
		sort(ALL(u));
		sort(ALL(d));
		ll ans=1;
		ll U=0;
		REP(i, u.size()) {
			ll a = u[i].FI;
			ll ba = u[i].SE;
			if(U-a<0) ans=0;
			U+=ba;
		}
		ll D=0;
		REP(i, d.size()) {
			ll a = d[i].FI;
			ll ba = d[i].SE;
			if(D-a<0) ans=0;
			D+=-ba;
		}
		if(U!=D) ans=0;
		cout<<YN(ans)<<endl;
	}
	
	return 0;
}


Measured memory_bytes: 18588