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.io.*;
import java.util.*;
import java.math.*;

public class Konoha {
    
    public static void main(String[] args) throws Exception {
	//try{
	    BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        OutputStream outputStream = System.out;
    	PrintWriter out = new PrintWriter(outputStream);

        int i, j;

        String str = br.readLine();
        int[] dp = new int[str.length()+1];
        
        int n = Integer.parseInt(br.readLine());
        
        int hash=0, dot=0, sum=0;
        for(i=0;i<str.length();i++){
            if(str.charAt(i)=='#')
                {
                    hash++;
                    dot=0;
                    if(hash>1 || dot>1)
                    {
                        sum++;
                        dp[i+1]=sum;
                    }
                    else
                        dp[i+1]=sum;
                }
            else
                {
                    hash=0;
                    dot++;
                    if(hash>1 || dot>1)
                    {
                        sum++;
                        dp[i+1]=sum;
                    }
                    else
                        dp[i+1]=sum;
                }
                //out.print(dp[i+1]);
        }
        StringTokenizer st;
        
        for(i=0;i<n;i++)
        {
            st = new StringTokenizer(br.readLine());
            int u = Integer.parseInt(st.nextToken());
            int v = Integer.parseInt(st.nextToken());
            out.println(dp[v]-dp[u]);
        }
	out.flush();
	out.close();
	//}catch(Exception e){}
	}
}