#include <iostream>
#include <vector>
using namespace std;
using ull = unsigned long long;

int n, q, x, y, l;
string a, b;
vector <ull> pwr(4e5, 1);
vector <ull> h(4e5, 0);

ull hsh(int L, int R) {
    L--;
    ull ret = h[R];
    if (L > -1) ret -= h[L] * pwr[R - L];
    return ret;
}

bool check(int M) {
    return hsh(x, x + M - 1) == hsh(y, y + M - 1);
}

void solve() {
    cin >> x >> y >> l;
    y += n;
    int L = 0, R = l + 1, M;
    while (R - L > 1) {
        M = (L + R) / 2;
        check(M) ? L = M : R = M;
    }
    cout << (R > l || a[x + R - 1] == '0' ? "1 " : "0 ");
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n >> a >> b >> q;
    for (char c : b) a.push_back('1' - (c - '0'));

    for (int i = 1; i < 2 * n; i++) pwr[i] = pwr[i - 1] * 3;
    h[0] = a[0] - '0' + 1;
    for (int i = 1; i < 2 * n; i++) h[i] = h[i - 1] * 3 + (a[i] - '0' + 1);

    while (q--) solve();
}