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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class ar {

    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 (final IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (final IOException e) {
                e.printStackTrace();
            }
            return str;
        }
    }

    static boolean[] seen;
    static Map<Integer, Integer> map;
    static Map<Long,Long> lmap;
    static Set<Character> charset;
    static Set<Integer> set;
    static int[] arr;
    static int[][] dp;
    static int rem = (int) 1e9 + 7;
    static List<List<Integer>> graph;
    static int[][] kmv = { { 2, 1 }, { 1, 2 }, { 2, -1 }, { -1, 2 }, { -2, 1 }, { 1, -2 }, { -1, -2 }, { -2, -1 } };
    static char[] car;
    static boolean[] primes;
    static int MAX = (int) 1e4 + 1;
    static double[] dar;
    static long[] lar;

    static void Sieve() {
        primes = new boolean[MAX];
        primes[0] = true;
        primes[1] = true;
        for (int i = 2; i * i < MAX; i++) {
            if (!primes[i]) {
                for (int j = i * i; j < MAX; j += i) {
                    primes[j] = true;
                }
            }
        }
    }

    public static void main(String[] args) throws java.lang.Exception {
        FastReader scn = new FastReader();
      car=scn.next().toCharArray();
      int len=car.length;
      arr=new int[len];

      for(int i=0;i<len-1;i++){
         if(car[i]==car[i+1]){
             if(i==0)arr[i]=1;
             else arr[i]+=1+arr[i-1];
         }else{
             if(i==0)arr[i]=0;
             else arr[i]=arr[i-1];
         }
      }
      
       int m=scn.nextInt();
       for(int i=0;i<m;i++){
         int l=scn.nextInt()-1; 
         int r=scn.nextInt()-1;
         int ans=arr[r-1]-((l==0)?0:arr[l-1]);
         System.out.print(ans+"\n");
       
    }     
        return;
    }
}