#include <bits/stdc++.h>
using namespace std;
#define int long long
constexpr int mod = 1e9 + 7, inf = 1e17;
struct node { int l, r, sm, ans; };
node merge(node left, node right) {
node res;
res.l = max(left.l, left.sm + right.l);
res.r = max(right.r, right.sm + left.r);
res.sm = left.sm + right.sm;
res.ans = max({left.l + right.r, left.ans + right.sm, left.sm + right.ans});
return res;
}
struct segment_tree {
int n;
vector<node> t;
void build(string &s, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (l == r) {
int x = s[l] == 'C' ? -1 : 1;
t[v] = {max(0ll, x), max(0ll, x), x, max(0ll, x)};
}
else {
int m = (l + r) >> 1;
build(s, v << 1, l, m);
build(s, v << 1 | 1, m + 1, r);
t[v] = merge(t[v << 1], t[v << 1 | 1]);
}
}
segment_tree(string &s) : n(s.size()), t(n << 2) { build(s); }
node get(int L, int R, int v = 1, int l = 0, int r = -1) {
if (r < 0) r += n;
if (L <= l && r <= R) return t[v];
int m = (l + r) >> 1;
if (R <= m) return get(L, R, v << 1, l, m);
if (L > m) return get(L, R, v << 1 | 1, m + 1, r);
return merge(get(L, R, v << 1, l, m), get(L, R, v << 1 | 1, m + 1, r));
}
};
int32_t main() {
#ifdef JahonaliX
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
ios::sync_with_stdio(false);
cin.tie(nullptr);
cout.tie(nullptr);
int n;
cin >> n;
string s;
cin >> s;
segment_tree st(s);
int q;
cin >> q;
while (q--) {
int l, r;
cin >> l >> r, l--, r--;
cout << st.get(l, r).ans << '\n';
}
return 0;
}
