#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

using namespace std;

typedef long long ll;
typedef vector<int>vi;
typedef pair<int, int> ii;
typedef tree<int,null_type,less<int>, rb_tree_tag, 
    tree_order_statistics_node_update> ordered_set;

#define el '\n'
#define pb push_back
#define all(a) a.begin(), a.end()
#define sz(a) (int)a.size()
#define forn(i,n) for(int i = 0; i < n;++i)
#define pb push_back
#define db(x) cerr << #x << ' ' << x << el;

void solve(){
    int n;
    cin >> n;
    string s;
    cin >> s;
    ll p = 0, neg = 0;
    forn(i, n){
        if(s[i] == '+')++p;
        else ++neg;
    }
    int q;
    cin >> q;
    auto check = [&](ll x, ll y){
        ll xy = x - y;
        ll num = x*neg - y*p;
        if(xy == 0){
            return num == 0;
        }
        if(num % xy != 0)return false;
        ll div = num / xy;
        if(div < 0)return false;
        return div <= p + n;
    };
    forn(_, q){
        ll x, y;
        cin >> x >> y;
        if(check(x, y))cout << "YES" << el;
        else cout << "NO" << el;
    }
}

int main(){

    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    int tt = 1;
    // cin>>tt;
    while(tt--)
        solve();
    return 0;
}