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;
int n, m, cnt[200100], rk[200100], sa[200100], height[200100], h[200100];
int has[200100], p1 = 31, sum[200100][30], dp[200100][30], flag2;
int pp[200100], f1, f2, lg[200100], len, len1, len2, lastr[200100],
    lastl[200100];
int cnt2, k, q;
char str[200100];
struct doge {
  int first, second, id;
} a[200100], b[200100];
inline void getSA() {
  for (int i = 1; i <= n; i++) cnt[str[i]]++;
  for (int i = 1; i <= 128; i++) cnt[i] += cnt[i - 1];
  for (int i = n; i >= 1; i--) rk[i] = cnt[str[i]];
  for (int Len = 1; Len <= n; Len *= 2) {
    for (int i = 1; i <= n; i++) {
      a[i].id = i;
      a[i].first = rk[i];
      a[i].second = rk[i + Len];
    }
    for (int i = 1; i <= n; i++) cnt[i] = 0;
    for (int i = 1; i <= n; i++) cnt[a[i].second]++;
    for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];
    for (int i = n; i >= 1; i--) b[cnt[a[i].second]--] = a[i];
    for (int i = 1; i <= n; i++) cnt[i] = 0;
    for (int i = 1; i <= n; i++) cnt[b[i].first]++;
    for (int i = 1; i <= n; i++) cnt[i] += cnt[i - 1];
    for (int i = n; i >= 1; i--) a[cnt[b[i].first]--] = b[i];
    rk[a[1].id] = 1;
    for (int i = 2; i <= n; i++) {
      if (a[i].first == a[i - 1].first && a[i].second == a[i - 1].second)
        rk[a[i].id] = rk[a[i - 1].id];
      else
        rk[a[i].id] = rk[a[i - 1].id] + 1;
    }
  }
  for (int i = 1; i <= n; i++) sa[rk[i]] = i;
  for (int i = 1; i <= n; i++) {
    if (k > 0) k--;
    f1 = sa[rk[i]];
    f2 = sa[rk[i] - 1];
    while (str[f1 + k] == str[f2 + k]) k++;
    height[rk[i]] = k;
  }
  for (int i = 1; i <= n; i++) dp[i][0] = height[i];
  for (int i = 1; i <= lg[n]; i++)
    for (int j = 1; j <= n; j++)
      dp[j][i] = min(dp[j][i - 1], dp[j + (1 << (i - 1))][i - 1]);
}
struct node {
  int left, right, Min, lazy;
  node *ch[2];
} pool[12 * 200100], *root1, *rootr, *rootl;
inline void buildtree(node *p, int left, int right) {
  p->left = left;
  p->right = right;
  p->Min = 1000000000;
  p->lazy = 1000000000;
  if (left == right) return;
  int mid = (left + right) / 2;
  node *lson = &pool[++cnt2], *rson = &pool[++cnt2];
  p->ch[0] = lson;
  p->ch[1] = rson;
  buildtree(lson, left, mid);
  buildtree(rson, mid + 1, right);
}
inline void push(node *p) {
  if (p->lazy == 1000000000) return;
  if (p->ch[0]) p->ch[0]->lazy = min(p->ch[0]->lazy, p->lazy);
  if (p->ch[1]) p->ch[1]->lazy = min(p->ch[1]->lazy, p->lazy);
  p->Min = min(p->Min, p->lazy);
  p->lazy = 1000000000;
}
inline void change(node *p, int left, int right, int s) {
  if (p->left == left && p->right == right) {
    p->lazy = min(p->lazy, s);
    return;
  }
  push(p);
  if (p->ch[0]->right >= right)
    change(p->ch[0], left, right, s);
  else if (p->ch[1]->left <= left)
    change(p->ch[1], left, right, s);
  else {
    change(p->ch[0], left, p->ch[0]->right, s);
    change(p->ch[1], p->ch[1]->left, right, s);
  }
  if (p->ch[0]) push(p->ch[0]);
  if (p->ch[1]) push(p->ch[1]);
  p->Min = min(p->ch[0]->Min, p->ch[1]->Min);
}
inline int query(node *p, int left, int right) {
  push(p);
  if (p->left == left && p->right == right) return p->Min;
  if (p->ch[0]->right >= right)
    return query(p->ch[0], left, right);
  else if (p->ch[1]->left <= left)
    return query(p->ch[1], left, right);
  else
    return min(query(p->ch[0], left, p->ch[0]->right),
               query(p->ch[1], p->ch[1]->left, right));
}
inline void gethas() {
  pp[0] = 1;
  for (int i = 1; i <= n; i++)
    has[i] = has[i - 1] * p1 + str[i], pp[i] = pp[i - 1] * p1;
}
inline int ha(int u, int v) { return has[v] - has[u - 1] * pp[v - u + 1]; }
inline bool checklcp(int u, int v, int mid) {
  if (mid == 0) return true;
  if (u - mid < 1 || v - mid < 1) return false;
  if (ha(u - mid, u - 1) == ha(v - mid, v - 1))
    return true;
  else
    return false;
}
inline bool checklcs(int u, int v, int mid) {
  if (mid == 0) return true;
  if (u + mid > n || v + mid > n) return false;
  if (ha(u + 1, u + mid) == ha(v + 1, v + mid))
    return true;
  else
    return false;
}
inline int lcp(int u, int v) {
  if (u == v) return n - u + 1;
  f1 = rk[u];
  f2 = rk[v];
  if (f1 > f2) swap(f1, f2);
  f1++;
  int cnt3 = lg[f2 - f1 + 1];
  return min(dp[f1][cnt3], dp[f2 - (1 << cnt3) + 1][cnt3]);
}
inline int ask(int u, int v) {
  int N = sqrt(n);
  for (int i = 1; i <= N && i < v - u + 1; i++)
    if (lcp(u, v - i + 1) >= i) return i;
  int Mn = n + 1;
  for (int i = max(1, rk[u] - N + 1); i <= min(n, rk[u] + N - 1); i++) {
    if (sa[i] <= u || sa[i] > v) continue;
    if (lcp(u, sa[i]) >= v - sa[i] + 1) Mn = min(Mn, v - sa[i] + 1);
  }
  return Mn;
}
inline bool check0(int u, int v) {
  flag2 = 0;
  for (int i = 0; i <= 25; i++) {
    if (sum[v][i] - sum[u - 1][i] > 1) flag2 = 1;
  }
  if (flag2 == 0)
    return true;
  else
    return false;
}
inline bool check1(int u, int v) {
  len = v - u + 1;
  len2 = v - u + 1;
  for (int i = 2; i * i <= len; i++) {
    if (len % i == 0) {
      while (len % i == 0) len /= i;
      if (lcp(u, u + len2 / i) >= len2 - len2 / i) return true;
    }
  }
  if (len > 1) {
    if (lcp(u, u + len2 / len) >= len2 - len2 / len) return true;
  }
  return false;
}
inline bool check2(int u, int v) {
  if (lastr[u] <= v) return true;
  if (lastl[v] >= u) return true;
  if (ask(u, v) * 2 <= v - u + 1) return true;
  return false;
}
inline bool check3(int u, int v) {
  int w = str[u] - 'a';
  if (sum[v][w] - sum[u][w] >= 1) return true;
  w = str[v] - 'a';
  if (sum[v - 1][w] - sum[u - 1][w] >= 1) return true;
  w = query(root1, u, v);
  if (w <= v)
    return true;
  else
    return false;
}
inline void work() {
  int u, v, Lcp, Lcs;
  rootr = &pool[++cnt2];
  rootl = &pool[++cnt2];
  root1 = &pool[++cnt2];
  buildtree(rootr, 1, n);
  buildtree(rootl, 1, n);
  buildtree(root1, 1, n);
  lg[0] = -1;
  for (int i = 1; i <= n; i++) lg[i] = lg[i >> 1] + 1;
  for (int i = 1; i <= n; i++)
    for (int j = 0; j <= 25; j++) {
      sum[i][j] = sum[i - 1][j];
      if (str[i] - 'a' == j) sum[i][j]++;
    }
  getSA();
  gethas();
  int left, right, as, mid;
  for (int Len = 1; Len <= n; Len++) {
    for (int i = 1; i + Len <= n; i += Len) {
      u = i;
      v = i + Len;
      if (str[u] != str[v]) continue;
      left = 0;
      right = Len - 1;
      Lcp = Lcs = 0;
      while (left <= right) {
        mid = (left + right) / 2;
        if (checklcp(u, v, mid) == true)
          Lcp = mid, left = mid + 1;
        else
          right = mid - 1;
      }
      left = 0;
      right = Len - 1;
      while (left <= right) {
        mid = (left + right) / 2;
        if (checklcs(u, v, mid) == true)
          Lcs = mid, left = mid + 1;
        else
          right = mid - 1;
      }
      if (Lcs + Lcp < Len - 1) continue;
      len1 = Lcs + Lcp - (Len - 1) + 1;
      change(rootr, u - Lcp, u - Lcp + len1 - 1, Len);
      change(rootl, v + Lcs - len1 + 1, v + Lcs, Len);
    }
  }
  for (int i = 1; i <= n; i++) {
    lastr[i] = i + query(rootr, i, i) * 2 - 1;
    lastl[i] = i - query(rootl, i, i) * 2 + 1;
    change(root1, i, i, lastr[i]);
  }
}
int main() {
  scanf("%d", &n);
  scanf("%s", str + 1);
  work();
  scanf("%d", &q);
  int u, v;
  for (int i = 1; i <= q; i++) {
    scanf("%d%d", &u, &v);
    if (check0(u, v) == true)
      printf("-1\n");
    else if (check1(u, v) == true)
      printf("1\n");
    else if (check2(u, v) == true)
      printf("2\n");
    else if (check3(u, v) == true)
      printf("3\n");
    else
      printf("4\n");
  }
  return 0;
}