#include <algorithm>
#include <complex>
#include <cstdlib>
#include <ctime>
#include <time.h>
#include <iomanip>
#include <iostream>
#include <map>
#include <math.h>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <vector>
#include <numeric>
#include <limits>
#include <type_traits>
#include <locale>

using namespace std;
#define SAY_YES cout << "YES" << endl;
#define SAY_Yes cout << "Yes" << endl;
#define SAY_NO cout << "NO" << endl;
#define SAY_No cout << "No" << endl;
#define IFYES(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "YES" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "NO" << endl;  \
    }
#define IFYes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "Yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "No" << endl;  \
    }
#define IFyes(TRUE_OR_FALSE)   \
    if (TRUE_OR_FALSE)         \
    {                          \
        cout << "yes" << endl; \
    }                          \
    else                       \
    {                          \
        cout << "no" << endl;  \
    }
#define DEBUG_OUTPUT_ARRAY(XXX, ONE)                            \
    for (int i = 0; i < (ONE); i++)                             \
    {                                                           \
        cout << "DEBUG: i = " << i << " -> " << XXX[i] << endl; \
    }
#define DEBUG_OUTPUT_ARRAY2(XXX, ONE, TWO)                             \
    for (int i = 0; i < (ONE); i++)                                    \
    {                                                                  \
        cout << "<<< i = " << i << " >>>" << endl;                     \
        for (int j = 0; j < (TWO); j++)                                \
        {                                                              \
            cout << "DEBUG: j = " << j << " -> " << XXX[i][j] << endl; \
        }                                                              \
    }
#define DEBUG_OUTPUT_ARRAY2_BOX(XXX, ONE, TWO) \
    for (int i = 0; i < (ONE); i++)            \
    {                                          \
        cout << i << "  ";                     \
        for (int j = 0; j < (TWO); j++)        \
        {                                      \
            cout << XXX[i][j] << " ";          \
        }                                      \
        cout << endl;                          \
    }

typedef pair<long long int, long long int> pll;


const long long int mod = 998244353;
const long long int INF = 1e18;
const long double PI=3.14159265358979323; 

long long int N,M,K,sum=0,res=0,A[203232],B,C[20],X,used[202000]={};
bool ok=false;
string S[1200200],T;


long long int dp[200200]={};


long long int l[1200200],r[1200200],L=0,R=0,lmax=0,rmax=0;
bool leftExist=false,rightExist=false;
vector<pll>LR;

int main(){
    cout << fixed << setprecision(18);
    cin>>N;
    for(long long int i = 0; i < N; i++){
        cin>>S[i];
        long long int now=0,lef=0,rig=0;
        for(long long int j = 0; j < S[i].size(); j++){
            if(S[i][j]==')'){
                now--;
                if(now<0){
                    now=0;
                    lef++;
                }
            }else{
                now++;
            }
        }
        
        now=0;
        for(long long int j = S[i].size()-1; j >=0; j--){
            if(S[i][j]=='('){
                now--;
                if(now<0){
                    now=0;
                    rig++;
                }
            }else{
                now++;
            }
        }
        l[i]=lef;
        r[i]=rig;
        if(l[i]==0&&r[i]==0){

        }else if(l[i]==0){
            leftExist=true;
        }else if(r[i]==0){
            rightExist=true;
        }
        L+=lef;
        R+=rig;
        LR.push_back({lef,rig});
        //cout<<lef<<" "<<rig<<endl;
    }
    sort(LR.begin(),LR.end());
    if(L==R){
        long long int len=0;
        for(long long int i = 0; i < N; i++){
            if(len<LR[i].first){
                cout<<"No"<<endl;
                return 0;
            }else{
                if(LR[i].second>LR[i].first){
                    len+=LR[i].second-LR[i].first;
                }
            }
            LR[i]={LR[i].second,LR[i].first};
        }
        
        sort(LR.begin(),LR.end());
        len=0;
        for(long long int i = 0; i < N; i++){
            if(len<LR[i].first){
                cout<<"No"<<endl;
                return 0;
            }else{
                if(LR[i].second>LR[i].first){
                    len+=LR[i].second-LR[i].first;
                }
            }
            LR[i]={LR[i].second,LR[i].first};
        }
        cout<<"Yes"<<endl;
    }else{
        cout<<"No"<<endl;
    }
    
}


Measured memory_bytes: 72004