//include
//------------------------------------------
#include <vector>
#include <list>
#include <map>
#include <unordered_map>
#include <climits>
#include <set>
#include <unordered_set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#include <queue>
#include <random>
#include <chrono>
#include <complex>
#include <regex>
#include <locale>
#include <random>
#include <cassert>
#include <type_traits>

using namespace std;

// typedef
//------------------------------------------
typedef long long LL;
typedef vector<int> VI;
typedef vector<bool> VB;
typedef vector<char> VC;
typedef vector<double> VD;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef vector<VI> VVI;
typedef vector<VB> VVB;
typedef vector<VS> VVS;
typedef vector<VLL> VVLL;
typedef vector<VVI> VVVI;
typedef vector<VVLL> VVVLL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef pair<int, string> PIS;
typedef pair<string, int> PSI;
typedef pair<string, string> PSS;
typedef vector<PII> VPII;
typedef vector<PLL> VPLL;
typedef vector<VPII> VVPII;
typedef vector<VPLL> VVPLL;
typedef vector<VS> VVS;
typedef map<int, int> MII;
typedef map<LL, LL> MLL;
typedef map<string, int> MSI;
typedef map<int, string> MIS;

// container util
//------------------------------------------

#define ALL(a)  (a).begin(),(a).end()
#define SZ(a) int((a).size())
#define EACH(i, arr) for(typeof((arr).begin()) i=(arr).begin(); i!=(arr).end(); ++i)
#define EXIST(str, e) ((str).find(e)!=(str).end())
#define COUNT(arr, v) count((arr).begin(), (arr).end(), v)
#define SEARCH(v, w) search((v).begin(), (v).end(), (w).begin(), (w).end())
#define SORT(c) sort((c).begin(),(c).end())
#define RSORT(c) sort((c).rbegin(),(c).rend())
#define REVERSE(c) reverse((c).begin(), (c).end())
#define ROTATE_LEFT(arr, c) rotate((arr).begin(), (arr).begin()+(c), (arr).end())
#define ROTATE_RIGHT(arr, c) rotate((arr).rbegin(), (arr).rbegin() + (c), (arr).rend())
#define SUMI(arr) accumulate((arr).begin(), (arr).end(), 0)
#define SUMD(arr) accumulate((arr).begin(), (arr).end(), 0.)
#define SUMLL(arr) accumulate((arr).begin(), (arr).end(), 0LL)
#define MULD(arr) accumulate((arr).begin(), (arr).end(), 1., multiplies<double>())
#define UB(arr, n) upper_bound((arr).begin(), (arr).end(), n)
#define LB(arr, n) lower_bound((arr).begin(), (arr).end(), n)
#define PB push_back
#define MP make_pair
#define ft first
#define sd second


// input output
//------------------------------------------
#define GL(s) getline(cin, (s))
#define INIT() std::ios::sync_with_stdio(false);std::cin.tie(0)
#define OUT(d) std::cout<<(d)
#define OUT_L(d) std::cout<<(d)<<endl
#define FOUT(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)
#define FOUT_L(n, data) std::cout<<std::fixed<<std::setprecision(n)<<(data)<<"\n"
#define EL() printf("\n")
#define SHOW_VECTOR(v) {std::cerr << #v << "\t:";for(const auto& xxx : v){std::cerr << xxx << " ";}std::cerr << "\n";}
#define SHOW_MAP(v) {std::cerr << #v << endl; for(const auto& xxx: v){std::cerr << xxx.first << " " << xxx.second << "\n";}}
#define Yes() printf("Yes\n")
#define No() printf("No\n")
#define YES() printf("YES\n")
#define NO() printf("NO\n")
#define Yay() printf("Yay!\n")
#define Nnn() printf(":(\n")
#define CE(x, y) ((x + y - 1) / (y))


template<typename T1, typename T2>
istream &operator>>(istream &in, pair<T1, T2> &p) {
    in >> p.first >> p.second;
    return in;
}

template<typename T>
istream &operator>>(istream &in, vector<T> &v) {
    for (auto &x: v)
        in >> x;
    return in;
}


template<typename T1, typename T2>
ostream &operator<<(ostream &out, const std::pair<T1, T2> &p) {
    out << "[" << p.first << ", " << p.second << "]" << "\n";
    return out;
}

template<class T1, class T2>
inline bool chmin(T1 &a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}

template<class T1, class T2>
inline bool chmax(T1 &a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}


//repetition
//------------------------------------------
#define FOR(i, a, b) for(int i=(a);i<(b);++i)
#define RFOR(i, a, b) for(int i=(b)-1;i>=(a);--i)
#define REP(i, n)  FOR(i,0,n)
#define RREP(i, n) for(int i = n-1;i >= 0;i--)
#define FORLL(i, a, b) for(LL i=LL(a);i<LL(b);++i)
#define RFORLL(i, a, b) for(LL i=LL(b)-1;i>=LL(a);--i)
#define REPLL(i, n) for(LL i=0;i<LL(n);++i)
#define RREPLL(i, n) for(LL i=LL(n)-1;i>=0;--i)
#define FOREACH(x, arr) for(auto &(x) : (arr))

// Option + Control + K  Terminal
// Command + Control + K    Run
// Command + b   EOF



//------------------------------------------
//------------------------------------------


int main() {

    int N;
    cin >> N;

    vector<string> S(N);
    cin >> S;
    vector<string> T = S;
    REP(i, N) REVERSE(T[i]);

    auto which = [&](int i) {
        int left = count(S[i].begin(), S[i].end(), '(');
        int right = count(S[i].begin(), S[i].end(), ')');
        return left - right;
    };

    auto is_good_as_left = [&](int x) {
        int cnt = 0;
        for (int i = 0; i < S[x].size(); i++) {
            if (S[x][i] == '(') cnt++;
            else {
                cnt--;
                if (cnt < 0) return false;
            }
        }
        return true;
    };

    auto how_bad_left = [&](int x) {
        int bad = 0;
        int cnt = 0;
        for (int i = 0; i < S[x].size(); i++) {
            if (S[x][i] == '(') cnt++;
            else {
                cnt--;
                if (cnt < 0) {
                    chmin(bad, cnt);
                }
            }
        }
        return bad;
    };

    auto is_good_as_right = [&](int x) {
        int cnt = 0;
        for (int i = 0; i < T[x].size(); i++) {
            if (T[x][i] == ')') cnt++;
            else {
                cnt--;
                if (cnt < 0) return false;
            }
        }
        return true;
    };

    auto how_bad_right = [&](int x) {
        int bad = 0;
        int cnt = 0;
        for (int i = 0; i < T[x].size(); i++) {
            if (T[x][i] == ')') cnt++;
            else {
                cnt--;
                if (cnt < 0) {
                    chmin(bad, cnt);
                }
            }
        }
        return bad;
    };

    // good cnt
    vector<pair<int, int>> W(N);

    for (int i = 0; i < N; i++) {
        int w = which(i);
        if (w > 0) {
            int b = is_good_as_left(i);
            W[i] = MP(b, w);
        }
        if (w == 0) {
            W[i] = MP(1, w);
        }
        if (w < 0) {
            int b = is_good_as_right(i);
            W[i] = MP(b, w);
        }
    }

    string ans = "";

    // left good
    for (int i = 0; i < N; i++) {
        if (W[i].second > 0 and W[i].first) {
            ans += S[i];
        }
    }
    // left bad
    {
        vector<pair<int, int>> P;
        for (int i = 0; i < N; i++) {
            if (W[i].second > 0 and W[i].first == 0) {
                P.push_back(MP(-how_bad_left(i), i));
            }
        }
        SORT(P);
        for (auto x: P) {
            ans += S[x.second];
        }
    }
    // normal
    for (int i = 0; i < N; i++) {
        if (W[i].second == 0) {
            ans += S[i];
        }
    }

    // right bad
    {
        vector<pair<int, int>> P;
        for (int i = 0; i < N; i++) {
            if (W[i].second < 0 and W[i].first == 0) {
                P.push_back(MP(-how_bad_right(i), i));
            }
        }
        RSORT(P);
        for (auto x: P) {
            ans += S[x.second];
        }
    }


    // right good
    for (int i = 0; i < N; i++) {
        if (W[i].second < 0 and W[i].first) {
            ans += S[i];
        }
    }

    bool good = true;
    int cnt = 0;
    for (int i = 0; i < ans.size(); i++) {
        if (ans[i] == '(') cnt++;
        else {
            cnt--;
            if (cnt < 0) good = false;
        }
    }

    if (cnt != 0) good = false;

    if (good)Yes();
    else
        No();

    return 0;
}




































































Measured memory_bytes: 75604