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 CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  string s;
  int q, k = 1, sum = 0, len, i, l, r, c = 0, f = 0;
  cin >> s;
  len = s.size();
  int a[len + 10], b[len + 10];
  for (i = 0; i < len - 1; i++) {
    if (s[i] == s[i + 1]) {
      a[k] = 1;
      k++;
    } else {
      a[k] = 0;
      k++;
    }
  }
  b[1] = a[1];
  for (i = 2; i < k; i++) {
    b[i] = b[i - 1] + a[i];
  }
  for (i = 0; i < len - 1; i++) {
    if (s[i] == s[i + 1])
      c++;
    else
      break;
  }
  if (c == len - 1) f = 1;
  cin >> q;
  while (q--) {
    cin >> l >> r;
    if (f == 1) {
      cout << abs(l - r) << endl;
    } else {
      r = r - 1;
      if (l == r)
        cout << a[l] << endl;
      else if (l != 1) {
        sum = b[r] - b[l - 1];
        cout << sum << endl;
      } else {
        cout << b[r] << endl;
      }
    }
  }
  return 0;
}