Example

Input

3
()(()((
))()()(()
)())(())


Output

Yes
#include <iostream>
#include <fstream>
#include <cassert>
#include <typeinfo>
#include <vector>
#include <stack>
#include <cmath>
#include <set>
#include <map>
#include <string>
#include <algorithm>
#include <cstdio>
#include <queue>
#include <iomanip>
#include <cctype>
#include <random>
#include <complex>
#define syosu(x) fixed<<setprecision(x)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> P;
typedef pair<double,double> pdd;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<string> vs;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<P> vp;
typedef vector<vp> vvp;
typedef vector<pll> vpll;
typedef pair<P,int> pip;
typedef vector<pip> vip;
const int inf=1<<29;
const ll INF=1ll<<58;
const double pi=acos(-1);
const double eps=1e-7;
const ll mod=1e9+7;
const int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

int n;

int main(){
	cin>>n;
	vp a,b;
	int u=0,v=0;
	for(int i=0;i<n;i++){
		string s;
		cin>>s;
		int t=0,m=0,S=s.size();
		for(int j=0;j<S;j++){
			if(s[j]=='('){
				t++;
				u++;
			}
			else{
				t--;
				v++;
			}
			m=min(m,t);
		}
		if(t>=0) a.push_back({m,t});
		else b.push_back({m-t,-t});
	}
	if(u!=v){
		cout<<"No"<<endl;
		return 0;
	}
	sort(a.rbegin(),a.rend());
	sort(b.rbegin(),b.rend());
	int A=a.size(),B=b.size(),t=0;
	for(int i=0;i<A;i++){
		if(t+a[i].first<0){
			cout<<"No"<<endl;
			return 0;
		}
		t+=a[i].second;
	}
	t=0;
	for(int i=0;i<B;i++){
		if(t+b[i].first<0){
			cout<<"No"<<endl;
			return 0;
		}
		t+=b[i].second;
	}
	cout<<"Yes"<<endl;
}