#include<iostream>
#include<vector>
#include<algorithm>
#include<cassert>

#include <algorithm>
#include <cassert>
#include <numeric>
#include <string>
#include <vector>

namespace atcoder {

namespace internal {

std::vector<int> sa_naive(const std::vector<int>& s) {
    int n = int(s.size());
    std::vector<int> sa(n);
    std::iota(sa.begin(), sa.end(), 0);
    std::sort(sa.begin(), sa.end(), [&](int l, int r) {
        if (l == r) return false;
        while (l < n && r < n) {
            if (s[l] != s[r]) return s[l] < s[r];
            l++;
            r++;
        }
        return l == n;
    });
    return sa;
}

std::vector<int> sa_doubling(const std::vector<int>& s) {
    int n = int(s.size());
    std::vector<int> sa(n), rnk = s, tmp(n);
    std::iota(sa.begin(), sa.end(), 0);
    for (int k = 1; k < n; k *= 2) {
        auto cmp = [&](int x, int y) {
            if (rnk[x] != rnk[y]) return rnk[x] < rnk[y];
            int rx = x + k < n ? rnk[x + k] : -1;
            int ry = y + k < n ? rnk[y + k] : -1;
            return rx < ry;
        };
        std::sort(sa.begin(), sa.end(), cmp);
        tmp[sa[0]] = 0;
        for (int i = 1; i < n; i++) {
            tmp[sa[i]] = tmp[sa[i - 1]] + (cmp(sa[i - 1], sa[i]) ? 1 : 0);
        }
        std::swap(tmp, rnk);
    }
    return sa;
}

template <int THRESHOLD_NAIVE = 10, int THRESHOLD_DOUBLING = 40>
std::vector<int> sa_is(const std::vector<int>& s, int upper) {
    int n = int(s.size());
    if (n == 0) return {};
    if (n == 1) return {0};
    if (n == 2) {
        if (s[0] < s[1]) {
            return {0, 1};
        } else {
            return {1, 0};
        }
    }
    if (n < THRESHOLD_NAIVE) {
        return sa_naive(s);
    }
    if (n < THRESHOLD_DOUBLING) {
        return sa_doubling(s);
    }

    std::vector<int> sa(n);
    std::vector<bool> ls(n);
    for (int i = n - 2; i >= 0; i--) {
        ls[i] = (s[i] == s[i + 1]) ? ls[i + 1] : (s[i] < s[i + 1]);
    }
    std::vector<int> sum_l(upper + 1), sum_s(upper + 1);
    for (int i = 0; i < n; i++) {
        if (!ls[i]) {
            sum_s[s[i]]++;
        } else {
            sum_l[s[i] + 1]++;
        }
    }
    for (int i = 0; i <= upper; i++) {
        sum_s[i] += sum_l[i];
        if (i < upper) sum_l[i + 1] += sum_s[i];
    }

    auto induce = [&](const std::vector<int>& lms) {
        std::fill(sa.begin(), sa.end(), -1);
        std::vector<int> buf(upper + 1);
        std::copy(sum_s.begin(), sum_s.end(), buf.begin());
        for (auto d : lms) {
            if (d == n) continue;
            sa[buf[s[d]]++] = d;
        }
        std::copy(sum_l.begin(), sum_l.end(), buf.begin());
        sa[buf[s[n - 1]]++] = n - 1;
        for (int i = 0; i < n; i++) {
            int v = sa[i];
            if (v >= 1 && !ls[v - 1]) {
                sa[buf[s[v - 1]]++] = v - 1;
            }
        }
        std::copy(sum_l.begin(), sum_l.end(), buf.begin());
        for (int i = n - 1; i >= 0; i--) {
            int v = sa[i];
            if (v >= 1 && ls[v - 1]) {
                sa[--buf[s[v - 1] + 1]] = v - 1;
            }
        }
    };

    std::vector<int> lms_map(n + 1, -1);
    int m = 0;
    for (int i = 1; i < n; i++) {
        if (!ls[i - 1] && ls[i]) {
            lms_map[i] = m++;
        }
    }
    std::vector<int> lms;
    lms.reserve(m);
    for (int i = 1; i < n; i++) {
        if (!ls[i - 1] && ls[i]) {
            lms.push_back(i);
        }
    }

    induce(lms);

    if (m) {
        std::vector<int> sorted_lms;
        sorted_lms.reserve(m);
        for (int v : sa) {
            if (lms_map[v] != -1) sorted_lms.push_back(v);
        }
        std::vector<int> rec_s(m);
        int rec_upper = 0;
        rec_s[lms_map[sorted_lms[0]]] = 0;
        for (int i = 1; i < m; i++) {
            int l = sorted_lms[i - 1], r = sorted_lms[i];
            int end_l = (lms_map[l] + 1 < m) ? lms[lms_map[l] + 1] : n;
            int end_r = (lms_map[r] + 1 < m) ? lms[lms_map[r] + 1] : n;
            bool same = true;
            if (end_l - l != end_r - r) {
                same = false;
            } else {
                while (l < end_l) {
                    if (s[l] != s[r]) {
                        break;
                    }
                    l++;
                    r++;
                }
                if (l == n || s[l] != s[r]) same = false;
            }
            if (!same) rec_upper++;
            rec_s[lms_map[sorted_lms[i]]] = rec_upper;
        }

        auto rec_sa =
            sa_is<THRESHOLD_NAIVE, THRESHOLD_DOUBLING>(rec_s, rec_upper);

        for (int i = 0; i < m; i++) {
            sorted_lms[i] = lms[rec_sa[i]];
        }
        induce(sorted_lms);
    }
    return sa;
}

}  // namespace internal

std::vector<int> suffix_array(const std::vector<int>& s, int upper) {
    assert(0 <= upper);
    for (int d : s) {
        assert(0 <= d && d <= upper);
    }
    auto sa = internal::sa_is(s, upper);
    return sa;
}

template <class T> std::vector<int> suffix_array(const std::vector<T>& s) {
    int n = int(s.size());
    std::vector<int> idx(n);
    iota(idx.begin(), idx.end(), 0);
    sort(idx.begin(), idx.end(), [&](int l, int r) { return s[l] < s[r]; });
    std::vector<int> s2(n);
    int now = 0;
    for (int i = 0; i < n; i++) {
        if (i && s[idx[i - 1]] != s[idx[i]]) now++;
        s2[idx[i]] = now;
    }
    return internal::sa_is(s2, now);
}

std::vector<int> suffix_array(const std::string& s) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return internal::sa_is(s2, 255);
}

template <class T>
std::vector<int> lcp_array(const std::vector<T>& s,
                           const std::vector<int>& sa) {
    int n = int(s.size());
    assert(n >= 1);
    std::vector<int> rnk(n);
    for (int i = 0; i < n; i++) {
        rnk[sa[i]] = i;
    }
    std::vector<int> lcp(n - 1);
    int h = 0;
    for (int i = 0; i < n; i++) {
        if (h > 0) h--;
        if (rnk[i] == 0) continue;
        int j = sa[rnk[i] - 1];
        for (; j + h < n && i + h < n; h++) {
            if (s[j + h] != s[i + h]) break;
        }
        lcp[rnk[i] - 1] = h;
    }
    return lcp;
}

std::vector<int> lcp_array(const std::string& s, const std::vector<int>& sa) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return lcp_array(s2, sa);
}

template <class T> std::vector<int> z_algorithm(const std::vector<T>& s) {
    int n = int(s.size());
    if (n == 0) return {};
    std::vector<int> z(n);
    z[0] = 0;
    for (int i = 1, j = 0; i < n; i++) {
        int& k = z[i];
        k = (j + z[j] <= i) ? 0 : std::min(j + z[j] - i, z[i - j]);
        while (i + k < n && s[k] == s[i + k]) k++;
        if (j + z[j] < i + z[i]) j = i;
    }
    z[0] = n;
    return z;
}

std::vector<int> z_algorithm(const std::string& s) {
    int n = int(s.size());
    std::vector<int> s2(n);
    for (int i = 0; i < n; i++) {
        s2[i] = s[i];
    }
    return z_algorithm(s2);
}

}  // namespace atcoder


#include <algorithm>
#include <cassert>
#include <vector>


#ifdef _MSC_VER
#include <intrin.h>
#endif

namespace atcoder {

namespace internal {

int ceil_pow2(int n) {
    int x = 0;
    while ((1U << x) < (unsigned int)(n)) x++;
    return x;
}

constexpr int bsf_constexpr(unsigned int n) {
    int x = 0;
    while (!(n & (1 << x))) x++;
    return x;
}

int bsf(unsigned int n) {
#ifdef _MSC_VER
    unsigned long index;
    _BitScanForward(&index, n);
    return index;
#else
    return __builtin_ctz(n);
#endif
}

}  // namespace internal

}  // namespace atcoder


namespace atcoder {

template <class S, S (*op)(S, S), S (*e)()> struct segtree {
  public:
    segtree() : segtree(0) {}
    explicit segtree(int n) : segtree(std::vector<S>(n, e())) {}
    explicit segtree(const std::vector<S>& v) : _n(int(v.size())) {
        log = internal::ceil_pow2(_n);
        size = 1 << log;
        d = std::vector<S>(2 * size, e());
        for (int i = 0; i < _n; i++) d[size + i] = v[i];
        for (int i = size - 1; i >= 1; i--) {
            update(i);
        }
    }

    void set(int p, S x) {
        assert(0 <= p && p < _n);
        p += size;
        d[p] = x;
        for (int i = 1; i <= log; i++) update(p >> i);
    }

    S get(int p) const {
        assert(0 <= p && p < _n);
        return d[p + size];
    }

    S prod(int l, int r) const {
        assert(0 <= l && l <= r && r <= _n);
        S sml = e(), smr = e();
        l += size;
        r += size;

        while (l < r) {
            if (l & 1) sml = op(sml, d[l++]);
            if (r & 1) smr = op(d[--r], smr);
            l >>= 1;
            r >>= 1;
        }
        return op(sml, smr);
    }

    S all_prod() const { return d[1]; }

    template <bool (*f)(S)> int max_right(int l) const {
        return max_right(l, [](S x) { return f(x); });
    }
    template <class F> int max_right(int l, F f) const {
        assert(0 <= l && l <= _n);
        assert(f(e()));
        if (l == _n) return _n;
        l += size;
        S sm = e();
        do {
            while (l % 2 == 0) l >>= 1;
            if (!f(op(sm, d[l]))) {
                while (l < size) {
                    l = (2 * l);
                    if (f(op(sm, d[l]))) {
                        sm = op(sm, d[l]);
                        l++;
                    }
                }
                return l - size;
            }
            sm = op(sm, d[l]);
            l++;
        } while ((l & -l) != l);
        return _n;
    }

    template <bool (*f)(S)> int min_left(int r) const {
        return min_left(r, [](S x) { return f(x); });
    }
    template <class F> int min_left(int r, F f) const {
        assert(0 <= r && r <= _n);
        assert(f(e()));
        if (r == 0) return 0;
        r += size;
        S sm = e();
        do {
            r--;
            while (r > 1 && (r % 2)) r >>= 1;
            if (!f(op(d[r], sm))) {
                while (r < size) {
                    r = (2 * r + 1);
                    if (f(op(d[r], sm))) {
                        sm = op(d[r], sm);
                        r--;
                    }
                }
                return r + 1 - size;
            }
            sm = op(d[r], sm);
        } while ((r & -r) != r);
        return 0;
    }

  private:
    int _n, size, log;
    std::vector<S> d;

    void update(int k) { d[k] = op(d[2 * k], d[2 * k + 1]); }
};

}  // namespace atcoder

using namespace std;
#include<vector>
#include<string>
vector<int>manacher(const string&s)
{
	vector<int>ret(s.size());
	int i=0,j=0;
	while(i<s.size())
	{
		while(i-j>=0&&i+j<s.size()&&s[i-j]==s[i+j])j++;
		ret[i]=j;
		int k=1;
		while(i-k>=0&&i+k<s.size()&&k+ret[i-k]<j)ret[i+k]=ret[i-k],k++;
		i+=k;j-=k;
	}
	return ret;
}
int op_min(int a,int b){return min(a,b);}
int e_min(){return(int)1e9;}
int op_max(int a,int b){return max(a,b);}
int e_max(){return-(int)1e9;}
vector<int>get_pali(string S,vector<pair<int,int> >LR)
{
	vector<int>ret(LR.size(),0);
	vector<int>ord(LR.size());
	for(int i=0;i<LR.size();i++)ord[i]=i;
	sort(ord.begin(),ord.end(),[&](int l,int r){return LR[l].first<LR[r].first;});
	string T;
	for(char c:S)
	{
		if(!T.empty())T+='$';
		T+=c;
	}
	vector<int>M=manacher(T);
	vector<vector<int> >Q(S.size());
	for(int i=0;i<M.size();i++)
	{
		if(i%2==0)
		{
			int len=(M[i]+1)/2;
			assert(len>=1);
			assert(i/2-len+1>=0);
			Q[i/2-len+1].push_back(i);
		}
		else
		{
			int len=M[i]/2;
			if(len>=1)
			{
				assert(i/2-len+1>=0);
				Q[i/2-len+1].push_back(i);
			}
		}
	}
	atcoder::segtree<int,op_max,e_max>seg(M.size());
	int ord_i=0;
	for(int i=0;i<S.size();i++)
	{
		for(int id:Q[i])seg.set(id,id);
		while(ord_i<LR.size()&&LR[ord[ord_i]].first==i)
		{
			int id=ord[ord_i++];
			int l=LR[id].first,r=LR[id].second;
			int m_id=seg.prod(2*l,2*l+(r-l));
			if(m_id%2==0)
			{
				ret[id]=(m_id/2-l)*2+1;
			}
			else
			{
				ret[id]=((m_id+1)/2-l)*2;
			}
		}
	}
	return ret;
}
int N,M;
string S;
int L[400000],R[400000],L_del[400000],R_del[400000];
int cost[400000],way[400000];
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>S>>M;
	for(int i=0;i<M;i++)
	{
		cin>>L[i]>>R[i];
		L[i]--;
	}
	{//first : calc maximul
		string SprS;
		{
			string rS=S;
			reverse(rS.begin(),rS.end());
			SprS=S+rS;
		}
		vector<int>sa=atcoder::suffix_array(SprS);
		assert(sa.size()==N+N);
		vector<int>sa_inv(N+N);
		for(int i=0;i<N+N;i++)sa_inv[sa[i]]=i;
		vector<int>lcp=atcoder::lcp_array(SprS,sa);
		atcoder::segtree<int,op_min,e_min>seg(lcp);
		for(int i=0;i<M;i++)
		{
			int l=sa_inv[L[i]],r=sa_inv[N+N-R[i]];
			int get_len=seg.prod(min(l,r),max(l,r));
			int len=R[i]-L[i];
			L_del[i]=L[i]+get_len;
			R_del[i]=R[i]-get_len;
			if(L_del[i]>=R_del[i])
			{
				cost[i]=0;
				way[i]=0;
			}
			else
			{
				cost[i]=-1;
				way[i]=0;
			}
		}
	}
	{//second : calc cost
		vector<pair<int,int> >LR;
		LR.reserve(M);
		for(int i=0;i<M;i++)if(L_del[i]<R_del[i])LR.push_back(make_pair(L_del[i],R_del[i]));
		vector<int>ansL=get_pali(S,LR);
		string rS=S;
		reverse(rS.begin(),rS.end());
		for(pair<int,int>&p:LR)
		{
			int l=p.first,r=p.second;
			p.first=N-r;
			p.second=N-l;
		}
		vector<int>ansR=get_pali(rS,LR);
		int id=0;
		string T;
		for(char c:S)
		{
			if(!T.empty())T+='$';
			T+=c;
		}
		vector<int>Ma=manacher(T);
		for(int i=0;i<M;i++)if(L_del[i]<R_del[i])
		{
			int l=ansL[id],r=ansR[id];
			assert(l<R_del[i]-L_del[i]);
			assert(r<R_del[i]-L_del[i]);
			cost[i]=R_del[i]-L_del[i]-max(l,r);
			if(l>=r)
			{
				if(l%2==0)
				{
					int mid=L_del[i]*2+l-1;
					int can=Ma[mid]/2;
					assert(can>=l/2);
					int use=(mid-L[i]*2+1)/2;
					can=min(can,use);
					way[i]+=can-l/2+1;
				}
				else
				{
					int mid=L_del[i]*2+l-1;
					int can=(Ma[mid]+1)/2;
					assert(can>=(l+1)/2);
					int use=(mid-L[i]*2)/2+1;
					can=min(can,use);
					way[i]+=can-(l+1)/2+1;
				}
			}
			if(r>=l)
			{
				if(r%2==0)
				{
					int mid=R_del[i]*2-r-1;
					int can=Ma[mid]/2;
					assert(can>=r/2);
					int use=(R[i]*2-mid-1)/2;
					can=min(can,use);
					way[i]+=can-r/2+1;
				}
				else
				{
					int mid=R_del[i]*2-r-1;
					int can=(Ma[mid]+1)/2;
					assert(can>=(r+1)/2);
					int use=(R[i]*2-mid)/2;
					can=min(can,use);
					way[i]+=can-(r+1)/2+1;
				}
			}
			if(l==r&&l==0)way[i]--;
			id++;
		}
	}
	for(int i=0;i<M;i++)cout<<cost[i]<<" "<<way[i]<<"\n";
}