#pragma region template
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
using ld = long double;
using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vll = vector<ll>;
using vvll = vector<vll>;
using vvvll = vector<vvll>;
using vld = vector<ld>;
using vvld = vector<vld>;
using vvvld = vector<vvld>;
using vs = vector<string>;
using pll = pair<ll, ll>;
using vp = vector<pll>;
template <typename T>
using pqrev = priority_queue<T, vector<T>, greater<T>>;
#define rep(i, n) for (ll i = 0, i##_end = (n); i < i##_end; i++)
#define repb(i, n) for (ll i = (n)-1; i >= 0; i--)
#define repr(i, a, b) for (ll i = (a), i##_end = (b); i < i##_end; i++)
#define reprb(i, a, b) for (ll i = (b)-1, i##_end = (a); i >= i##_end; i--)
#define ALL(a) (a).begin(), (a).end()
#define SZ(x) ((ll)(x).size())
//*
constexpr ll MOD = 1e9 + 7;
/*/
constexpr ll MOD = 998244353;
//*/
constexpr ll INF = 1e+18;
constexpr ld EPS = 1e-12L;
constexpr ld PI = 3.14159265358979323846L;
constexpr ll GCD(ll a, ll b) { return b ? GCD(b, a % b) : a; }
constexpr ll LCM(ll a, ll b) { return a / GCD(a, b) * b; }
template <typename S, typename T>
constexpr bool chmax(S &a, const T &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
template <typename S, typename T>
constexpr bool chmin(S &a, const T &b) {
  if (b < a) {
    a = b;
    return 1;
  }
  return 0;
}
#ifdef OJ_LOCAL
#include "dump.hpp"
#else
#define dump(...) ((void)0)
#endif
template <typename T>
bool print_(const T &a) {
  cout << a;
  return true;
}
template <typename T>
bool print_(const vector<T> &vec) {
  for (auto &a : vec) {
    cout << a;
    if (&a != &vec.back()) {
      cout << " ";
    }
  }
  return false;
}
template <typename T>
bool print_(const vector<vector<T>> &vv) {
  for (auto &v : vv) {
    for (auto &a : v) {
      cout << a;
      if (&a != &v.back()) {
        cout << " ";
      }
    }
    if (&v != &vv.back()) {
      cout << "\n";
    }
  }
  return false;
}
void print() { cout << "\n"; }
template <typename Head, typename... Tail>
void print(Head &&head, Tail &&... tail) {
  bool f = print_(head);
  if (sizeof...(tail) != 0) {
    cout << (f ? " " : "\n");
  }
  print(forward<Tail>(tail)...);
}
#pragma endregion

void Pr(bool f){
  cout << (f ? "Yes" : "No") << "\n";
  exit(0);
}

struct E{
  ll m, e, cat;
  E(ll m, ll e): m(m), e(e){
    if(m >= 0 && e >= 0){
      cat = 1;
    }else if(m < 0 && e >= 0){
      cat = 2;
    }else if(m < e && e < 0){
      cat = 3;
    }else{
      cat = 4;
    }
  }
  bool operator<(const E& r){
    if(cat == r.cat){
      if(cat == 2){
        return m == r.m ? e < r.e : m > r.m;
      }else{
        return m == r.m ? e < r.e : m < r.m;
      }
    }else{
      return cat < r.cat;
    }
  }
};

/*
 * '(' -> +1, ')' -> -1
 * m: ネスト最小値, e: ネスト終端値
 * 優先順
 * 1. m >= 0, e >= 0 自由
 * 2. m < 0, e >= 0  mの降順 同じmの間は自由
 * 3. m < e, e < 0   mの昇順 同じmの間は自由
 * 4. m >= e, e < 0  自由
 */

int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(20);
  ll n;
  cin >> n;
  vs s(n);
  rep(i, n){
    cin >> s[i];
  }
  {
    ll c = 0, d = 0;
    for(auto&& e: s){
      for(auto&& ee: e){
        c += ee == '(';
        d += ee == ')';
      }
    }
    if(c != d) Pr(0);
  }
  vector<E> stat;
  for(auto&& e: s){
    ll mi = 0;
    ll cur = 0;
    for(auto&& ee: e){
      if(ee == '('){
        cur++;
      }else{
        cur--;
      }
      chmin(mi, cur);
    }
    stat.emplace_back(mi, cur);
  }
  sort(ALL(stat));
  for(auto&& e: stat){
    dump(e.m, e.e, e.cat);
  }
  {
    ll mi = 0;
    ll cur = 0;
    for(auto&& e: stat){
      chmin(mi, cur+e.m);
      cur += e.e;
    }
    Pr(mi >= 0);
  }
}


Measured memory_bytes: 59088