#include <bits/stdc++.h>

using i32 = int_fast32_t;
using i64 = int_fast64_t;
using u32 = uint_fast32_t;
using u64 = uint_fast64_t;
using f64 = double;
using f80 = long double;

#define FOR(v, a, b) for(i64 v = (a); v < (b); ++v)
#define FORE(v, a, b) for(i64 v = (a); v <= (b); ++v)
#define REP(v, n) FOR(v, 0, n)
#define REPE(v, n) FORE(v, 0, n)
#define REV(v, a, b) for(i64 v = (a); v >= (b); --v)
#define ALL(x) (x).begin(), (x).end()
#define RALL(x) (x).rbegin(), (x).rend()
#define ITR(it, c) for(auto it = (c).begin(); it != (c).end(); ++it)
#define RITR(it, c) for(auto it = (c).rbegin(); it != (c).rend(); ++it)
#define EXIST(c,x) ((c).find(x) != (c).end())
#define fst first
#define snd second
#define UNIQ(v) (v).erase(unique(ALL(v)), (v).end())
#define bit(i) (1LL<<(i))

#ifdef DEBUG
#include <Mylib/Debug/debug.cpp>
#else
#define dump(...) ((void)0)
#endif

using namespace std;

template <typename I> void join(ostream &ost, I s, I t, string d=" "){for(auto i=s; i!=t; ++i){if(i!=s)ost<<d; ost<<*i;}ost<<endl;}
template <typename T> istream& operator>>(istream &is, vector<T> &v){for(auto &a : v) is >> a; return is;}
template <typename T> void pout(const T &value){std::cout << value << "\n";}
template <typename T, typename ...Args> void pout(const T &value, const Args&... args){std::cout << value << " ";pout(args...);}

template <typename T, typename U> bool chmin(T &a, const U &b){return (a>b ? a=b, true : false);}
template <typename T, typename U> bool chmax(T &a, const U &b){return (a<b ? a=b, true : false);}
template <typename T, size_t N, typename U> void fill_array(T (&a)[N], const U &v){fill((U*)a, (U*)(a+N), v);}
template <typename T> auto make_vector(int n, int m, const T &value){return vector<vector<T>>(n, vector<T>(m, value));}


struct Init{
  Init(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(12);
    cerr << fixed << setprecision(12);
  }
}init;


string simplify(string s){
  stack<char> st;

  for(auto c : s){
    if(st.empty()){
      st.push(c);
    }else{
      if(st.top() == '(' and c == ')'){
        st.pop();
      }else{
        st.push(c);
      }
    }
  }

  string res;

  while(st.size()){
    res += st.top(); st.pop();
  }

  reverse(ALL(res));

  return res;
}

bool check(string s){
  stack<char> st;

  for(auto c : s){
    if(st.empty()){
      st.push(c);
    }else{
      if(st.top() == '(' and c == ')'){
        st.pop();
      }else{
        st.push(c);
      }
    }
  }

  return st.empty();
}


pair<int,int> f(pair<int,int> x, pair<int,int> y){
  auto [a,b] = x;
  auto [c,d] = y;

  int z = min(b, c);
  
  return {a + max(0, c-z), d + max(0, b-z)};
}



int main(){
  int N;

  while(cin >> N){
    vector<string> S(N); cin >> S;

    REP(i,N){
      S[i] = simplify(S[i]);
    }

    dump(S);


    string a, b, c;
    vector<pair<int,int>> p;
    REP(i,N){
      if(S[i] != ""){
        if(S[i] == string(S[i].size(), '(')){
          a += S[i];
        }else if(S[i] == string(S[i].size(), ')')){
          c += S[i];
        }else{
          p.emplace_back(count(ALL(S[i]), ')'), count(ALL(S[i]), '('));
        }
      }
    }

    dump(p);

    

    


    



    
    
    sort(
      ALL(p),
      [](const auto &a, const auto &b){
        return (a.fst - a.snd) < (b.fst - b.snd);
      }
    );

    dump(p);

    for(auto [l, r] : p){
      b += string(l, ')');
      b += string(r, '(');
    }

    string t = a + b + c;

    dump(t);
    bool ok = check(t);


    pout(ok ? "Yes" : "No");
  }
  
  return 0;
}


Measured memory_bytes: 38016