#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC target("sse4")
const char nl = '\n';
using namespace std;
using ll = long long;
using vi = vector<int>;
using vl = vector<ll>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using str = string;
str to_string(char c) { return str(1, c); }
str to_string(bool b) { return b ? "true" : "false"; }
str to_string(const char* second) { return (str)second; }
str to_string(str second) { return second; }
template <class A>
str to_string(complex<A> c) {
  stringstream ss;
  ss << c;
  return ss.str();
}
str to_string(vector<bool> v) {
  str res = "{";
  for (int i = 0; i < (int)v.size(); i++) res += char('0' + v[i]);
  res += "}";
  return res;
}
template <size_t SZ>
str to_string(bitset<SZ> b) {
  str res = "";
  for (int i = 0; i < b.size(); i++) res += char('0' + b[i]);
  return res;
}
template <class A, class B>
str to_string(pair<A, B> p);
template <class T>
str to_string(T v) {
  bool fst = 1;
  str res = "{";
  for (const auto& x : v) {
    if (!fst) res += ", ";
    fst = 0;
    res += to_string(x);
  }
  res += "}";
  return res;
}
template <class A, class B>
str to_string(pair<A, B> p) {
  return "(" + to_string(p.first) + ", " + to_string(p.second) + ")";
}
void DBG() { cerr << "]" << endl; }
template <class H, class... T>
void DBG(H h, T... t) {
  cerr << to_string(h);
  if (sizeof...(t)) cerr << ", ";
  DBG(t...);
}
int n;
string c;
signed main() {
  cin.tie(nullptr);
  ios_base::sync_with_stdio(false);
  cin >> n >> c;
  int thro = 0;
  for (int i = 0; i < n; i++) {
    if (c[i] == '(') {
      thro++;
    } else {
      thro--;
    }
  }
  if (thro != 0) {
    cout << 0 << nl;
    cout << "1 1\n";
    return 0;
  }
  int ret = -1, l, r;
  for (int i = 0; i < n; i++) {
    for (int j = 0; j < n; j++) {
      string d = c;
      swap(d[i], d[j]);
      int cnt = 0;
      int look = 0;
      int ans = 0;
      for (int i = 0; i < n; i++) {
        if (d[i] == '(') {
          cnt++;
        } else {
          cnt--;
        }
        if (cnt == look) {
          ans++;
        }
        if (cnt < look) {
          look = cnt;
          ans = 1;
        }
      }
      if (ans > ret) {
        l = min(i + 1, j + 1);
        r = max(i + 1, j + 1);
        ret = ans;
        0;
      }
    }
  }
  cout << ret << nl;
  cout << l << " " << r << nl;
}
