Problem: Ilya the Lion wants to help all his friends with passing exams. They need to solve the following problem to pass the IT exam.

You've got string s = s1s2... sn (n is the length of the string), consisting only of characters "." and "#" and m queries. Each query is described by a pair of integers li, ri (1 ≤ li < ri ≤ n). The answer to the query li, ri is the number of such integers i (li ≤ i < ri), that si = si + 1.

Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.

Input

The first line contains string s of length n (2 ≤ n ≤ 105). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer m (1 ≤ m ≤ 105) — the number of queries. Each of the next m lines contains the description of the corresponding query. The i-th line contains integers li, ri (1 ≤ li < ri ≤ n).

Output

Print m integers — the answers to the queries in the order in which they are given in the input.

Examples

Input

......
4
3 4
2 3
1 6
2 6


Output

1
1
5
4


Input

#..###
5
1 3
5 6
1 5
3 6
3 4


Output

1
1
2
2
0

Solution (in PYTHON):

Solution:
#!/usr/bin/env python
# -*- coding: UTF-8 -*-

import sys

def ReadIn():
    offset = 0
    data = sys.stdin.read().split()
    while offset < len(data):
        s = data[offset]
        offset += 1
        qn = int(data[offset])
        offset += 1
        queries = ((int(data[idx]), int(data[idx + 1])) for idx in xrange(offset, offset + 2 * qn, 2))
        offset += 2 * qn
        yield s, queries

def Solve(s, queries):
    es = [0]
    for i in xrange(1, len(s)):
        es.append(es[-1] + (s[i] == s[i - 1]))
    for l, r in queries:
        print es[r - 1] - es[l - 1]

if __name__ == '__main__':
    for s, queries in ReadIn():
        Solve(s, queries)