There are total $N$ cars in a sequence with $ith$ car being assigned with an alphabet equivalent to the $ith$ alphabet of string $S$ . Chef has been assigned a task to calculate the total number of cars with alphabet having a unique even value in the given range X to Y (both inclusive)
. The value of an alphabet is simply its position in alphabetical order e.g.: a=1, b=2, c=3…
The chef will be given $Q$
such tasks having varying values of $X$ and $Y$
Note: string $S$ contains only lowercase alphabets
-----Input-----
First line of input contains a string $S$ of length $N$.
Second line contains an integer denoting no. of queries $Q$.
Next q lines contain two integers denoting values of $X$ and $Y$.
-----Output-----
For each query print a single integer denoting total number of cars with alphabet having a unique even value in the given range $X$ to $Y$.
-----Constraints-----
- $1 \leq n \leq 10^5$
- $1 \leq q \leq 10^5$
-----Example Input-----
bbccdd
5
1 2
3 4
5 6
1 6
2 5
-----Example Output-----
1
0
1
2
2
-----Explanation:-----
Example case 1: 
Query 1: range 1 to 2 contains the substring $"bb"$ where each character has a value of 2. Since we will only be considering unique even values, the output will be 1

string = input()
token = {}
for i in range(98,123,2):
    token[chr(i)] = 0
l = [token.copy()]
for letter in string:
    if (ord(letter)+1)%2:
            token[letter] += 1
    l.append(token.copy())
q = int(input())
for query in range(q):
    a,b = map(int,input().split())
    if a > b:
        a,b = b,a
    ans = 0
    if a > len(string):
        a = len(string)
    if b > len(string):
        b = len(string)
    if a < 1:
        a = 1
    if b < 1:
        b = 1
    for i in range(98,123,2):
        if l[b][chr(i)] > l[a-1][chr(i)]:
            ans += 1
    print(ans)  

string = input()
token = {}
for i in range(98,123,2):
    token[chr(i)] = 0
l = [token.copy()]
for letter in string:
    if (ord(letter)+1)%2:
            token[letter] += 1
    l.append(token.copy())
q = int(input())
for query in range(q):
    a,b = map(int,input().split())
    if a > b:
        a,b = b,a
    ans = 0
    if a > len(string):
        a = len(string)
    if b > len(string):
        b = len(string)
    if a < 1:
        a = 1
    if b < 1:
        b = 1
    for i in range(98,123,2):
        if l[b][chr(i)] > l[a-1][chr(i)]:
            ans += 1
    print(ans)  