#include "vector"
#include "set"
#include "map"
#include "unordered_set"
#include "unordered_map"
#include "string"
#include "iostream"
#include "algorithm"
#include "queue"

using namespace std;

#define ll long long
#define INF 2e9
#define INF2 4611686018427387904
//#define MOD 1000000007
#define MOD 998244353
#define MAX_SIZE 1000000000

typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

template<typename T>
ostream& operator<<(ostream& os, const vector<T>& v) { bool first = true; for (const auto& j: v) { if (!first) { os << " "; } first = false; os <<j; } os << "\n"; return os; }
template<typename T>
istream& operator>>(istream& is, vector<T>& v) { for (auto& elem : v) { is >> elem; } return is; }

vector<ll> f;
void set_f(int n) { f.resize(n+1); f[0] = 1; for (int i=1; i<= n; i++) { f[i] = (f[i-1] * i) % MOD;} }
ll gcd(ll a, ll b) { if (b == 0) { return a; } else { return gcd(b, a % b); } }
ll pw(ll x, ll n, ll m=MOD) { if (n == 0) { return 1;} if (n%2 == 0) { return pw((x*x) % m, n/2, m); } return (pw(x, n-1, m) * x) % m; }
ll dv(ll a, ll b) { return (a * pw(b, MOD - 2)) % MOD; }
ll c_n_k(int n, int k) { if (k > n) { return 0; } if (k < 0) { return 0; } return dv(dv(f[n], f[k]), f[n-k]); }

ll phi (ll n) {
    ll result = n;
    for (ll i=2; i*i<=n; ++i) {
        if (n % i == 0) {
            while (n % i == 0) {
                n /= i;
            }
            result -= result / i;
        }
    }
    if (n > 1) {
        result -= result / n;
    }
    return result;
}

void solve() {
    int n;
    cin >> n;

    vector<pii> plus;
    vector<pii> minus;
    vi zero;

    for (int i=0; i<n; i++) {
        int mi = 0;
        int sum = 0;
        string s;
        cin >> s;
        for (char c : s) {
            if (c == '(') {
                sum++;
            } else {
                sum--;
            }
            mi = min(mi, sum);
        }

        if (sum > 0) {
            plus.push_back(pii(mi, sum));
        } else if (sum == 0) {
            zero.push_back(mi);
        } else {
            minus.push_back(pii(sum - mi, mi));
        }
    }

    sort(plus.begin(), plus.end());
    int cur = 0;
    for (int i=plus.size() - 1; i >= 0; i--) {
        if (cur + plus[i].first < 0) {
            cout << "No";
            return;
        }
        cur += plus[i].second;
    }

    for (int z : zero) {
        if (cur + z < 0) {
            cout << "No";
            return;
        }
    }


    sort(minus.begin(), minus.end());
    for (int i=minus.size() - 1; i>=0; i--) {
        if (cur + minus[i].second < 0) {
            cout << "No";
            return;
        }
        cur += minus[i].second + minus[i].first;
    }

    if (cur == 0) {
        cout << "Yes";
    } else {
        cout << "No";
    }
}


int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);

    if (0) {
        int tests;
        cin >> tests;
        for (int t = 1; t <= tests; t++) {
            //cout << "Case #" << t << ": ";
            solve();
            cout << "\n";
        }
    } else {
        solve();
        cout << endl;
    }

    return 0;
}

Measured memory_bytes: 11232