{"problem":{"name":"Bracket Sequencing","description":{"content":"A **bracket sequence** is a string that is one of the following: 1.  An empty string; 2.  The concatenation of `(`, $A$, and `)` in this order, for some bracket sequence $A$ ; 3.  The concatenation o","description_type":"Markdown"},"platform":"AtCoder","limit":{"time_limit":2000,"memory_limit":262144},"difficulty":"None","is_remote":true,"is_sync":true,"sync_url":null,"sign":"abc167_f"},"statements":[{"statement_type":"Markdown","content":"A **bracket sequence** is a string that is one of the following:\n\n1.  An empty string;\n2.  The concatenation of `(`, $A$, and `)` in this order, for some bracket sequence $A$ ;\n3.  The concatenation of $A$ and $B$ in this order, for some non-empty bracket sequences $A$ and $B$ /\n\nGiven are $N$ strings $S_i$. Can a bracket sequence be formed by concatenating all the $N$ strings in some order?\n\n## Constraints\n\n*   $1 \\leq N \\leq 10^6$\n*   The total length of the strings $S_i$ is at most $10^6$.\n*   $S_i$ is a non-empty string consisting of `(` and `)`.\n\n## Input\n\nInput is given from Standard Input in the following format:\n\n$N$\n$S_1$\n$:$\n$S_N$\n\n[samples]","is_translate":false,"language":"English"}],"meta":{"iden":"abc167_f","tags":[],"sample_group":[["2\n)\n(()","Yes\n\nConcatenating `(()` and `)` in this order forms a bracket sequence."],["2\n)(\n()","No"],["4\n((()))\n((((((\n))))))\n()()()","Yes"],["3\n(((\n)\n)","No"]],"created_at":"2026-03-03 11:01:14"}}