#pragma target("avx")
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef unordered_map<ll, ll> U_MAP;
typedef priority_queue<ll> pq;
typedef priority_queue<ll, vector<ll>, greater<ll>> rpq;
constexpr ll INF = 1e9, MOD = 1e9 + 7, ohara = 1e6 + 10;
constexpr ll LINF = 1e18;

#define rep(i, n) for (ll(i) = 0; (i) < (int)(n); (i)++)
#define rrep(i, a, b) for (ll i = (a); i < (b); i++)
#define rrrep(i, a, b) for (ll i = (a); i >= (b); i--)
#define all(v) (v).begin(), (v).end()
#define Size(n) (n).size()
#define Cout(x) cout << (x) << endl
#define doublecout(a) cout << fixed << setprecision(15) << a << endl;
#define fi first
#define se second
#define m_p make_pair
#define p_b push_back
string to_string(string s) { return '"' + s + '"'; }
string to_string(const char* s) { return to_string((string)s); }
string to_string(bool b) { return (b ? "true" : "false"); }
template <typename A, typename B>
string to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
template <typename A>
string to_string(A v) {
  bool first = true;
  string res = "{";
  for (const auto& x : v) {
    if (!first) {
      res += ", ";
    }
    first = false;
    res += to_string(x);
  }
  res += "}";
  return res;
}
void debug_out() { cerr << endl; }
template <typename Head, typename... Tail>
void debug_out(Head H, Tail... T) {
  cerr << " " << to_string(H);
  debug_out(T...);
}
#define debug(...) cerr << "[" << #__VA_ARGS__ << "]:", debug_out(__VA_ARGS__)

//------ Believe yourself as a genius!!!!!! ------

int dy[] = {1, 0, -1, 0};
int dx[] = {0, 1, 0, -1};
// int dy[]={-1,0,1,-1,1,-1,0,1};int dx[]={-1,-1,-1,0,0,1,1,1};
string alph("abcdefghijklmnopqrstuvwxyz"), s[ohara], usitapunichiakunwara;
string fr, ba;
ll n, cnt, ans, a, b, c, d, tmp, m, h, w, x, y, sum, k, q;
P p[ohara], p2[ohara];
ll p_cou, p2_cou;

int main(void) {
  cin.tie(0);
  cout.tie(0);
  ios::sync_with_stdio(false);

  cin >> n;
  rep(i, n) {
    cin >> s[i];
    ll le = 0, ri = 0;  //)がri,(がle
    ll st = Size(s[i]), en = -1;
    sum = 0;
    rep(j, Size(s[i])) {
      if (s[i][j] == '(') {
        st = j;
        break;
      }
      ri++;
    }
    rrrep(j, Size(s[i]) - 1, 0LL) {
      if (s[i][j] == ')') {
        en = j;
        break;
      }
      le++;
    }
    rrep(j, st, en + 1) {
      if (s[i][j] == '(')
        sum++;
      else
        sum--;
    }
    if (sum >= 0)
      le += sum;
    else
      ri -= sum;
    if (le == 0 || ri == 0) {
      if (le == 0)
        ba += s[i];
      else
        fr += s[i];
    } else {
      if (le - ri >= 0)
        p[p_cou++] = m_p(ri, i);
      else
        p2[p2_cou++] = m_p(le, i);
    }
  }
  sort(p, p + p_cou);
  sort(p2, p2 + p2_cou);
  reverse(p2, p2 + p2_cou);
  rep(i, p_cou) {
    ll idx = p[i].se;
    usitapunichiakunwara += s[idx];
  }
  rep(i, p2_cou) {
    ll idx = p2[i].se;
    usitapunichiakunwara += s[idx];
  }
  usitapunichiakunwara = fr + usitapunichiakunwara + ba;
  sum = 0;
  rep(i, Size(usitapunichiakunwara)) {
    if (usitapunichiakunwara[i] == '(')
      sum++;
    else
      sum--;
    if (sum < 0) {
      Cout("No");
      return 0;
    }
  }
  if (sum == 0)
    Cout("Yes");
  else
    Cout("No");
  return 0;
}

Measured memory_bytes: 40436