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.StringTokenizer;

public class CF313 implements Closeable {
    static String filePath = "/home/bishoy/IdeaProjects/Arabic competetive programming/src/b/test";
    BufferedReader inputReader = new Helper().readInput(Helper.STD, filePath);
    PrintWriter writer = new PrintWriter(new BufferedWriter(new OutputStreamWriter(System.out)));

    public static void main(String args[]) throws Exception {

        CF313 x = new CF313();
        int t = 1;
        while (t-- > 0) {
            x.solve2();
        }
        x.close();
    }


    public void solve2() throws IOException {
        char[] str = next().toCharArray();
        int q = nextInt();
        int MAX = (int) 1e5 + 1;
        int mem[] = new int[str.length + 1];

        for (int i = 1; i < str.length; i++) {
            if (str[i] == str[i - 1]) {
                mem[i] = mem[i - 1] + 1;
            } else
                mem[i] = mem[i - 1];
        }
        while (q-- > 0) {
            int l = nextInt();
            int r = nextInt();

            writer.println(mem[r - 1] - mem[l - 1]);

        }
    }

    StringTokenizer stringTokenizer;

    String next() throws IOException {
        while (stringTokenizer == null || !stringTokenizer.hasMoreTokens()) {
            stringTokenizer = new StringTokenizer(inputReader.readLine());
        }
        return stringTokenizer.nextToken();
    }

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

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

    int[] nextIntArr(int n) throws IOException {
        int arr[] = new int[n];
        for (int i = 0; i < n; i++) {
            arr[i] = nextInt();
        }
        return arr;
    }

    long[] nextLongArr(int n) throws IOException {
        long arr[] = new long[n];
        for (int i = 0; i < n; i++) {
            arr[i] = nextLong();
        }
        return arr;
    }

    @Override
    public void close() throws IOException {
        inputReader.close();
        writer.close();
    }


    static class Helper {
        BufferedReader inputReader = null;
        PrintWriter out = null;
        public static final int FILE = 0;
        public static final int STD = 1;

        public static class Pair<K, V> {
            public K key;
            public V value;

            public Pair(K key, V value) {
                this.key = key;
                this.value = value;
            }


            @Override
            public String toString() {
                return "( " + key + " , " + value + ")";
            }
        }


        public BufferedReader readInput(int type, String filePath) {
            if (type == FILE) {
                try {
                    inputReader = new BufferedReader(
                            new InputStreamReader(new FileInputStream(filePath)));
                } catch (FileNotFoundException e) {
                    e.printStackTrace();
                }
            } else
                inputReader = new BufferedReader(new InputStreamReader(System.in));


            return inputReader;
        }

    }
}