#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge{long long to,cost;};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define eachdo(v, e) for(const auto& e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e) (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e) (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD){long long res = 1; while(n > 0){if(n & 1)res = res * a % mod; a = a * a % mod; n >>= 1;} return res;}
void yn(bool j){cout << (j ? "Yes" : "No") << endl; return;}
template<class Head> void pt(Head&& head){cout << head << endl; return;}
template<class Head, class... Tail> void pt(Head&& head, Tail&&... tail){cout << head << " "; pt(forward<Tail>(tail)...);}
template<class T> void debug(T v){rep(i, v.size()) cout << v[i] << " " ; cout << endl;}
template<class T> void debug2(T v){rep(i, v.size()){rep(j, v[i].size()) cout << v[i][j] << " " ; cout << endl;}}
template<class T1, class T2> long long bcount(T1 v, T2 a){return upper_index(v, a) - lower_index(v, a);} 
template<class T1, class T2> inline bool chmin(T1 &a, T2 b){if(a > b){a = b; return true;} return false;}
template<class T1, class T2> inline bool chmax(T1 &a, T2 b){if(a < b){a = b; return true;} return false;}
template<class T1, class T2> void sortTwoVecter(vector<T1> &f, vector<T2> &s, bool isReverse = false){
    vector<pair<T1, T2>> p;
    rep(i, f.size()) p.emplace_back(make_pair(f[i], s[i]));
    if (!isReverse) sort(p.begin(), p.end());
    else sort(p.rbegin(), p.rend());
    rep(i, f.size()) tie(f[i], s[i]) = p[i];
    return;
}

int main(){
    ll N; cin >> N;
    vector<string> S(N);
    rep(i, N) cin >> S[i];
    vector<ll> lowest(N, 0), point(N);
    rep(i, N){
        ll cnt = 0;
        rep(j, S[i].size()){
            if (S[i][j] == '(') cnt++;
            else cnt--;
            chmin(lowest[i], cnt);
        }
        point[i] = cnt;
    }
    vector<ll> uplowest, uppoint, downlowest, downpoint;
    rep(i, N){
        if (0 <= point[i]){
            uplowest.push_back(lowest[i]);
            uppoint.push_back(point[i]);
        }else{
            downlowest.push_back(lowest[i]);
            downpoint.push_back(point[i]);
        }
    }
    rep(i, downlowest.size()){
        downlowest[i] -= downpoint[i];
        downpoint[i] *= -1;
    }
    sortTwoVecter(uplowest, uppoint, true);
    sortTwoVecter(downlowest, downpoint, true);
    ll upcurr = 0, downcurr = 0;
    // debug(uplowest);
    // debug(uppoint);
    // debug(downlowest);
    // debug(downpoint);
    rep(i, uplowest.size()){
        if (upcurr + uplowest[i] < 0){
            pt("No");
            return 0;
        }
        upcurr += uppoint[i];
        if (upcurr < 0){
            pt("No");
            return 0;
        }
    }
    rep(i, downlowest.size()){
        if (downcurr + downlowest[i] < 0){
            pt("No");
            return 0;
        }
        downcurr += downpoint[i];
        if (downcurr < 0){
            pt("No");
            return 0;
        }
    }
    pt(upcurr == downcurr ? "Yes" : "No");
}

Measured memory_bytes: 81796