#include <bits/stdc++.h>
using namespace std;
void fun() {}
long long int md = 1e9 + 7;
long long int __gcd(long long int a, long long int b) {
  if (b == 0) return a;
  return __gcd(b, a % b);
}
long long int poww(long long int a, long long int b, long long int md) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a) % md;
    }
    a = (1ll * a * a) % md;
    b >>= 1;
  }
  return res;
}
long long int poww(long long int a, long long int b) {
  if (b < 0) return 0;
  if (a == 0) return 0;
  long long int res = 1;
  while (b) {
    if (b & 1) {
      res = (1ll * res * a);
    }
    a = (1ll * a * a);
    b >>= 1;
  }
  return res;
}
void ainp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cin >> arr[i];
}
void disp(long long int arr[], long long int n) {
  for (long long int i = 1; i <= n; i++) cout << arr[i] << " ";
  cout << "\n";
}
void dispv(vector<long long int> &v) {
  for (long long int i = 0; i < v.size(); i++) cout << v[i] << " ";
  cout << "\n";
}
long long int divide(long long int a, long long int b, long long int md) {
  long long int rr = a * (poww(b, md - 2, md));
  rr %= md;
  return rr;
}
long long int len;
string s;
long long int maxans = 0;
long long int maxi = 1, maxj = 1;
void fnn(long long int pos1, long long int pos2) {
  swap(s[pos1 - 1], s[pos2 - 1]);
  long long int pref[len + 1], pmin[len + 1], smin[len + 2];
  pref[0] = 0;
  pmin[0] = INT_MAX;
  smin[len + 1] = 0;
  for (long long int i = 1; i <= len; i++) {
    if (s[i - 1] == '(')
      pref[i] = pref[i - 1] + 1;
    else
      pref[i] = pref[i - 1] - 1;
    pmin[i] = min(pmin[i - 1], pref[i]);
  }
  smin[len] = pref[len];
  long long int count = 0;
  for (long long int i = len - 1; i > 0; i--) {
    smin[i] = min(smin[i + 1], pref[i]);
  }
  for (long long int i = 1; i <= len; i++) {
    long long int aage = smin[i + 1] - pref[i];
    long long int peeche = pmin[i] + pref[len] - pref[i];
    if (s[i - 1] == ')' && (s[i] == '(' || i + 1 > len) && aage >= 0 &&
        peeche >= 0) {
      count++;
    }
  }
  if (count > maxans) maxans = count, maxi = pos1, maxj = pos2;
  swap(s[pos1 - 1], s[pos2 - 1]);
}
signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cout.tie(NULL);
  fun();
  cin >> len >> s;
  long long int open = 0;
  for (long long int i = 1; i <= len; i++) {
    if (s[i - 1] == '(')
      open++;
    else
      open--;
  }
  if (open == 0) {
    for (long long int i = 1; i <= len; i++)
      for (long long int j = i; j <= len; j++) fnn(i, j);
  }
  cout << maxans << "\n" << maxi << " " << maxj << "\n";
  return 0;
}
