import std.stdio, std.conv, std.functional, std.string;
import std.algorithm, std.array, std.container, std.range, std.typecons;
import std.bigint, std.numeric, std.math, std.random;
import core.bitop;

string FMT_F = "%.10f";

static File _f;
void file_io(string fn) { _f = File(fn, "r"); }
static string[] s_rd;
T _RD(T = long)() { while(!s_rd.length) s_rd = readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T _RD(T = long)(File f) { while(!s_rd.length) s_rd = f.readln.chomp.split; string res = s_rd[0]; s_rd.popFront; return res.to!T; }
T[] _RDA(T = long)(T fix = 0) { auto r = readln.chomp.split.to!(T[]); r[] += fix; return r; }
T[] _RDA(T = long)(File f, T fix = 0) { auto r = f.readln.chomp.split.to!(T[]); r[] += fix; return r; }
T RD(T = long)() { if (_f.isOpen) return _RD!T(_f); else return _RD!T; }
T[] RDA(T = long)(T fix = 0) { if (_f.isOpen)  return _RDA!T(_f, fix); else return _RDA!T(fix); }

size_t[] MAKE_IDX(alias less = "a < b", Range)(Range range) { auto idx = new size_t[](range.length); makeIndex!(less)(range, idx); return idx;}
size_t MIN_POS(alias less = "a < b", Range)(Range range) { auto r = minPos!(less)(range); return range.length - r.length; }

void chmin(T)(ref T x, T y) { x = min(x, y); } void chmax(T)(ref T x, T y) { x = max(x, y); }
bool inside(T)(T x, T b, T e) { return x >= b && x < e; }
T lcm(T)(T x, T y) { return x * (y / gcd(x, y)); }

//long mod = 10^^9 + 7;
long mod = 998_244_353;
//long mod = 1_000_003;
void moda(T)(ref T x, T y) { x = (x + y) % mod; }
void mods(T)(ref T x, T y) { x = ((x + mod) - (y % mod)) % mod; }
void modm(T)(ref T x, T y) { x = (x * y) % mod; }
void modpow(T)(ref T x, T y) { if (!y) { x = 1; return; } auto t = x; x.modpow(y>>1); x.modm(x); if (y&1) x.modm(t); }
void modd(T)(ref T x, T y) { x.modm(y.modpow(mod - 2)); }

void main()
{
	auto N = RD;
	auto S = new string[](N);
	foreach (i; 0..N)
	{
		S[i] = RD!string;
	}

	auto cnt = new long[][](N, 3);
	foreach (i; 0..N)
	{
		long c1, c2, c3;
		foreach (c; S[i])
		{
			if (c == ')')
				--c1;
			else
				++c1;
			c2.chmin(c1);
		}
		c1 = 0;
		foreach_reverse (c; S[i])
		{
			if (c == ')')
				--c1;
			else
				++c1;
			c3.chmax(c1);
		}

		cnt[i] = [c1, c2, c3];
	}
	cnt.sort!"a[0] == b[0] ? a[1] > b[1] : a[0] > b[0]"();

	long y;
	bool ok = true;
	{
		long pos1 = -1;
		long pos2 = -1;
		long best1 = -1, best2 = -1;
		foreach (i; 0..cnt.length)
		{
			if (cnt[i][1] >= 0)
			{
				if (cnt[i][2] > 0)
				{
					if (cnt[i][0] > best1)
					{
						pos1 = i;
						best1 = cnt[i][0];
					}
				}
				else
				{
					if (cnt[i][0] > best2)
					{
						pos2 = i;
						best2 = cnt[i][0];
					}
				}
				
			}
		}
		if (pos1 != -1)
		{
			y += cnt[pos1][0];
			cnt = cnt[0..pos1] ~ cnt[pos1+1..$];
		}
		else if (pos2 != -1)
		{
			y += cnt[pos2][0];
			cnt = cnt[0..pos2] ~ cnt[pos2+1..$];
		}
		else
			ok = false;
	}
	{
		long pos1 = -1;
		long pos2 = -1;
		long best1 = 1, best2 = 1;
		foreach (i; 0..cnt.length)
		{
			if (cnt[i][2] <= 0)
			{
				if (cnt[i][1] < 0)
				{
					if (cnt[i][0] < best1)
					{
						pos1 = i;
						best1 = cnt[i][0];
					}
				}
				else
				{
					if (cnt[i][0] < best2)
					{
						pos2 = i;
						best2 = cnt[i][0];
					}
				}

			}
		}
		if (pos1 != -1)
		{
			y += cnt[pos1][0];
			cnt = cnt[0..pos1] ~ cnt[pos1+1..$];
		}
		else if (pos2 != -1)
		{
			y += cnt[pos2][0];
			cnt = cnt[0..pos2] ~ cnt[pos2+1..$];
		}
		else
			ok = false;
	}
	
	debug writeln(cnt);

	long x;
	
	long lastSize = -1;
	while (!cnt.empty)
	{
		long[][] nCnt;
		foreach (i; 0..cnt.length)
		{
			if (x + cnt[i][1] < 0)
			{
				nCnt ~= cnt[i];
				continue;
			}
			x += cnt[i][0];
		}
		if (nCnt.length == lastSize)
		{
			ok = false;
			break;
		}
		cnt = nCnt;
		lastSize = nCnt.length;
		debug writeln(cnt);
	}

	bool ans = ok && x+y == 0;

	writeln(ans ? "Yes" : "No");
	stdout.flush;
	debug readln;
}