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* = *s*<sub class="lower-index">1</sub>*s*<sub class="lower-index">2</sub>... *s*<sub class="lower-index">*n*</sub> (*n* is the length of the string), consisting only of characters "." and "#" and *m* queries. Each query is described by a pair of integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> &lt; *r*<sub class="lower-index">*i*</sub> ≤ *n*). The answer to the query *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> is the number of such integers *i* (*l*<sub class="lower-index">*i*</sub> ≤ *i* &lt; *r*<sub class="lower-index">*i*</sub>), that *s*<sub class="lower-index">*i*</sub> = *s*<sub class="lower-index">*i* + 1</sub>.

Ilya the Lion wants to help his friends but is there anyone to help him? Help Ilya, solve the problem.
The first line contains string *s* of length *n* (2 ≤ *n* ≤ 10<sup class="upper-index">5</sup>). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer *m* (1 ≤ *m* ≤ 10<sup class="upper-index">5</sup>) — the number of queries. Each of the next *m* lines contains the description of the corresponding query. The *i*-th line contains integers *l*<sub class="lower-index">*i*</sub>, *r*<sub class="lower-index">*i*</sub> (1 ≤ *l*<sub class="lower-index">*i*</sub> &lt; *r*<sub class="lower-index">*i*</sub> ≤ *n*).
def count_pref(s: str) -> list[int]:
    pref = [0] * (len(s))
    for i in range(1, len(pref)):
        pref[i] += pref[i-1]
        if s[i-1] == s[i]:
            pref[i] += 1

    return pref


def process(pref: list[int], queries: list[list[int]]) -> list[int]:
    res = []
    for query in queries:
        i, j = query
        value = pref[j-1] - pref[i-1]
        res.append(value)

    return res

if __name__ == "__main__":
    sequence = input().strip()
    n = int(input().strip())
    pref = count_pref(sequence)
    queries = []
    for _ in range(n):
        query = list(map(int, input().strip().split()))
        queries.append(query)
    ans = process(pref, queries)
    print("\n".join(map(str, ans)))
	    	 	   		  	 	  		   		   	