#include <stdio.h>
#include <algorithm>
int a, b, n, g, x, y, f, fx, fy, now;
char s[1000001];
long long u[1000000];
long long d[1000000];
long long p;
long long q = 10000000;
int uu, dd;
int main() {
	scanf("%d", &n);
	for (int i = 0; i < n; i++) {
		scanf(" %s", s);
		g = 0;
		x = 0;
		a = 0;
		while (s[g] != NULL)g++;
		for (int j = 0; j < g; j++) {
			if (s[j] == ')')x++;
			if (s[j] == '(')x--;
			if (x > a)a = x;
		}
		b = a - x;
		if (b < 0)b = 0;
		y += x;
		if (x <= 0) {
			p = a;
			p *= q;
			p -= x;
			u[uu] = p;
			uu++;
		}
		if (x > 0) {
			p = b;
			p *= q;
			p += x;
			d[dd] = p;
			dd++;
		}
	}
	if (y != 0) {
		printf("No\n");
		return 0;
	}
	std::sort(d, d + dd);
	std::sort(u, u + uu);
	for (int i = 0; i < uu; i++) {
		fx = u[i] % q;
		fy = u[i] / q;
		if (now < fy)f++;
		now += fx;
	}
	now = 0;
	for (int i = 0; i < dd; i++) {
		fx = d[i] % q;
		fy = d[i] / q;
		if (now < fy)f++;
		now += fx;
	}
	if (f)printf("No\n");
	else printf("Yes\n");
}