CF 723B Text Document Analysis

B. Text Document Analysis

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

Modern text editors usually show some information regarding the document being edited. For example, the number of words, the number of pages, or the number of characters.

In this problem you should implement the similar functionality.

You are given a string which only consists of:

• uppercase and lowercase English letters,
• underscore symbols (they are used as separators),
• parentheses (both opening and closing).

It is guaranteed that each opening parenthesis has a succeeding closing parenthesis. Similarly, each closing parentheses has a preceding opening parentheses matching it. For each pair of matching parentheses there are no other parenthesis between them. In other words, each parenthesis in the string belongs to a matching "opening-closing" pair, and such pairs can't be nested.

For example, the following string is valid: "_Hello_Vasya(and_Petya)__bye_(and_OK)".

Word is a maximal sequence of consecutive letters, i.e. such sequence that the first character to the left and the first character to the right of it is an underscore, a parenthesis, or it just does not exist. For example, the string above consists of seven words: "Hello", "Vasya", "and", "Petya", "bye", "and" and "OK". Write a program that finds:

• the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
• the number of words inside the parentheses (print 0, if there is no word inside the parentheses).

Input

The first line of the input contains a single integer n (1 ≤ n ≤ 255) — the length of the given string. The second line contains the string consisting of only lowercase and uppercase English letters, parentheses and underscore symbols.

Output

Print two space-separated integers:

• the length of the longest word outside the parentheses (print 0, if there is no word outside the parentheses),
• the number of words inside the parentheses (print 0, if there is no word inside the parentheses).

Examples

input

37
_Hello_Vasya(and_Petya)__bye_(and_OK)

output

5 4

input

37
_a_(_b___c)__de_f(g_)__h__i(j_k_l)m__

output

2 6

input

27
(LoooonG)__shOrt__(LoooonG)

output

5 2

input

5
(___)

output

0 0

Note

In the first sample, the words "Hello", "Vasya" and "bye" are outside any of the parentheses, and the words "and", "Petya", "and" and "OK" are inside. Note, that the word "and" is given twice and you should count it twice in the answer.

转眼就已经好久没打代码了。被工作所牵制。现在打这个代码都很吃力。感觉脑子已经转不动了

#include <cstdio>
#include <cstring>
#include <cstdlib>


/************************************************

Desiner:hl
time:2016/10/2
Exe.Time:31 ms
Exe.Memory:0 KB

题目链接：http://codeforces.com/contest/723/problem/B

题意：求括号外最长单词的长度和括号内单词的数量

题解：需要注意的是他词的定义是他左边右边是下划线，括号，或者不存在
 我一开始判断没看到他不存在
后面就是细节问题了
************************************************/

bool isLetter(char s) {
    if ((s >= 'a' && s <= 'z') || (s >= 'A' && s <= 'Z')) {
        return true;
    }
    return false;
}


int main() {
    int i, j, k, l, len, outMax, inMax;
    char s[260];
    while (~scanf("%d%*c", &len)) {
        outMax = inMax = 0;
        scanf("%s", s);
        for (i = 0; i < len; i++) {
            if (s[i] == '(') {
                for (j = i + 1; s[j] != ')'; j++) {
                    if (isLetter(s[j])) {
                        inMax++;
                        while (isLetter(s[++j]));
                        j--;
                    }
                }
                i = j;

            } else if (isLetter(s[i])) {
                k = i;
                while (isLetter(s[++i]));
                outMax = i - k > outMax ? i - k : outMax;
                i--;
            } else if (!isLetter(s[i])) {
                continue;
            }
        }
        printf("%d %d\n", outMax, inMax);
    }

}