#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cfloat>
#include <chrono>
#include <climits>
#include <cmath>
#include <cstdio>
#include <deque>
#include <iomanip>
#include <iostream>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <unordered_map>
#include <unordered_set>
#include <vector>
using namespace std;

template <class T1, class T2>
ostream& operator << (ostream& out, const pair <T1, T2> p)
{
	out << '(' << p.first << ',' << p.second << ')';
	return out;
}

template <class T1, class T2>
istream& operator >> (istream& in, pair<T1, T2> &p)
{
	in >> p.first >> p.second;
	return in;
}

template <class T>
istream& operator >> (istream& in, vector<T> &v)
{
	for (T &x : v)
		in >> x;
	return in;
}

template <class T>
ostream& operator << (ostream& out, const vector<vector<T>> &v)
{
	for (const vector<T> &x : v)
		out << x << '\n';
	return out;
}

template <class T>
ostream& operator << (ostream& out, const vector<T> &v)
{
	for (const T &x : v)
		out << x << ' ';
	return out;
}

long long gcd (long long a, long long b)
{
	if (b > a)
		swap(a, b);
	return (b ? gcd(b, a % b) : a);
}

using ll   = long long;
using pii  = pair<int, int>;
using pll  = pair<long long, long long>;
using tiii = pair<pair<int, int>, int>;
using vi   = vector<int>;
using vl   = vector<long long>;
using vvi  = vector<vector<int>>;
using vvl  = vector<vector<long long>>;

#define F          first
#define S          second
#define First      first.first
#define Second     first.second
#define Third      second
#define mp         make_pair
#define rep(i,a,b) for (int i = (a); i < (b); i++)
#define per(i,b,a) for (int i = (b); i > (a); i--)
#define all(x)     x.begin(), x.end()
#define ret(x)     return cout << x, 0;
#define throwex    throw runtime_error ("Found the error.");

const int h = 1000000007;

template <class T = long long>
class SegTree
{
private:
	T default_element_value = {{INT_MAX, 0}, -1};
	vector<T> v, seg_tree;
	T merge(T x, T y)
	{
		if(x.F.S - x.F.F == y.F.S - y.F.F)
			return (x.S < y.S ? y : x);
		return (x.F.S - x.F.F < y.F.S - y.F.F ? y : x);
	}
	void build(int node, int start, int end)
	{
		if(start == end)
			seg_tree[node] = v[start];
		else
		{
			build(2*node+1, start, (start+end)/2);
			build(2*node+2, (start+end)/2+1, end);
			seg_tree[node] = merge(seg_tree[2*node+1], seg_tree[2*node+2]);
		}
	}
	void update(int node, int start, int end, int index, T val)
	{
		if(start == end)
		{
			seg_tree[node] = val;
			return;
		}
		if(index<=(start+end)/2)
			update(2*node+1, start, (start+end)/2, index, val);
		else
			update(2*node+2, (start+end)/2+1, end, index, val);
		seg_tree[node] = merge(seg_tree[2*node+1], seg_tree[2*node+2]);
	}
	T query(int node, int start, int end, int l, int r)
	{
		if(end<l || start>r)
			return default_element_value;
		if(start>=l && end<=r)
			return seg_tree[node];
		return merge(
			query(2*node+1, start, (start+end)/2, l, r),
			query(2*node+2, (start+end)/2+1, end, l, r));
	}

public:
	SegTree(int n)
	{
		v.resize(n, default_element_value); //except its size, v won't be used anymore
		seg_tree.resize(4 * n, default_element_value);
	}
	SegTree(vector<T> &arr)
	{
		v = arr;
		seg_tree.resize(4 * v.size(), default_element_value);
		build(0, 0, v.size()-1);
	}
	void update(int index, T val)
	{
		update(0, 0, v.size()-1, index, val);
	}
	T query(int l, int r)
	{
		return query(0, 0, v.size()-1, l, r);
	}
};

signed main()
{
	ios::sync_with_stdio(false);
	#ifdef ONLINE_JUDGE
	cin.tie(nullptr);
	cout.tie(nullptr);
	cerr.setstate(ios::failbit);
	#endif

	int n;
	cin >> n;
	vector<pii> pos, neg;
	rep(i,0,n)
	{
		string s;
		cin >> s;
		stack<char> st;
		for(char c : s)
		{
			if(!st.empty() and c == ')' and st.top() == '(')
				st.pop();
			else
				st.push(c);
		}
		string red;
		while(!st.empty())
		{
			red += st.top();
			st.pop();
		}
		reverse(all(red));
		pii p = {count(all(red), ')'), count(all(red), '(')};
		if(p.S - p.F >= 0)
			pos.push_back(p);
		else
			neg.push_back(p);
	}
	sort(all(pos));
	sort(all(neg), [](pii x, pii y){return x.S > y.S;});
	int z = 0;
	for(pii f : pos)
	{
		if(f.first > z)
			ret("No");
		z += f.S - f.F;
	}
	for(pii f : neg)
	{
		if(f.first > z)
			ret("No");
		z += f.S - f.F;
	}
	cout << (z == 0 ? "Yes" : "No");
}


Measured memory_bytes: 11256