#include <iostream>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <cmath>
#include <numeric>
#include <iomanip>
#include <stack>
#include <complex>
#include <functional>
#include <tuple>

using namespace std;

#define Rep(i,a,b) for(ll i = a; i < b; ++i)
#define rep(i,b) Rep(i,0,b)
#define allof(a) (a).begin(), (a).end()

#define Yes(q) ((q) ? "Yes" : "No")
#define YES(q) ((q) ? "YES" : "NO")
#define Possible(q) ((q) ? "Possible" : "Impossible")
#define POSSIBLE(q) ((q) ? "POSSIBLE" : "IMPOSSIBLE")

using ll = long long;

constexpr int inf = 1e9 + 7;
constexpr ll infll = 1ll << 60ll;
constexpr ll mod = 998244353;
// 0~3までは右左下上 4~7までは斜め
constexpr int dx[] = { 1, 0, -1, 0, 1, 1, -1, -1 };
constexpr int dy[] = { 0, -1, 0, 1, 1, -1, -1, 1 };

namespace {
    template<typename T> bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
    template<typename T> bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }

    void Cout(long long x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const T& x, const char* end = "\n") { std::cout << x << end; }
    template <typename T> void Cout(const std::vector<T>& x, const char* sep = " ", const char* end = "\n") { for (std::size_t i = 0, sz = x.size(); i < sz; ++i) { std::cout << x[i] << (i == sz - 1 ? end : sep); } }

    // 標準入出力
    struct inp {
        std::size_t szi, szj;
        inp(std::size_t _szi = 1, std::size_t _szj = 1) : szi(_szi), szj(_szj) {}
        template <typename T> operator T () const { T a; std::cin >> a; return a; }
        template <typename T> operator std::vector<T>() const { std::vector<T> a(szi); for (std::size_t i = 0; i < szi; ++i) std::cin >> a[i]; return a; }
        template <typename T> operator std::vector<std::vector<T>>() const {
            std::vector<std::vector<T>> a(szi, std::vector<T>(szj));
            for (std::size_t i = 0; i < szi; ++i) for (std::size_t j = 0; j < szj; ++j) cin >> a[i][j]; return a;
        }
    };
    inp inp1;

    struct Info {
        int left, right;

        Info() = default;
        Info(int left, int right) : left(left), right(right) {};

        bool operator< (const Info& rhs) const {
            double lv, rv;
            if (left == 0) return false;
            if (rhs.left == 0) return true;
            lv = (double)right / left;
            rv = (double)rhs.right / rhs.left;
            return lv < rv;
        }
    };
}

int main() {

    int n = inp1;
    vector<string> s = inp(n);

    using pint = pair<int, int>;
    vector<pint> v(n);
    rep(i, n) {
        int left = 0;
        int right = 0;
        rep(j, s[i].length()) {
            if (s[i][j] == ')') {
                if (right >= 1) --right;
                else ++left;
            }
            else {
                ++right;
            }
        }

        v[i] = make_pair(left, right);
    }

    // 左に一気に押し寄せてきたらヤバイ
    sort(allof(v));

    int right = 0;
    bool ok = true;
    priority_queue<Info> que;
    for (auto [l, r] : v) {
        if (l == 0) right += r;
        else {
            que.emplace(Info(l, r));
        }
    }

    vector<Info> buf;
    while(!que.empty()) {
        Info info = que.top();
        que.pop();
        if (right < info.left) {
            buf.emplace_back(info);
        }
        else {
            right -= info.left;
            right += info.right;
            rep(i, buf.size()) {
                auto copy = buf[i];
                que.emplace(copy);
            }
            buf.clear();
        }
    }

    ok &= (right == 0 && buf.size() == 0);

    Cout(Yes(ok));

    // 間に合わんよなぁ

    return 0;
}


Measured memory_bytes: 46400