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

public class Solution {
	static PrintWriter out = new PrintWriter(System.out); 
	 static void flush() {
 		out.flush();
 	}
	static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            br = new BufferedReader(new
                    InputStreamReader(System.in));
        }
       
        String next() {
            while (st == null || !st.hasMoreElements()) {
                try{
                    st = new StringTokenizer(br.readLine());
                }
                catch (IOException  e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
        int nextInt() {
            return Integer.parseInt(next());
        }
        long nextLong() {
            return Long.parseLong(next());
        }
        static int fact(int n) {
   		 if(n == 1) return 1;
   		 return n * fact(n-1);
   	 }
	public int[] readIntArray(int n) {
			int[] arr = new int[n];
			for(int i=0; i<n; ++i)
				arr[i]=nextInt();
			return arr;
		}
		static int gcd(int a, int b) { 
	    if (b == 0) return a; 
	    return gcd(b, a % b);  
		}
        double nextDouble() {
            return Double.parseDouble(next());
        }
        String nextLine() {
            String str = "";
            try{
                str = br.readLine();
            }
            catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }
//	 static int solve(i[] arr, int n, int x) {
//	 }
	public static void main(String args[]) throws Exception {
        FastReader sc = new FastReader();
        
        String str = sc.nextLine();
        int count = 0;
        int sum = 0;
        int[] arr = new int[100000+2];
        for(int i = 2;i <= str.length();i++) {
    		if(str.charAt(i-2) == str.charAt(i-1)) {
    		sum += 1;
    		arr[i] = sum;
    		}
    		else {
    			arr[i] = sum;	
    		}
//    		out.print(arr[i]+" ");
    	}
//        out.println();
        int m = sc.nextInt();
        	while(m-- > 0) {
        	int l = sc.nextInt(), r = sc.nextInt();
        	out.println(Math.abs(arr[r] - arr[l]));
        }
        flush();
        
        	long end = System.currentTimeMillis();
        	NumberFormat formatter = new DecimalFormat("#0.00000");
        	//System.out.print("Execution time is " + formatter.format((end - start) / 1000d) + " seconds");
        }
}