This is yet another problem dealing with regular bracket sequences.

We should remind you that a bracket sequence is called regular, if by inserting «+» and «1» into it we can get a correct mathematical expression. For example, sequences «(())()», «()» and «(()(()))» are regular, while «)(», «(()» and «(()))(» are not. 

You are given a string of «(» and «)» characters. You are to find its longest substring that is a regular bracket sequence. You are to find the number of such substrings as well.
The first line of the input file contains a non-empty string, consisting of «(» and «)» characters. Its length does not exceed 10<sup class="upper-index">6</sup>.
def main():
    stack, res = [], [False]
    for i, c in enumerate(input()):
        if c == '(':
            stack.append(i)
        elif stack:
            res[-1] = (stack.pop(), i,)
        else:
            res.append(False)
    res = [j - i for i, j in filter(None, res)]
    print(*((max(res) + 1, len(res)) if res else(0, 1)))


if __name__ == '__main__':
    main()
