#include <bits/stdc++.h>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int,int> ii;
typedef pair<ll,ll> llll;
typedef pair<double,double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a)  int((a).size())
#define pb  push_back
#define eb  emplace_back
#define FOR(var,from,to) for(int var=(from);var<=(to);++var)
#define rep(var,n)  for(int var=0;var<(n);++var)
#define rep1(var,n)  for(int var=1;var<=(n);++var)
#define repC2(vari,varj,n)  for(int vari=0;vari<(n)-1;++vari)for(int varj=vari+1;varj<(n);++varj)
#define repC3(vari,varj,vark,n)  for(int vari=0;vari<(n)-2;++vari)for(int varj=vari+1;varj<(n)-1;++varj)for(int vark=varj+1;vark<(n);++vark)
#define ALL(c)  (c).begin(),(c).end()
#define RALL(c)  (c).rbegin(),(c).rend()
#define tr(i,c)  for(auto i=(c).begin(); i!=(c).end(); ++i)
#define found(s,e)  ((s).find(e)!=(s).end())
#define mset(arr,val)  memset(arr,val,sizeof(arr))
#define mid(x,y) ((x)+((y)-(x))/2)
#define IN(x,a,b) ((a)<=(x)&&(x)<=(b))
#define cons make_pair
#define clamp(v,lo,hi) min(max(v,lo),hi)
#define ABS(x) max((x),-(x))

template<typename T1, typename T2> inline void amin(T1 & a, T2 const & b) { if (a>b) a=b; }
template<typename T1, typename T2> inline void amax(T1 & a, T2 const & b) { if (a<b) a=b; }
template<typename X, typename T> auto vectors(X x, T a) { return vector<T>(x, a); }
template<typename X, typename Y, typename Z, typename... Zs> auto vectors(X x, Y y, Z z, Zs... zs) { auto cont = vectors(y, z, zs...); return vector<decltype(cont)>(x, cont); }

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) { while(a) swap(a, b%=a); return b; }
inline ll lcm(ll a, ll b) { return a/gcd(a,b)*b; }
template <typename T>
inline T mod(T a, T b) { return ((a % b) + b) % b; }

inline ii pat(string& s){
    int L=s.size();
    int minimum=0, level=0;
    rep(i,L){
        if (s[i] == '(') {
            ++level;
        } else if (s[i] == ')'){
            --level;
        }
        amin(minimum, level);
    }
    return ii(level, -min(0,minimum));
}

inline ii rpat(string& s){
    int L=s.size();
    int minimum=0, level=0;
    rep(i,L){
        if (s[L-1-i] == ')') {
            ++level;
        } else if (s[L-1-i] == '('){
            --level;
        }
        amin(minimum, level);
    }
    return ii(level, -min(0,minimum));
}


bool solve(int N, vs& s) {
    vii ups, flats, downs;
    ups.reserve(N); flats.reserve(N); downs.reserve(N);
    int uptotal = 0;
    rep(i,N){
        ii r = pat(s[i]), rr = rpat(s[i]);
        int up = r.first, dig = r.second;
        uptotal += up;
        if (up > 0) ups.emplace_back(dig, up);
        else if (up < 0) {
            int up = rr.first, dig = rr.second;
            downs.emplace_back(dig, up);
        }
        else flats.emplace_back(dig, up);
    }
    if (uptotal != 0) return false;

    sort(ALL(ups));
    sort(ALL(downs));
    int U=ups.size(), F=flats.size(), D=downs.size();
    assert(U+F+D == N);
    int lev = 0;
    rep(i,U){
        int up=ups[i].second, dig=ups[i].first;
        assert(up > 0);
        if (lev < dig) return false;
        lev += up;
    }
    rep(i,F){
        int up=flats[i].second, dig=flats[i].first;
        assert(up == 0);
        if (lev < dig) return false;
    }
    int rlev = 0;
    rep(i,D){
        int up=downs[i].second, dig=downs[i].first;
        assert(up < 0);
        if (rlev < dig) return false;
        rlev += up;
    }
    assert(rlev == lev);
    return true;
}

int main() {
   ios_base::sync_with_stdio(false);
   cin.tie(NULL);
   int N; cin >> N;
   vs s(N);
   rep(i,N) cin >> s[i];
   cout << (solve(N,s) ? "Yes":"No") << endl;
   return 0;
}


Measured memory_bytes: 42284