#include <bits/stdc++.h>
#define _rep(i, x, y) for(int i = x; i <= y; ++i)
#define _req(i, x, y) for(int i = x; i >= y; --i)
#define _rev(i, u) for(int i = head[u]; i; i = e[i].nxt)
#define pb push_back
#define fi first
#define se second
#define mst(f, i) memset(f, i, sizeof f)
using namespace std;
#ifdef ONLINE_JUDGE
#define debug(...) 0
#else
#define debug(...) fprintf(stderr, __VA_ARGS__), fflush(stderr)
#endif
typedef long long ll;
typedef pair<ll, ll> PII;
namespace fastio{
    #ifdef ONLINE_JUDGE
    char ibuf[1 << 20],*p1 = ibuf, *p2 = ibuf;
    #define get() p1 == p2 && (p2 = (p1 = ibuf) + fread(ibuf, 1, 1 << 20, stdin), p1 == p2) ? EOF : *p1++
    #else
    #define get() getchar()
    #endif
    template<typename T> inline void read(T &t){
        T x = 0, f = 1;
        char c = getchar();
        while(!isdigit(c)){
            if(c == '-') f = -f;
            c = getchar();
        }
        while(isdigit(c)) x = x * 10 + c - '0', c = getchar();
        t = x * f;
    }
    template<typename T, typename ... Args> inline void read(T &t, Args&... args){
        read(t);
        read(args...);
    }
    template<typename T> void write(T t){
        if(t < 0) putchar('-'), t = -t;
        if(t >= 10) write(t / 10);
        putchar(t % 10 + '0');
    }
    template<typename T, typename ... Args> void write(T t, Args... args){
        write(t), putchar(' '), write(args...);
    }
    template<typename T> void writeln(T t){
        write(t);
        puts("");
    }
    template<typename T> void writes(T t){
        write(t), putchar(' ');
    }
    #undef get
};
using namespace fastio;
#define multitest() int T; read(T); _rep(tCase, 1, T)
namespace Calculation{
    const ll mod = 998244353;
    ll ksm(ll p, ll h){ll base = p % mod, res = 1; while(h){if(h & 1ll) res = res * base % mod; base = base * base % mod, h >>= 1ll;} return res;}
    void dec(ll &x, ll y){x = ((x - y) % mod + mod) % mod;}
    void add(ll &x, ll y){x = (x + y) % mod;}
    void mul(ll &x, ll y){x = x * y % mod;}
    ll sub(ll x, ll y){return ((x - y) % mod + mod) % mod;}
    ll pls(ll x, ll y){return ((x + y) % mod + mod) % mod;}
    ll mult(ll x, ll y){return x * y % mod;}
}
using namespace Calculation;
const int N = 1e6 + 5;
const ll base = 13331;
int n, m, f[N], g[N];
char s[N];
struct hashtable{
    ll mod, mod2, pw[N], pw2[N], pre[N], pre2[N];
    hashtable(){mod = 998244353, mod2 = 1e9 + 9;}
    void init(char *s){
        pw[0] = pw2[0] = 1;
        _rep(i, 1, n) pw[i] = pw[i - 1] * base % mod, pw2[i] = pw2[i - 1] * base % mod2;
        _rep(i, 1, n) pre[i] = (pre[i - 1] * base + s[i]) % mod, pre2[i] = (pre2[i - 1] * base + s[i]) % mod2;
    }
    PII gethash(ll l, ll r){
        return make_pair((pre[r] - pre[l - 1] * pw[r - l + 1] % mod + mod) % mod, (pre2[r] - pre2[l - 1] * pw2[r - l + 1] % mod2 + mod2) % mod2);
    }
}hsh, hshr;
struct Query{
    int l, r;
}q[N];
PII ans[N];
bool check(int l, int r, int L, int R){
    L = n - L + 1, R = n - R + 1, swap(L, R);
    return hsh.gethash(l, r) == hshr.gethash(L, R);
}
struct sgt{
    int num, rt[N], tr[N * 25], ls[N * 25], rs[N * 25];
    void modify(int &x, int y, int l, int r, int p){
        x = ++num, tr[x] = tr[y], ls[x] = ls[y], rs[x] = rs[y];
        tr[x] = max(tr[x], p);
        if(l == r) return;
        int mid = l + r >> 1;
        if(p <= mid) modify(ls[x], ls[y], l, mid, p);
        else modify(rs[x], rs[y], mid + 1, r, p);
    }
    int query(int x, int l, int r, int L, int R){
        if(!x) return 0;
        if(l >= L && r <= R) return tr[x];
        int mid = l + r >> 1, res = 0;
        if(L <= mid) res = max(res, query(ls[x], l, mid, L, R));
        if(R > mid) res = max(res, query(rs[x], mid + 1, r, L, R));
        return res;
    }
    void clr(){_rep(i, 1, num) tr[i] = ls[i] = rs[i] = 0; _rep(i, 0, n) rt[i] = 0; num = 0;}
}tr, tr2;
vector<int> h[N], h2[N];
void work(){
    hsh.init(s), reverse(s + 1, s + 1 + n), hshr.init(s), reverse(s + 1, s + 1 + n);
    _rep(i, 1, n){
        int l = 1, r = min(i, n - i);
        while(l <= r){
            int mid = l + r >> 1;
            if(check(i - mid + 1, i, i + 1, i + mid)) f[i] = mid, l = mid + 1;
            else r = mid - 1;
        }
        l = 1, r = min(i - 1, n - i);
        while(l <= r){
            int mid = l + r >> 1;
            if(check(i - mid, i - 1, i + 1, i + mid)) g[i] = mid, l = mid + 1;
            else r = mid - 1;
        }
        h[i - f[i]].pb(i);
        h2[i - g[i]].pb(i);
    }
    _rep(i, 0, n){
        if(i) tr.rt[i] = tr.rt[i - 1], tr2.rt[i] = tr2.rt[i - 1];
        for(auto &j : h[i]) tr.modify(tr.rt[i], tr.rt[i], 1, n, j);
        for(auto &j : h2[i]) tr2.modify(tr2.rt[i], tr2.rt[i], 1, n, j);
    }
    // _rep(i, 1, n) debug("(%d,%d)\n", f[i], g[i]);
    _rep(i, 1, m){
        int l = q[i].l, r = q[i].r, len = r - l + 1;
        // debug("[%d,%d] %d\n", l, r, len);
        int L = 1, R = len, cur = 0;
        while(L <= R){
            int mid = L + R >> 1;
            if(check(l, l + mid - 1, r - mid + 1, r)) cur = mid, L = mid + 1;
            else R = mid - 1;
        }
        // debug("cur:%d\n", cur);
        /*---------------*/
        PII res = {2e9, 0};
        int maxn = tr.query(tr.rt[cur + l - 1], 1, n, l, (l + r - 1) / 2);
        // _rep(p, l, (l + r - 1) / 2) if(p - f[p] <= cur + l - 1) maxn = p;
        if(maxn){
            int t = len - 2 * (maxn - l + 1), num = min(maxn - l + 1, f[maxn]) + cur - (maxn - l + 1) + 1;
            if(t < res.fi) res = {t, num};
            else if(t == res.fi) res.se += num;
        }
        // debug("p:%d\n", maxn);
        // debug("res(%d,%d)\n", res.fi, res.se);
        // assert(cur + l > 0);
        maxn = tr2.query(tr2.rt[cur + l], 1, n, l, (l + r) / 2);
        // _rep(p, l, (l + r) / 2) if(p - g[p] <= cur + l) maxn = p;
        if(maxn){
            int t = len - 2 * (maxn - l) - 1, num = min(maxn - l, g[maxn]) + cur - (maxn - l) + 1;
            if(t < res.fi) res = {t, num};
            else if(t == res.fi) res.se += num;
        }
        // debug("res(%d,%d)\n", res.fi, res.se);
        if(res.fi < ans[i].fi) ans[i] = res;
        else if(res.fi == ans[i].fi) ans[i].se += res.se;
    }
    tr.clr(), tr2.clr();
    _rep(i, 0, n) h[i].clear(), h2[i].clear();
    // debug("====================\n");
}
int main(){
    read(n), scanf("%s", s + 1);
    read(m); _rep(i, 1, m) read(q[i].l, q[i].r), ans[i] = {2e9, 0};
    work();
    reverse(s + 1, s + 1 + n); 
    _rep(i, 1, m) swap(q[i].l, q[i].r), q[i].l = n - q[i].l + 1, q[i].r = n - q[i].r + 1;
    _rep(i, 1, n) f[i] = g[i] = 0;
    work();
    _rep(i, 1, m){
        if(!ans[i].fi) ans[i].se = 0;
        write(ans[i].fi, ans[i].se), puts("");
    }
    return 0;
}