#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
const int INF = 1 << 29;
const int MOD = 1e9 + 7;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 1e6 + 10;
char s[N];

bool check(const vector<ii>& a, const vector<ii>& b) {
  // trace(a, b);
  int cnt = 0;
  for (auto& [L, R] : a) {
    cnt -= L;
    if (cnt < 0) return false;
    cnt += R;
  }
  for (auto& [L, R] : b) {
    cnt -= L;
    if (cnt < 0) return false;
    cnt += R;
  }
  return cnt == 0;
}

int main() {
  int n;
  scanf("%d", &n);
  vector<ii> a, b;
  for (int i = 0; i < n; ++i) {
    scanf("%s", s);
    string t;
    for (int j = 0; s[j]; ++j) {
      if (s[j] == '(') {
        t += s[j];
      } else {
        if (t.size() && t.back() == '(') {
          t.pop_back();
        } else {
          t += s[j];
        }
      }
    }
    int L = 0;
    for (; L < t.size() && t[L] == ')'; ++L);
    int R = t.size() - L;
    if (L < R) {
      a.push_back({L, R});
    } else {
      b.push_back({L, R});
    }
  }
  sort(a.begin(), a.end(),
       [](const ii& u, const ii& v) {
         return u.first < v.first || (u.first == v.first && u.second > v.second);
       });
  sort(b.begin(), b.end(),
       [](const ii& u, const ii& v) {
         return u.second > v.second || (u.second == v.second && u.first < v.first);
       });
  if (check(a, b)) {
    cout << "Yes" << endl;
  } else {
    cout << "No" << endl;
  }
  return 0;
}


Measured memory_bytes: 11236