CodeForces - 1323C C - Unusual Competitions

A bracketed sequence is called correct (regular) if by inserting "+" and "1" you can get a well-formed mathematical expression from it. For example, sequences "(())()", "()" and "(()(()))" are correct, while ")(", "(()" and "(()))(" are not.

The teacher gave Dmitry's class a very strange task — she asked every student to come up with a sequence of arbitrary length, consisting only of opening and closing brackets. After that all the students took turns naming the sequences they had invented. When Dima's turn came, he suddenly realized that all his classmates got the correct bracketed sequence, and whether he got the correct bracketed sequence, he did not know.

Dima suspects now that he simply missed the word "correct" in the task statement, so now he wants to save the situation by modifying his sequence slightly. More precisely, he can the arbitrary number of times (possibly zero) perform the reorder operation.

The reorder operation consists of choosing an arbitrary consecutive subsegment (substring) of the sequence and then reordering all the characters in it in an arbitrary way. Such operation takes llnanoseconds, where ll is the length of the subsegment being reordered. It's easy to see that reorder operation doesn't change the number of opening and closing brackets. For example for "))((" he can choose the substring ")(" and do reorder ")()(" (this operation will take 22 nanoseconds).

Since Dima will soon have to answer, he wants to make his sequence correct as fast as possible. Help him to do this, or determine that it's impossible.

Input

The first line contains a single integer nn (1≤n≤1061≤n≤106) — the length of Dima's sequence.

The second line contains string of length nn, consisting of characters "(" and ")" only.

Output

Print a single integer — the minimum number of nanoseconds to make the sequence correct or "-1" if it is impossible to do so.

Examples

Input

8
))((())(

Output

6

Input

3
(()

Output

-1

Note

In the first example we can firstly reorder the segment from first to the fourth character, replacing it with "()()", the whole sequence will be "()()())(". And then reorder the segment from the seventh to eighth character, replacing it with "()". In the end the sequence will be "()()()()", while the total time spent is 4+2=64+2=6 nanoseconds.

如果是（）就是正确序列 找出最小的排序方法使序列正确

反正（）是正确的 只要找到第一个反着的

就 +2 每次记录上一次的状态 因为只有前面完全匹配才开始计数 所以 cnt要小于0

#include<bits/stdc++.h>
int t;
int n;
using namespace std;
string s;
void solve(){
    cin >> s;
    int l = 0;
    int r = 0;
    for(auto i : s){
        if(i == '(')
            l++;
        else
            r++;
    }
    if(l != r){
        cout << "-1" << endl;
        return ;
    }
    int cnt = 0;
    int flag = 0;
    int ans = 0;
    for(auto i : s){
        if(i == '(')
            cnt++;
        else
            cnt--;
        if(cnt < flag && cnt < 0){
            ans += 2;
        }
        flag = cnt;
    }
    cout << ans << endl;
}
int main(){
    t = 1;
    while(t--){
        cin >> n;
        solve();
    }
}