#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <utility>
#include <tuple>
#include <cstdint>
#include <cstdio>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <deque>
#include <unordered_map>
#include <unordered_set>
#include <bitset>
#include <cctype>
#include <functional>
#include <ctime>
#include <cmath>
#include <limits>
#include <numeric>
#include <type_traits>
using namespace std;
using ll = long long;

unsigned euclidean_gcd(unsigned a, unsigned b) {
    if (a < b) return euclidean_gcd(b, a);
    unsigned r;
    while ((r = a % b)) {
        a = b;
        b = r;
    }
    return b;
}

class UnionFind {
public:
    vector <ll> par;
    vector <ll> siz;
    UnionFind(ll sz_) : par(sz_), siz(sz_, 1LL) {
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    void init(ll sz_) {
        par.resize(sz_);
        siz.assign(sz_, 1LL);
        for (ll i = 0; i < sz_; ++i) par[i] = i;
    }
    ll root(ll x) {
        while (par[x] != x) {
            x = par[x] = par[par[x]];
        }
        return x;
    }
    bool merge(ll x, ll y) {
        x = root(x);
        y = root(y);
        if (x == y) return false;
        if (siz[x] < siz[y]) swap(x, y);
        siz[x] += siz[y];
        par[y] = x;
        return true;
    }

    bool issame(ll x, ll y) {
        return root(x) == root(y);
    }

    ll size(ll x) {
        return siz[root(x)];
    }
};

long long modpow(long long a, long long n, long long mod) {
    long long res = 1;
    while (n > 0) {
        if (n & 1) res = res * a % mod;
        a = a * a % mod;
        n >>= 1;
    }
    return res;
}

long long modinv(long long a, long long mod) {
    return modpow(a, mod - 2, mod);
}

int main() {
    ll n;
    cin >> n;
    string ans = "Yes";
    vector<pair<ll, ll>> z(n);
    vector<pair<ll, ll>> zz(n);
    vector<pair<ll, ll>> pl;
    vector<pair<ll, ll>> mn;
    int f = 0;
    for (int i = 0; i < n; i++) {
        string s;
        cin >> s;
        int p = 0;
        int q = 0;
        for (int j = 0; j < s.size(); j++) {
            if (s.at(j) == '(') {
                p++;
                f++;
            }
            else {
                p--; 
                f--;
            }
            q = min(p, q);
        }
        int pp = 0;
        int qq = 0;
        for (int j = 0; j < s.size(); j++) {
            if (s.at(s.size()-j-1) == ')')pp++;
            else pp--;
            qq = min(pp, qq);
        }
        q *= -1;
        qq *= -1;
        z.at(i).second = p;
        z.at(i).first = q;
        zz.at(i).second = pp;
        zz.at(i).first = qq;
        if (p >= 0)pl.push_back(z.at(i));
        if (pp >= 0)mn.push_back(zz.at(i));
    }
    sort(pl.begin(), pl.end());
    sort(mn.begin(), mn.end());
    int mm=0;
    for (int i = 0; i < pl.size(); i++) {
        if (pl.at(i).first > mm) {
            ans = "No";
            
        }
        else { mm += pl.at(i).second; }
    }
    int ou=0;
    for (int i = 0; i < mn.size(); i++) {
        if (mn.at(i).first > ou)ans = "No";
        else ou += mn.at(i).second;
    }
    if (f != 0)ans = "No";
    cout << ans << endl;
}

Measured memory_bytes: 50256