#include <bits/stdc++.h>
#define int long long
#define ll long long
using ull = unsigned long long;
using namespace std;
#define dump(x)                             \
    if (dbg) {                              \
        cerr << #x << " = " << (x) << endl; \
    }
#define overload4(_1, _2, _3, _4, name, ...) name
#define FOR1(n) for (ll i = 0; i < (n); ++i)
#define FOR2(i, n) for (ll i = 0; i < (n); ++i)
#define FOR3(i, a, b) for (ll i = (a); i < (b); ++i)
#define FOR4(i, a, b, c) for (ll i = (a); i < (b); i += (c))
#define FOR(...) overload4(__VA_ARGS__, FOR4, FOR3, FOR2, FOR1)(__VA_ARGS__)
#define FORR(i, a, b) for (int i = (a); i <= (b); ++i)
#define bit(n, k) ((n >> k) & 1) /*nのk bit目*/
namespace mydef {
const int INF = 1ll << 60;
const int MOD = 1e9 + 7;
template <class T>
bool chmin(T& a, const T& b) {
    if (a > b) {
        a = b;
        return 1;
    } else
        return 0;
}
template <class T>
bool chmax(T& a, const T& b) {
    if (a < b) {
        a = b;
        return 1;
    } else
        return 0;
}
void Yes(bool flag = true) {
    if (flag)
        cout << "Yes" << endl;
    else
        cout << "No" << endl;
}
void No(bool flag = true) {
    Yes(!flag);
}
void YES(bool flag = true) {
    if (flag)
        cout << "YES" << endl;
    else
        cout << "NO" << endl;
}
void NO(bool flag = true) {
    YES(!flag);
}
template <typename A, size_t N, typename T>
void Fill(A (&array)[N], const T& val) {
    std::fill((T*)array, (T*)(array + N), val);
}
bool dbg = false;
}  // namespace mydef
using namespace mydef;
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define lb lower_bound
#define ub upper_bound
#define all(v) (v).begin(), (v).end()
#define SZ(x) ((int)(x).size())
#define vi vector<int>
#define vvi vector<vector<int>>
#define vp vector<pair<int, int>>
#define vvp vector<vector<pair<int, int>>>
#define pi pair<int, int>
//#define P pair<int, int>
//#define V vector<int>
//#define S set<int>
#define asn ans

int N;
vector<string> S;

void solve() {
    vector<pi> V_up, V_dw;
    vi V_ho;
    FOR (N) {
        int cnt = 0, MIN = 0;
        for (auto& c : S[i]) {
            cnt += c;
            chmin(MIN, cnt);
        }
        if (cnt > 0) {
            V_up.pb({-MIN, cnt});
        } else if (cnt == 0) {
            V_ho.pb(-MIN);
        } else
            V_dw.pb({cnt - MIN, -cnt});
    }
    sort(all(V_up));
    sort(all(V_dw));
    sort(all(V_ho));

    bool flag = false;
    int l = 0, r = 0;
    for (auto p : V_up) {
        if (p.first <= l) {
            l += p.second;
        } else {
            No();
            return;
        }
    }
    for (auto p : V_dw) {
        if (p.first <= r) {
            r += p.second;
        } else {
            No();
            return;
        }
    }
    if (l == r) {
        if ((int)V_ho.size() == 0 || l >= V_ho[(int)V_ho.size() - 1])
            flag = true;
        else
            flag = false;
    } else
        flag = false;
    Yes(flag);
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cin >> N;
    S.resize(N);
    FOR (N) {
        cin >> S[i];
        for (auto& c : S[i])
            if (c == '(')
                c = 1;
            else
                c = -1;
    }

    solve();
    return 0;
}


Measured memory_bytes: 50228