#include <stdio.h>

typedef struct {
	int key, id;
} data;

void merge_sort(data x[], int n)
{
	static data y[1000001] = {};
	if (n <= 1) return;
	merge_sort(&(x[0]), n/2);
	merge_sort(&(x[n/2]), (n+1)/2);
	
	int i, p, q;
	for (i = 0, p = 0, q = n/2; i < n; i++) {
		if (p >= n/2) y[i] = x[q++];
		else if (q >= n) y[i] = x[p++];
		else y[i] = (x[p].key < x[q].key)? x[p++]: x[q++];
	}
	for (i = 0; i < n; i++) x[i] = y[i];
}

int main()
{
	int i, j, N;
	char T[1000001];
	data count[1000001];
	scanf("%d", &N);
	for (i = 0; i < N; i++) {
		scanf("%s", T);
		for (j = 0, count[i].key = 0, count[i].id = 0; T[j] != 0; j++) {
			if (T[j] == '(') count[i].id++;
			else count[i].id--;
			if (count[i].id < count[i].key) count[i].key = count[i].id;
		}
	}
	merge_sort(count, N);
	
	int tmp = 0;
	for (i = N - 1; count[i].key == 0; i--) tmp += count[i].id;
	for (; i >= 0, tmp > 0; i--) tmp += count[i].id;
	if (i < 0 && tmp == 0) printf("Yes\n");
	else printf("No\n");
	fflush(stdout);
	return 0;
}