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.BufferedReader;
import java.io.FileReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintStream;
import java.io.StreamTokenizer;
//You can include standard Java language libraries that you want use.//

import java.util.*;

public class Task{

/*      public static StreamTokenizer in;
        public static PrintStream out;

        public static String readString() throws IOException {
            in.nextToken();
            return  in.sval;
            }

        public static double readDouble() throws IOException {
            in.nextToken();
            return in.nval;
            }

        public static int readInt() throws IOException {
            in.nextToken();
            return (int) in.nval;
        }*/

    
    int nod(int a, int b){
        int ada=Math.max(a,b);
        int adb=Math.min(a,b);
        
        while (ada%adb!=0){
            int curada=ada;
            ada=adb;
            adb=curada%adb;
        }
        return adb;
    }
    
     public void solution(String inputFilePath, String usrOutputFilePath ) throws IOException{       
     Scanner in = new Scanner(System.in);
                 

         
        String s=in.nextLine();
        int a[] = new int[s.length()];
        
        int n=in.nextInt();

        for (int i = 1; i < s.length(); i++) {
            a[i]=a[i-1]+((s.charAt(i-1)==s.charAt(i))?1:0);         
        }       
        
        for (int i = 0; i < n; i++) {
            int l=in.nextInt();
            int r=in.nextInt();
            System.out.print((a[r-1]-a[l-1])+"\n");
        }
        
        in.close();
            
            
             return;
             
    }

    public static void main(String[] args) throws IOException {
        Task test = new Task();
        test.solution("in.txt", "out.txt");

    }
     
}