Problem: Ildar took a band (a thin strip of cloth) and colored it. Formally, the band has n cells, each of them is colored into one of 26 colors, so we can denote each color with one of the lowercase letters of English alphabet. 

Ildar decided to take some segment of the band [l, r] (1 ≤ l ≤ r ≤ n) he likes and cut it from the band. So he will create a new band that can be represented as a string t = s_l s_{l+1} … s_r.

After that Ildar will play the following game: he cuts the band t into some new bands and counts the number of different bands among them. Formally, Ildar chooses 1 ≤ k ≤ |t| indexes 1 ≤ i_1 < i_2 < … < i_k = |t| and cuts t to k bands-strings t_1 t_2 … t_{i_1}, t_{i_1 + 1} … t_{i_2}, …, {t_{i_{k-1} + 1}} … t_{i_k} and counts the number of different bands among them. He wants to know the minimal possible number of different bands he can get under the constraint that at least one band repeats at least two times. The result of the game is this number. If it is impossible to cut t in such a way, the result of the game is -1.

Unfortunately Ildar hasn't yet decided which segment he likes, but he has q segments-candidates [l_1, r_1], [l_2, r_2], ..., [l_q, r_q]. Your task is to calculate the result of the game for each of them.

Input

The first line contains one integer n (1 ≤ n ≤ 200 000) — the length of the band Ildar has.

The second line contains a string s consisting of n lowercase English letters — the band Ildar has.

The third line contains a single integer q (1 ≤ q ≤ 200 000) — the number of segments Ildar has chosen as candidates.

Each of the next q lines contains two integer integers l_i and r_i (1 ≤ l_i ≤ r_i ≤ n) denoting the ends of the i-th segment.

Output

Output q lines, where the i-th of them should contain the result of the game on the segment [l_i, r_i].

Example

Input

9
abcabcdce
7
1 6
4 7
5 9
6 9
1 9
3 6
4 4


Output

1
-1
4
3
2
2
-1

Note

Consider the first example.

If Ildar chooses the segment [1, 6], he cuts a string t = abcabc. If he cuts t into two bands abc and abc, the band abc repeats two times and the number of different tapes is 1. So, the result of this game is 1.

If Ildar chooses the segment [4, 7], he cuts a string t = abcd. It is impossible to cut this band in such a way that there is at least one band repeating at least two times. So, the result of this game is -1.

If Ildar chooses the segment [3, 6], he cuts a string t = cabc. If he cuts t into three bands c, ab and c, the band c repeats two times and the number of different bands is 2. So, the result of this game is 2.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
const int N = 200010;
int ff[N], n, a[N], sql[N], sqr[N], sqr2[N];
struct SuffixArray {
  int sa[N], rk[N], ht[N];
  bool t[N << 1];
  int hv[19][N];
  bool islms(const int i, const bool *t) { return i > 0 && t[i] && !t[i - 1]; }
  template <class T>
  inline void sort(T s, int *sa, const int len, const int sz, const int sigma,
                   bool *t, int *b, int *cb, int *p) {
    memset(b, 0, sizeof(int) * sigma);
    memset(sa, -1, sizeof(int) * len);
    for (int i = 0; i < len; i++) b[(int)s[i]]++;
    cb[0] = b[0];
    for (int i = 1; i < sigma; i++) cb[i] = cb[i - 1] + b[i];
    for (int i = sz - 1; i >= 0; i--) sa[--cb[(int)s[p[i]]]] = p[i];
    for (int i = 1; i < sigma; i++) cb[i] = cb[i - 1] + b[i - 1];
    for (int i = 0; i < len; i++)
      if (sa[i] > 0 && !t[sa[i] - 1]) sa[cb[(int)s[sa[i] - 1]]++] = sa[i] - 1;
    cb[0] = b[0];
    for (int i = 1; i < sigma; i++) cb[i] = cb[i - 1] + b[i];
    for (int i = len - 1; i >= 0; i--)
      if (sa[i] > 0 && t[sa[i] - 1]) sa[--cb[(int)s[sa[i] - 1]]] = sa[i] - 1;
  }
  template <class T>
  inline void sais(T s, int *sa, const int len, bool *t, int *b, int *b1,
                   const int sigma) {
    int p = -1, *cb = b + sigma;
    t[len - 1] = 1;
    for (int i = len - 1 - 1; i >= 0; i--)
      t[i] = s[i] < s[i + 1] || (s[i] == s[i + 1] && t[i + 1]);
    int sz = 0, cnt = 0;
    for (int i = 1; i < len; i++)
      if (t[i] && !t[i - 1]) b1[sz++] = i;
    sort(s, sa, len, sz, sigma, t, b, cb, b1);
    sz = 0;
    for (int i = 0; i < len; i++)
      if (islms(sa[i], t)) sa[sz++] = sa[i];
    for (int i = sz; i < len; i++) sa[i] = -1;
    for (int i = 0; i < sz; i++) {
      int x = sa[i];
      for (int j = 0; j < len; j++) {
        if (p == -1 || s[x + j] != s[p + j] || t[x + j] != t[p + j]) {
          cnt++;
          p = x;
          break;
        } else if (j > 0 && (islms(x + j, t) || islms(p + j, t))) {
          break;
        }
      }
      sa[sz + (x >>= 1)] = cnt - 1;
    }
    for (int i = len - 1, j = len - 1; i >= sz; i--)
      if (sa[i] >= 0) sa[j--] = sa[i];
    int *s1 = sa + len - sz, *b2 = b1 + sz;
    if (cnt < sz)
      sais(s1, sa, sz, t + len, b, b1 + sz, cnt);
    else
      for (int i = 0; i < sz; i++) sa[s1[i]] = i;
    for (int i = 0; i < sz; i++) b2[i] = b1[sa[i]];
    sort(s, sa, len, sz, sigma, t, b, cb, b2);
  }
  template <class T>
  inline void getHeight(T s, int n) {
    for (int i = 1; i < n + 1; i++) rk[sa[i]] = i;
    int j = 0, k = 0;
    for (int i = 0; i < n; ht[rk[i++]] = k)
      for (k ? k-- : 0, j = sa[rk[i] - 1]; s[i + k] == s[j + k]; k++)
        ;
  }
  template <class T>
  inline void init(T s, const int len, const int sigma) {
    sais(s, sa, len, t, rk, ht, sigma);
  }
  inline void solve(int *s, int len) {
    init(s, len + 1, 28);
    getHeight(s, len);
    rk[len] = 0;
    for (int i = 1; i < len + 1; i++) hv[0][i] = ht[i];
    for (int j = 1; j < 18; j++)
      for (int i = 1; i + (1 << j) - 1 <= len; i++)
        hv[j][i] = min(hv[j - 1][i], hv[j - 1][i + (1 << (j - 1))]);
  }
  int lcp(int p, int q) {
    if (q > n) return 0;
    if (p == q) return n - p + 1;
    p = rk[p - 1];
    q = rk[q - 1];
    if (p > q) swap(p, q);
    int w = ff[q - p];
    return min(hv[w][p + 1], hv[w][q - (1 << w) + 1]);
  }
} s1, s2;
char s[N];
void gao(int l, int r, int ty) {
  int pi = l - s2.lcp(n + 1 - r, n + 1 - (l - 1));
  int pj = r + s1.lcp(l, r + 1);
  int p = r - l + 1;
  if (pj - pi + 1 >= 2 * p && pi < l && l <= pi + p && (ty == 0 || pj != n)) {
    for (int k = pi + 2 * p - 1; k <= pj; k++) {
      sqr[k] = min(sqr[k], 2 * p);
      sql[k - 2 * p + 1] = min(sql[k - 2 * p + 1], 2 * p);
      sqr2[k] = max(sqr2[k], k - 2 * p + 1);
    }
  }
}
void gao(int *a) {
  s1.solve(a + 1, n);
  reverse(a + 1, a + n + 1);
  a[n + 1] = 0;
  s2.solve(a + 1, n);
  reverse(a + 1, a + n + 1);
  stack<pair<int, int> > st;
  st.push(make_pair(n + 1, n + 1));
  for (int i = n + 1 - 1; i >= 1; i--) {
    int j = i;
    while (((int)(st).size()) > 1) {
      auto seg = st.top();
      if (s1.rk[i - 1] >= s1.rk[seg.first - 1]) break;
      j = seg.second;
      st.pop();
    }
    st.push(make_pair(i, j));
    gao(i, j, 0);
  }
  st = stack<pair<int, int> >();
  st.push(make_pair(n + 1, n + 1));
  for (int i = n + 1 - 1; i >= 1; i--) {
    int j = i;
    while (((int)(st).size()) > 1) {
      auto seg = st.top();
      if (s1.rk[i - 1] <= s1.rk[seg.first - 1]) break;
      j = seg.second;
      st.pop();
    }
    st.push(make_pair(i, j));
    gao(i, j, 1);
  }
}
namespace border {
int tmp1[N], tmp2[N], c[N], sa[N], rk[22][N], l, r, lev;
pair<int, int> pos[22][N];
void buildDict(char *s, int *sa, int *x, int *y, int n, int m = 128) {
  for (int i = 0; i < m; i++) c[i] = 0;
  for (int i = 0; i < n; i++) c[x[i] = s[i]]++;
  for (int i = 1; i < m; i++) c[i] += c[i - 1];
  for (int i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;
  for (int i = 0; i < n; i++) rk[0][i] = x[i];
  for (int i = 0; i < n; i++) pos[0][i] = make_pair(rk[0][sa[i]], sa[i]);
  lev = 1;
  for (int k = 1; k < n; k <<= 1, lev++) {
    int p = 0;
    for (int i = n - 1; i >= n - k; i--) y[p++] = i;
    for (int i = 0; i < n; i++)
      if (sa[i] >= k) y[p++] = sa[i] - k;
    for (int i = 0; i < m; i++) c[i] = 0;
    for (int i = 0; i < n; i++) c[x[y[i]]]++;
    for (int i = 1; i < m; i++) c[i] += c[i - 1];
    for (int i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
    swap(x, y);
    p = 1;
    x[sa[0]] = 0;
    y[n] = -1;
    for (int i = 1; i < n; i++)
      if (y[sa[i - 1]] == y[sa[i]])
        assert(sa[i - 1] + k <= n && sa[i] + k <= n);
    for (int i = 1; i < n; i++)
      x[sa[i]] = (y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k])
                     ? p - 1
                     : p++;
    for (int i = 0; i < n; i++) rk[lev][i] = x[i];
    for (int i = 0; i < n; i++) pos[lev][i] = make_pair(rk[lev][sa[i]], sa[i]);
    m = p;
  }
}
struct seq {
  int a, k, sz;
  bool contain(int x) {
    if (sz == 0) return 0;
    if (x < a || x > a + (sz - 1) * k) return 0;
    if (x == a) return 1;
    return (x - a) % k == 0;
  }
};
long long Inv(long long q, long long m) {
  if (q == 0) return 0;
  assert(q >= 0);
  long long a1 = m, b1 = 0, a2 = q, b2 = 1, a3, b3, t;
  while (a2 != 1) {
    t = a1 / a2, a3 = a1 - t * a2, b3 = b1 - t * b2 % m, a1 = a2, a2 = a3,
    b1 = b2, b2 = b3;
    if (b2 < 0) b2 += m;
  }
  return b2;
}
pair<long long, long long> merge(long long a, long long b, long long c,
                                 long long d) {
  c -= a;
  long long dd = gcd(b, d);
  if (c % dd != 0) return make_pair(-1, -1);
  b /= dd;
  c /= dd;
  d /= dd;
  long long t = c * Inv(b, d) % d;
  if (t < 0) t += d;
  return make_pair(b * t * dd + a, b * d * dd);
}
seq intersect(seq a, seq b) {
  if (a.sz > b.sz) swap(a, b);
  if (a.sz == 0)
    return a;
  else if (a.sz == 1) {
    if (b.contain(a.a))
      return a;
    else
      return (seq){0, 0, 0};
  } else {
    pair<long long, long long> d = merge(a.a % a.k, a.k, b.a % b.k, b.k);
    if (d.second == -1) return (seq){0, 0, 0};
    int l = max(a.a, b.a),
        r = min(a.a + (a.sz - 1) * a.k, b.a + (b.sz - 1) * b.k);
    int pl = (l - d.first + d.second - 1) / d.second,
        pr = (r - d.first + d.second) / d.second - 1;
    if (pl > pr)
      return (seq){0, 0, 0};
    else
      return (seq){(int)(d.first + pl * d.second),
                   (pl == pr) ? 1 : (int)d.second, pr - pl + 1};
  }
}
int findprev(int p, int lev, int r) {
  pair<int, int> *ps =
      lower_bound(pos[lev], pos[lev] + n, make_pair(rk[lev][p], r + 1));
  if (ps != pos[lev])
    --ps;
  else
    return -1;
  if (ps->first != rk[lev][p])
    return -1;
  else
    return ps->second;
}
int findnxt(int p, int lev, int l) {
  pair<int, int> *ps =
      lower_bound(pos[lev], pos[lev] + n, make_pair(rk[lev][p], l));
  if (ps == pos[lev] + n || ps->first != rk[lev][p])
    return -1;
  else
    return ps->second;
}
seq occur(int p, int lev, int l, int r) {
  int fp = findnxt(p, lev, l);
  if (fp == -1 || fp > r) return (seq){0, 0, 0};
  int fq = findnxt(p, lev, fp + 1);
  if (fq == -1 || fq > r) return (seq){fp, 1, 1};
  int fr = findprev(p, lev, r);
  return (seq){fp, fq - fp, (fr - fp) / (fq - fp) + 1};
}
int query(int l, int r) {
  --l;
  --r;
  for (int k = lev; k >= 1; k--) {
    if ((r - l + 1) <= (1 << (k - 1))) continue;
    seq a = occur(l, k - 1, max(r - (1 << (k)) + 1, l), r - (1 << (k - 1)) + 1);
    seq b = occur(r - (1 << (k - 1)) + 1, k - 1, l,
                  min(l + (1 << (k - 1)), r - (1 << (k - 1)) + 1));
    a.a = l + r - (a.a + (a.sz - 1) * a.k);
    b.a += (1 << (k - 1)) - 1;
    seq c = intersect(a, b);
    if (c.sz != 0 && c.a + (c.sz - 1) * c.k == r) --c.sz;
    if (c.sz != 0) return c.a + (c.sz - 1) * c.k - l + 1;
  }
  return 0;
}
void init() { buildDict(s, sa, tmp1, tmp2, n); }
}  // namespace border
int cnt[26][N];
int query(int l, int r) {
  int d = border::query(l, r);
  if (d != 0) {
    if ((r - l + 1) % (r - l + 1 - d) == 0)
      return 1;
    else
      return 2;
  }
  if (l + sql[l] - 1 <= r || r - sqr[r] + 1 >= l) return 2;
  if (sqr2[r] >= l) return 3;
  if (cnt[a[l] - 1][r] - cnt[a[l] - 1][l - 1] >= 2) return 3;
  if (cnt[a[r] - 1][r] - cnt[a[r] - 1][l - 1] >= 2) return 3;
  for (int i = 0; i < 26; i++)
    if (cnt[i][r] - cnt[i][l - 1] >= 2) return 4;
  return -1;
}
int q, l, r;
int main() {
  for (int i = 2; i < 200001; i++) ff[i] = ff[i >> 1] + 1;
  scanf("%d", &n);
  for (int i = 1; i < n + 1; i++) sql[i] = n + 1, sqr[i] = n + 1;
  scanf("%s", s);
  for (int i = 1; i < n + 1; i++) {
    a[i] = s[i - 1] - 'a' + 1;
    for (int j = 0; j < 26; j++) cnt[j][i] = cnt[j][i - 1];
    cnt[a[i] - 1][i]++;
  }
  gao(a);
  for (int i = 1; i < n + 1; i++) sqr2[i] = max(sqr2[i], sqr2[i - 1]);
  border::init();
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    scanf("%d%d", &l, &r);
    printf("%d\n", query(l, r));
  }
}