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 JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main {
	public static void main (String[] args) throws IOException {
		BufferedReader reader = new BufferedReader (new InputStreamReader(System.in));
		String temp = reader.readLine();
		int[] count = new int[temp.length()];
		int counter = 0;
		for (int ii = 0; ii < temp.length() - 1; ii++) {
			if(temp.charAt(ii) == temp.charAt(ii + 1)) {
				counter++;
			}
			count[ii] = counter;
			if(ii == temp.length() - 2) {
				count[ii + 1] = counter;
			}
		}
		int m = Integer.parseInt(reader.readLine());
		for (int ii = 0; ii < m; ii++) {
			String[] split = reader.readLine().split(" ");
			int l = Integer.parseInt(split[0]);
			int r = Integer.parseInt(split[1]);
			if (l > 1) {
				System.out.println(count[r-2] - count[l-2]);
			} else {
				System.out.println(count[r-2]);
			}
		}
	}
}