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₁s₂... s_n (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_i,r_i (1≤l_i<r_i≤n). The answer to the query l_i,r_i is the number of such integers i (l_i≤i<r_i), that s_i=s_i+1.

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⁵). It is guaranteed that the given string only consists of characters "." and "#".

The next line contains integer m (1≤m≤10⁵) − the number of queries. Each of the next m lines contains the description of the corresponding query. The i-th line contains integers l_i,r_i (1≤l_i<r_i≤n).

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