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:
//package Other;


import java.util.*;
import java.lang.*;
import java.io.*;

/*
 * 
 * Comments Here
 * 
 */
public class P_313B
{
	static BufferedReader br; 
	static BufferedWriter bw; 
	static StringTokenizer st;
	
	public static void main(String[] args) throws java.lang.Exception
	{
		br = new BufferedReader(new InputStreamReader(System.in));
		bw = new BufferedWriter(new OutputStreamWriter(System.out));
		
    	//Uncomment to read from file
    	/*
    	File file = new File("src/in.txt");
		try {
			in = new Scanner(file);
		} catch (FileNotFoundException e) {
			e.printStackTrace();
		}
		/**/

		String symbols = br.readLine();
		int total = 0;
		int[] cumCount = new int[symbols.length()];
		
		char prevChar = '!';
		for(int i = 0; i < symbols.length(); ++i) {
			char nextChar = symbols.charAt(i);
			if(prevChar == nextChar) {
				total++;
				cumCount[i] = total;
			}
			cumCount[i] = total;
			prevChar = nextChar;
		}
		int queries = Integer.parseInt(br.readLine());
		
		for(int i = 0; i < queries; ++i) {
			st = new StringTokenizer(br.readLine());
			int l = Integer.parseInt(st.nextToken())-1;
			int r = Integer.parseInt(st.nextToken())-1;
			bw.write(""+(cumCount[r]-cumCount[l])+"\n");
		}

		
		bw.close();
		br.close();
		
	}
	

	
	
}