Problem:
Score : 600 points

Problem Statement

A bracket sequence is a string that is one of the following:

An empty string;

The concatenation of (, A, and ) in this order, for some bracket sequence A ;

The concatenation of A and B in this order, for some non-empty bracket sequences A and B /

Given are N strings S_i. Can a bracket sequence be formed by concatenating all the N strings in some order?

Constraints

1 \leq N \leq 10^6

The total length of the strings S_i is at most 10^6.

S_i is a non-empty string consisting of ( and ).

Input

Input is given from Standard Input in the following format:

N
S_1
:
S_N

Output

If a bracket sequence can be formed by concatenating all the N strings in some order, print Yes; otherwise, print No.

Sample Input 1

2
)
(()

Sample Output 1

Yes

Concatenating (() and ) in this order forms a bracket sequence.

Sample Input 2

2
)(
()

Sample Output 2

No

Sample Input 3

4
((()))
((((((
))))))
()()()

Sample Output 3

Yes

Sample Input 4

3
(((
)
)

Sample Output 4

No

Solution in C# (.NET Core 3.1.201) (judge verdict: Wrong Answer)

using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using static System.Console;
using static System.Math;

namespace AtTest.ABC_167
{
    class F
    {
        static void Main(string[] args)
        {
            var sw = new System.IO.StreamWriter(OpenStandardOutput()) { AutoFlush = false };
            SetOut(sw);

            Method(args);

            Out.Flush();
        }

        static void Method(string[] args)
        {
            int n = ReadInt();
            string[] ss = new string[n];
            for(int i = 0; i < n; i++)
            {
                ss[i] = Read();
            }

            int[][] remAdds = new int[n][];
            for(int i = 0; i < n; i++)
            {
                int left = 0;
                int right = 0;
                for(int j = 0; j < ss[i].Length; j++)
                {
                    if (ss[i][j] == ')')
                    {
                        if (right > 0)
                        {
                            right--;
                        }
                        else
                        {
                            left++;
                        }
                    }
                    else
                    {
                        right++;
                    }
                }

                remAdds[i] = new int[2] { left,right };
            }

            int tmp = 0;
            for(int i = 0; i < n; i++)
            {
                if (remAdds[i][0] == 0)
                {
                    tmp += remAdds[i][1];
                }
            }

            Array.Sort(remAdds, (a, b) =>
            {
                if (a[0] == b[0])
                {
                    return b[1] - a[1];
                }
                else
                {
                    return a[0] - b[0];
                }
            });
            for (int i = 0; i < n; i++)
            {
                if (remAdds[i][0] > 0 && remAdds[i][1] > 0
                    && remAdds[i][0] <= remAdds[i][1])
                {
                    if (tmp < remAdds[i][0])
                    {
                        WriteLine("No");
                        return;
                    }

                    tmp -= remAdds[i][0];
                    tmp += remAdds[i][1];
                }
            }
            for (int i = 0; i < n; i++)
            {
                if (remAdds[i][0] > 0 && remAdds[i][1] > 0
                    && remAdds[i][0] > remAdds[i][1])
                {
                    if (tmp < remAdds[i][0])
                    {
                        WriteLine("No");
                        return;
                    }

                    tmp -= remAdds[i][0];
                    tmp += remAdds[i][1];
                }
            }


            for (int i = 0; i < n; i++)
            {
                if (remAdds[i][1] == 0)
                {
                    if (tmp < remAdds[i][0])
                    {
                        WriteLine("No");
                        return;
                    }
                    tmp -= remAdds[i][0];
                }
            }

            if (tmp == 0)
            {
                WriteLine("Yes");
            }
            else
            {
                WriteLine("No");
            }
        }

        private static string Read() { return ReadLine(); }
        private static char[] ReadChars() { return Array.ConvertAll(Read().Split(), a => a[0]); }
        private static int ReadInt() { return int.Parse(Read()); }
        private static long ReadLong() { return long.Parse(Read()); }
        private static double ReadDouble() { return double.Parse(Read()); }
        private static int[] ReadInts() { return Array.ConvertAll(Read().Split(), int.Parse); }
        private static long[] ReadLongs() { return Array.ConvertAll(Read().Split(), long.Parse); }
        private static double[] ReadDoubles() { return Array.ConvertAll(Read().Split(), double.Parse); }
    }
}