Problem: This is a harder version of the problem. In this version, n ≤ 300 000.

Vasya is an experienced developer of programming competitions' problems. As all great minds at some time, Vasya faced a creative crisis. To improve the situation, Petya gifted him a string consisting of opening and closing brackets only. Petya believes, that the beauty of the bracket string is a number of its cyclical shifts, which form a correct bracket sequence.

To digress from his problems, Vasya decided to select two positions of the string (not necessarily distinct) and swap characters located at this positions with each other. Vasya will apply this operation exactly once. He is curious what is the maximum possible beauty he can achieve this way. Please help him.

We remind that bracket sequence s is called correct if: 

  * s is empty; 
  * s is equal to "(t)", where t is correct bracket sequence; 
  * s is equal to t_1 t_2, i.e. concatenation of t_1 and t_2, where t_1 and t_2 are correct bracket sequences. 



For example, "(()())", "()" are correct, while ")(" and "())" are not.

The cyclical shift of the string s of length n by k (0 ≤ k < n) is a string formed by a concatenation of the last k symbols of the string s with the first n - k symbols of string s. For example, the cyclical shift of string "(())()" by 2 equals "()(())".

Cyclical shifts i and j are considered different, if i ≠ j.

Input

The first line contains an integer n (1 ≤ n ≤ 300 000), the length of the string.

The second line contains a string, consisting of exactly n characters, where each of the characters is either "(" or ")".

Output

The first line should contain a single integer — the largest beauty of the string, which can be achieved by swapping some two characters.

The second line should contain integers l and r (1 ≤ l, r ≤ n) — the indices of two characters, which should be swapped in order to maximize the string's beauty.

In case there are several possible swaps, print any of them.

Examples

Input


10
()()())(()


Output


5
8 7


Input


12
)(()(()())()


Output


4
5 10


Input


6
)))(()


Output


0
1 1

Note

In the first example, we can swap 7-th and 8-th character, obtaining a string "()()()()()". The cyclical shifts by 0, 2, 4, 6, 8 of this string form a correct bracket sequence.

In the second example, after swapping 5-th and 10-th character, we obtain a string ")(())()()(()". The cyclical shifts by 11, 7, 5, 3 of this string form a correct bracket sequence.

In the third example, swap of any two brackets results in 0 cyclical shifts being correct bracket sequences. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long INF = 0x3f3f3f3f3f3f3f3fll;
const int maxn = 6e5 + 5;
const long long mod = 1e9 + 7;
struct Tree {
  int mi, lz, pos, cnt;
} T[maxn << 2];
inline void build(int u, int l, int r) {
  T[u].lz = T[u].mi = 0;
  T[u].pos = r;
  T[u].cnt = r - l + 1;
  if (l == r) return;
  build((u << 1), l, ((l + r) >> 1)),
      build((u << 1 | 1), ((l + r) >> 1) + 1, r);
}
inline void pushup(int u) {
  if (T[(u << 1)].mi == T[(u << 1 | 1)].mi) {
    T[u].mi = T[(u << 1)].mi;
    T[u].cnt = T[(u << 1)].cnt + T[(u << 1 | 1)].cnt;
    T[u].pos = T[(u << 1 | 1)].pos;
  } else {
    int lz = T[u].lz;
    T[u] =
        (T[(u << 1)].mi > T[(u << 1 | 1)].mi) ? T[(u << 1 | 1)] : T[(u << 1)];
    T[u].lz = lz;
  }
}
inline void pushdown(int u) {
  if (T[u].lz) {
    T[(u << 1)].lz += T[u].lz, T[(u << 1)].mi += T[u].lz;
    T[(u << 1 | 1)].lz += T[u].lz, T[(u << 1 | 1)].mi += T[u].lz;
    T[u].lz = 0;
  }
}
inline void change(int u, int l, int r, int L, int R, int v) {
  if (L <= l && r <= R) {
    T[u].lz += v;
    T[u].mi += v;
    return;
  }
  pushdown(u);
  if (L <= ((l + r) >> 1)) change((u << 1), l, ((l + r) >> 1), L, R, v);
  if (R > ((l + r) >> 1)) change((u << 1 | 1), ((l + r) >> 1) + 1, r, L, R, v);
  pushup(u);
}
Tree nod;
inline void query(int u, int l, int r, int L, int R) {
  if (L <= l && r <= R) {
    if (T[u].mi < nod.mi) {
      nod = T[u];
    } else if (T[u].mi == nod.mi) {
      nod.pos = max(nod.pos, T[u].pos);
      nod.cnt += T[u].cnt;
    }
    return;
  }
  pushdown(u);
  if (L <= ((l + r) >> 1)) query((u << 1), l, ((l + r) >> 1), L, R);
  if (R > ((l + r) >> 1)) query((u << 1 | 1), ((l + r) >> 1) + 1, r, L, R);
  pushup(u);
}
int n, m, N;
char s[maxn];
int S[maxn];
inline Tree query(int L, int R) {
  nod.mi = INF;
  query(1, 1, N, L, R);
  return nod;
}
void dbg() {
  for (int i = 1; i <= N; i++) printf("%d ", query(i, i).mi);
  puts("");
}
int main() {
  scanf("%d%d", &n, &m);
  scanf("%s", s + 1);
  N = 2 * n;
  build(1, 1, N);
  for (int i = 1; i <= n; i++) {
    S[i] = S[i + n] = (s[i] == '(' ? 1 : -1);
    change(1, 1, N, i, N, S[i]);
    change(1, 1, N, i + n, N, S[i + n]);
  }
  if (query(n, n).mi != 0) {
    puts("0\n1 1");
    return 0;
  }
  int ans = 0;
  int rl = 1, rr = 1;
  for (int i = 1; i <= n; i++) {
    Tree tmp = query(i, i + n - 1);
    if (S[i] == 1) {
      if (tmp.mi == 0) {
        if (tmp.cnt > ans) {
          ans = tmp.cnt;
          rl = rr = 1;
        }
      }
    } else {
      if (tmp.mi == -1) {
        change(1, 1, N, i, tmp.pos, 2);
        Tree tmp2 = query(i, i + n - 1);
        assert(tmp2.mi == 0);
        if (tmp2.cnt > ans) {
          ans = tmp2.cnt;
          rl = i, rr = tmp.pos + 1;
        }
        change(1, 1, N, i, tmp.pos, -2);
      } else if (tmp.mi == -2) {
        change(1, 1, N, i, tmp.pos, 1);
        Tree tmp2 = query(i, i + n - 1);
        assert(tmp2.mi == -1);
        change(1, 1, N, i, tmp2.pos, 1);
        if (tmp.pos < tmp2.pos) change(1, 1, N, tmp.pos + 1, tmp2.pos, 1);
        Tree tmp3 = query(i, i + n - 1);
        assert(tmp3.mi == 0);
        if (tmp3.cnt > ans) {
          ans = tmp3.cnt;
          rl = i, rr = tmp2.pos + 1;
        }
        change(1, 1, N, i, tmp2.pos, -2);
      }
    }
    change(1, 1, N, i, N, -S[i]);
  }
  if (rl > n) rl -= n;
  if (rr > n) rr -= n;
  printf("%d\n%d %d\n", ans, rl, rr);
  return 0;
}