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 \le l \le r \le 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} \ldots 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 \le k \le |t|$ indexes $1 \le i_1 < i_2 < \ldots < i_k = |t|$ and cuts $t$ to $k$ bands-strings $t_1 t_2 \ldots t_{i_1}, t_{i_1 + 1} \ldots t_{i_2}, \ldots, {t_{i_{k-1} + 1}} \ldots 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.

The first line contains one integer $n$ ($1 \le n \le 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 \le q \le 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 \le l_i \le r_i \le n$) denoting the ends of the $i$-th segment.

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