Alice has a string consisting of characters 'A', 'B' and 'C'. Bob can use the following transitions on any substring of our string in any order any number of times: 

  * A <image> BC
  * B <image> AC
  * C <image> AB
  * AAA <image> empty string 



Note that a substring is one or more consecutive characters. For given queries, determine whether it is possible to obtain the target string from source.

Input

The first line contains a string S (1 ≤ |S| ≤ 105). The second line contains a string T (1 ≤ |T| ≤ 105), each of these strings consists only of uppercase English letters 'A', 'B' and 'C'.

The third line contains the number of queries Q (1 ≤ Q ≤ 105).

The following Q lines describe queries. The i-th of these lines contains four space separated integers ai, bi, ci, di. These represent the i-th query: is it possible to create T[ci..di] from S[ai..bi] by applying the above transitions finite amount of times?

Here, U[x..y] is a substring of U that begins at index x (indexed from 1) and ends at index y. In particular, U[1..|U|] is the whole string U.

It is guaranteed that 1 ≤ a ≤ b ≤ |S| and 1 ≤ c ≤ d ≤ |T|.

Output

Print a string of Q characters, where the i-th character is '1' if the answer to the i-th query is positive, and '0' otherwise.

Example

Input

AABCCBAAB
ABCB
5
1 3 1 2
2 2 2 4
7 9 1 1
3 4 2 3
4 5 1 3


Output

10011

Note

In the first query we can achieve the result, for instance, by using transitions <image>.

The third query asks for changing AAB to A — but in this case we are not able to get rid of the character 'B'.
#include <bits/stdc++.h>
std::tuple<std::vector<int>, std::vector<int>> GetCountsAndLastIndices(
    const std::string& input_string) {
  std::vector<int> counts(input_string.size() + 1, 0);
  std::vector<int> last_indices(input_string.size() + 1, -1);
  for (int i = 0; i < static_cast<int>(input_string.size()); ++i) {
    counts[i + 1] = counts[i] + (input_string[i] != 'A');
    last_indices[i + 1] = last_indices[i];
    if (input_string[i] != 'A') {
      last_indices[i + 1] = i;
    }
  }
  return std::make_tuple(counts, last_indices);
}
int main() {
  std::string s;
  std::string t;
  std::cin >> s;
  std::cin >> t;
  std::vector<int> s_counts;
  std::vector<int> t_counts;
  std::vector<int> t_last_indices;
  std::vector<int> s_last_indices;
  std::tie(s_counts, s_last_indices) = GetCountsAndLastIndices(s);
  std::tie(t_counts, t_last_indices) = GetCountsAndLastIndices(t);
  int q;
  std::cin >> q;
  for (int i = 0; i < q; ++i) {
    int a, b, c, d;
    std::cin >> a >> b >> c >> d;
    --a;
    --c;
    int s_count = s_counts[b] - s_counts[a];
    int t_count = t_counts[d] - t_counts[c];
    int last_s_count = b - std::max(a, s_last_indices[b]);
    int last_t_count = d - std::max(c, t_last_indices[d]);
    if ((s_count + t_count) % 2 == 0 &&
        ((s_count == t_count && last_s_count >= last_t_count &&
          (last_s_count - last_t_count) % 3 == 0) ||
         (s_count < t_count && last_s_count >= last_t_count))) {
      std::cout << "1";
    } else {
      std::cout << "0";
    }
  }
  std::cout << std::endl;
  return 0;
}
