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:
a = raw_input()
#check at each point.
n = len(a)
each = [0]*n 
for i in range(n-1): # last one will be default zero
	if a[i] == a[i+1]:
		each[i] = 1
	else:
		each[i] = 0

Sum = [0]*n
Sum[0] = each[0]
for i in range(1, n):
	Sum[i] = Sum[i-1] + each[i] # adding previous and at that point itself

# to calulate in range
#print each
#print Sum

for _ in xrange(int(raw_input())):
	a, b = map(int, raw_input().split()) # index + 1 
	if a == 1:
		print Sum[b-2]
	else:
		print Sum[b-2] - Sum[a-2]