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():
    s = input().replace("()", "**")
    l, hi = [*s, '(', ')'], 0
    while True:
        lo = s.find("(*", hi)
        if lo == -1:
            break
        hi = s.find("*)", lo) + 1
        if hi == 0:
            break
        while l[lo] == '(' and l[hi] == ')':
            l[lo] = l[hi] = '*'
            lo -= 1
            hi += 1
    l = [*map(len, ''.join(l).replace('(', ' ').replace(')', ' ').split()), 0]
    m = max(l)
    print(m, l.count(m))


if __name__ == '__main__':
    main()
