#include <bits/stdc++.h>
 
using namespace std;
 
using i64 = long long;
#define forn(a, e) for (i64 a = 0; a < (i64)(e); a++)
#define forr(a, s, e) for (i64 a = s; a < (i64)(e); a++)
#define fore(e, a) for (auto& e : a)
 
#ifdef LOCAL
#define logv(a) {cerr << #a << " = "; fore(e, a) {cerr << e << " ";} cerr << "\n";}
#define logvp(a) {cerr << #a << " = "; fore(e, a) {cerr << "(" << e.first << ", " << e.second << ") ";} cerr << "\n";}
#define logvv(a) {cerr << #a << " = \n"; fore(r, a) { fore(e, r) {cerr << e << " ";} cerr << "\n";} }
#define logvf(a, field) {cerr << #a"."#field << " = \n"; fore(e, a) { cerr << e.field << " ";} cerr << "\n"; }
#define logvff(a, f1, f2) {cerr << #a".{"#f1 << ", "#f2 << "} = \n"; fore(e, a) { cerr << "(" << e.f1 <<", " << e.f2 << ") ";} cerr << "\n"; }
#define logs(a) cerr << #a << " = " << (a) << "\n";
#define logss(a, b) cerr << #a << " = " << (a) << ", " << #b << " = " << (b) << "\n";
#define logp(a) cerr << #a << " = " << "(" << a.first << ", " << a.second << ")" << "\n";
#define cond(pred, stmt) if (pred) { stmt }
#else
#define logv(a)
#define logvp(a)
#define logvv(a)
#define logvf(a, field)
#define logvff(a, f1, f2)
#define logs(a)
#define logss(a, b)
#define logp(a)
#define cond(pred, stmt)
#endif
 
using iip = pair<int, int>;
using llp = pair<i64, i64>;
using ivec = vector<int>;
using llvec = vector<i64>;
using svec = vector<string>;
template<typename T> using vec = vector<T>;
 
template<typename T, typename Dim>
auto make_vec(T value, Dim dim) { return vector<T>(dim, value); }
template<typename T, typename Dim1, typename... Dim>
auto make_vec(T value, Dim1 dim1, Dim... dims) { return make_vec(make_vec(value, dims...), dim1); }
 
template<typename T>
bool uax(T& v, const T& newv) { if (v < newv) { v = newv; return true; } else return false; }
template<typename T>
bool uin(T& v, const T& newv) { if (v > newv) { v = newv; return true; } else return false; }
 
template<typename T>
istream& operator>>(istream& is, vector<T>& c) { for (auto& e : c) is >> e; return is; }
template<typename T, size_t N>
istream& operator>>(istream& is, array<T, N>& c) { for (auto& e : c) is >> e; return is; }
 
template<typename ...T>
istream& read(T&... args) { return (cin >> ... >> args); }
 
static mt19937 rande(123123);
template<typename T>
T rand_int(T from, T to) { uniform_int_distribution<T> distr(from, to); return distr(rande); }
 
constexpr int INF = 1e9;
constexpr int MXB = 20;
using bin = bitset<MXB>;
constexpr i64 M = 998244353;
 
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    rande.seed(chrono::steady_clock::now().time_since_epoch().count());
    
    int n;
    while (read(n)) {
        svec ss(n);
        read(ss);

        auto calc = [](const string& s) {
            iip res{0, 0};
            int n = s.size();
            forn(i, n) {
                res.second += (s[i] == ')' ? -1 : +1);
                uax(res.second, 0);
            }
            for (int i = n - 1; i >= 0; i--) {
                res.first += (s[i] == '(' ? -1 : +1);
                uax(res.first, 0);
            }
            return res;
        };

        vec<iip> ps(n);
        int c01 = 0;
        int c10 = 0;
        int c00 = 0;
        forn(i, n) {
            ps[i] = calc(ss[i]);
            if (ps[i].first == 0 && ps[i].second == 0) {
                c00++;
            } else if (ps[i].first == 0) {
                c01++;
            } else {
                c10++;
            }
        }

        logvp(ps);

        // bool ok = (c00 && c01) || (c10 && c00) || (c10 && c01) || (c00 >= 2);
        // if (!ok) {
        //     cout << "No" << endl;
        //     continue;
        // }
        bool ok = true;
        vec<iip> b;
        vec<iip> e;
        vec<iip> c1;
        vec<iip> c2;
        forn(i, n) {
            if (ps[i].first == 0) {
                b.push_back(ps[i]);
            } else if (ps[i].second == 0) {
                e.push_back(ps[i]);
            } else {
                if (ps[i].first < ps[i].second) {
                    c1.push_back(ps[i]);
                } else {
                    c2.push_back(ps[i]);
                }
            }
        }

        sort(c1.begin(), c1.end());
        sort(c2.begin(), c2.end(), [](auto a, auto b) { return a.second > b.second; });

        int bb = 0;
        fore(bi, b) {
            bb += bi.second;
        }
        fore(ci, c1) {
            bb -= ci.first;
            if (bb < 0) {
                ok = false;
                break;
            }
            bb += ci.second;
        }
        fore(ci, c2) {
            bb -= ci.first;
            if (bb < 0) {
                ok = false;
                break;
            }
            bb += ci.second;
        }
        fore(ei, e) {
            bb -= ei.first;
        }
        if (bb != 0) {
            ok = false;
        }

        if (ok) {
            cout << "Yes" << endl;
        } else {
            cout << "No" << endl;
        }
    }
}

Measured memory_bytes: 50256