#include <bits/stdc++.h>
using namespace std;
template <typename T>
using pq = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
ll INF = LLONG_MAX / 4000 - 100;
ll mod = 1e9 + 7;
long long dx[] = {-1, 0, 1, 0}, dy[] = {0, 1, 0, -1};
vector<ll> prime;
class fact {
 public:
  long long fmod = 1e9 + 7;
  vector<long long> fac, finv, inv;
  fact(long long n, long long Mod = 1e9 + 7) {
    fmod = Mod;
    fac = vector<long long>(n + 1, 0);
    finv = vector<long long>(n + 1, 0);
    inv = vector<long long>(n + 1, 0);
    fac[0] = 1;
    for (long long i = 1; i < n + 1; i++) fac[i] = fac[i - 1] * i % fmod;
    for (long long i = 0; i < n + 1; i++) finv[i] = fact::POW(fac[i], fmod - 2);
    for (long long i = 0; i < n + 1; i++) inv[i] = POW(i, fmod - 2);
  }
  ll nCr(ll n, ll r) {
    if (n < r) return 0;
    return (fac[n] * finv[r] % fmod) * finv[n - r] % fmod;
  }
  ll POW(ll a, ll b) {
    ll c = 1;
    while (b > 0) {
      if (b & 1) {
        c = a * c % fmod;
      }
      a = a * a % fmod;
      b >>= 1;
    }
    return c;
  }
  inline long long operator[](long long i) { return fac[i]; }
};
void DEBUG(vector<long long> a) {
  for (long long i = 0; i < a.size(); i++) cout << a[i] << " ";
  cout << endl;
}
void EMP(long long x) { cout << "!!!" << x << "!!!" << endl; }
ll GCD(ll a, ll b) {
  ll c;
  while (b != 0) {
    c = a % b;
    a = b;
    b = c;
  }
  return a;
}
ll LCM(ll a, ll b) { return (a / GCD(a, b)) * (b / GCD(a, b)) * GCD(a, b); }
ll POW(ll a, ll b) {
  ll c = 1;
  while (b > 0) {
    if (b & 1) {
      c = a * c % mod;
    }
    a = a * a % mod;
    b >>= 1;
  }
  return c;
}
void PRI(ll n) {
  bool a[n + 1LL];
  for (long long i = 0; i < n + 1LL; i++) {
    a[i] = 1LL;
  }
  for (long long i = 2; i < n + 1LL; i++) {
    if (a[i]) {
      prime.push_back(i);
      ll b = i;
      while (b <= n) {
        a[b] = 0;
        b += i;
      }
    }
  }
}
template <typename T>
T chmin(T& a, T b) {
  if (a > b) a = b;
  return a;
}
template <typename T>
T chmax(T& a, T b) {
  if (a < b) a = b;
  return b;
}
bool isSqrt(ll a) { return pow(sqrt(a), 2) == a ? 1 : 0; }
void YesNo(bool a) {
  if (a)
    cout << "Yes";
  else
    cout << "No";
  cout << endl;
}
void yesno(bool a) {
  if (a)
    cout << "yes";
  else
    cout << "no";
  cout << endl;
}
void YESNO(bool a) {
  if (a)
    cout << "YES";
  else
    cout << "NO";
  cout << endl;
}
double dis(long long x1, long long x2, long long y1, long long y2) {
  return sqrt((double)abs(x1 - x2) * (double)abs(x1 - x2) +
              (double)abs(y1 - y2) * (double)abs(y1 - y2));
}
long long ceili(long long x, long long y) {
  if (x % y == 0)
    return x / y;
  else
    return x / y + 1;
}
long long extGCD(long long a, long long b, long long& x, long long& y) {
  if (b == 0) {
    x = 1;
    y = 0;
    return a;
  }
  long long d = extGCD(b, a % b, y, x);
  y -= a / b * x;
  return d;
}
void solve() {
  long long n;
  cin >> n;
  string s;
  cin >> s;
  long long a1, a2;
  a1 = a2 = 0;
  for (long long(i) = (0); (i) < (n); (i)++) {
    a1 += (s[i] == '(');
    a2 += (s[i] == ')');
  }
  if (a2 != a1) {
    cout << 0 << endl;
    cout << 1 << " " << 1 << endl;
    return;
  }
  long long ans = -1;
  long long l, r;
  for (long long(i) = (0); (i) < (n); (i)++) {
    for (long long(j) = (i); (j) < (n); (j)++) {
      string t = s;
      swap(t[i], t[j]);
      vector<long long> csum(n + 1);
      long long mi = 0;
      for (long long(k) = (0); (k) < (n); (k)++) {
        csum[k + 1] = csum[k];
        if (t[k] == '(')
          csum[k + 1]++;
        else
          csum[k + 1]--;
        chmin(mi, csum[k + 1]);
      }
      long long tmp = 0;
      for (long long(k) = (0); (k) < (n); (k)++) {
        tmp += (mi == csum[k]);
      }
      if (ans < tmp) {
        l = i + 1, r = j + 1;
        ans = tmp;
      }
    }
  }
  cout << ans << endl;
  cout << l << " " << r << endl;
}
signed main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}
