#line 2 "header.hpp"

//%snippet.set('header')%
//%snippet.fold()%
#ifndef HEADER_H
#define HEADER_H

// template version 2.0
using namespace std;
#include <bits/stdc++.h>

// varibable settings
const long long INF = 1e18;

#define _overload3(_1, _2, _3, name, ...) name
#define _rep(i, n) repi(i, 0, n)
#define repi(i, a, b) for (ll i = (ll)(a); i < (ll)(b); ++i)
#define rep(...) _overload3(__VA_ARGS__, repi, _rep, )(__VA_ARGS__)
#define _rrep(i, n) rrepi(i, 0, n)
#define rrepi(i, a, b) for (ll i = (ll)((b)-1); i >= (ll)(a); --i)
#define r_rep(...) _overload3(__VA_ARGS__, rrepi, _rrep, )(__VA_ARGS__)
#define each(i, a) for (auto &&i : a)
#define all(x) (x).begin(), (x).end()
#define sz(x) ((int)(x).size())
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)
#define mt(...) make_tuple(__VA_ARGS__)
#define ub upper_bound
#define lb lower_bound
#define lpos(A, x) (lower_bound(all(A), x) - A.begin())
#define upos(A, x) (upper_bound(all(A), x) - A.begin())
template <class T>
inline void chmax(T &a, const T &b) {
    if ((a) < (b)) (a) = (b);
}
template <class T>
inline void chmin(T &a, const T &b) {
    if ((a) > (b)) (a) = (b);
}

#define divceil(a, b) ((a) + (b)-1) / (b)
#define is_in(x, a, b) ((a) <= (x) && (x) < (b))
#define uni(x)    \
    sort(all(x)); \
    x.erase(unique(all(x)), x.end())
#define slice(l, r) substr(l, r - l)

typedef long long ll;
typedef vector<ll> vi;
typedef vector<vi> vvi;
typedef long double ld;
typedef pair<ll, ll> pii;
typedef tuple<ll, ll, ll> iii;

template <typename T>
using PQ = priority_queue<T, vector<T>, greater<T>>;
struct Fast {
    Fast() {
        std::cin.tie(0);
        ios::sync_with_stdio(false);
    }
} fast;
void check_input() {
    assert(cin.eof() == 0);
    int tmp;
    cin >> tmp;
    assert(cin.eof() == 1);
}

#if defined(PCM) || defined(LOCAL)
#else
#define dump(...) ;
#define dump_1d(...) ;
#define dump_2d(...) ;
#define cerrendl ;
#endif

#endif /* HEADER_H */
//%snippet.end()%
#line 2 "solve2.cpp"

int main(){
    int n;cin>>n;
    vi min(n), total(n);
    vector<pii> fh;
    vector<pii> sh;
    rep(i, n){
        string s;cin>>s;
        int m = sz(s);
        rep(j, m){
            if (s[j]=='('){
                total[i]++;
            }
            if (s[j]==')'){
                total[i]--;
                chmin(min[i], total[i]);
            }
        }
        if (total[i]>0) fh.pb(mp(min[i], total[i]));
        else sh.pb(mp(min[i], total[i]));
    }
    dump(total);
    dump(accumulate(all(total), 0LL));
    if (accumulate(all(total), 0LL)!=0){
        cout << "No" << endl;
        return 0;
    }

    sort(all(fh), [&](auto &l, auto &r){return l.first > r.first;});
    sort(all(sh), [&](auto &l, auto &r){return l.second-l.first > r.second-r.first;});
    dump(fh);
    dump(sh);

    int cur = 0;
    rep(i, sz(fh)){
        auto [m, t] = fh[i];
        if (cur+m<0){
            cout << "No" << endl;
            return 0;
        }
        cur += t;
    }
    rep(i, sz(sh)){
        auto [m, t] = sh[i];
        if (cur+m<0){
            cout << "No" << endl;
            return 0;
        }
        cur += t;
    }
    cout << "Yes" << endl;
    return 0;
}


Measured memory_bytes: 34636