#include <bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define countof(array) (sizeof(array) / sizeof(array[0]))
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define rrep(i,n) for(int i = (n)-1; i >= 0; --i)
#define rep2(i,n) for(int i = 1; i <= (n); ++i)
#define rrep2(i,n) for(int i = (n); i > 0; --i)
#define srep(i,s,n) for(int i = s; i < (n); ++i)
#define rsrep(i,s,n) for(int i = (n)-1; i >= s; --i)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define aall(a) (a), (a)+countof(a)//for array sorting
#define raall(a) (a), (a)+countof(a), greater<>()
#define show(x) cout<<#x<<" = "<<(x)<<endl;
#define vfind(v, a) find(all(v), a) != v.end()
#define yn(f) { if (f) puts("YES"); else puts("NO"); }
#define yns(f) { if (f) puts("Yes"); else puts("No"); }
#define show_ary(...) { cout<<#__VA_ARGS__<<" = "; for (const auto& x : (__VA_ARGS__)) { cout<<x<<" "; } cout<<endl; }
#define show_pair(...) cout<<#__VA_ARGS__<<" = "<<endl; for (const auto& x : (__VA_ARGS__)) { cout<<"  "<<x.fi<<" : "<<x.se<<endl; }
#define out_ary(...) { int n = (__VA_ARGS__).size(); rep(i, n) printf("%d%s", (__VA_ARGS__)[i], i != n-1 ? " " : "\n"); }
#define argmax(v) distance((v).begin(), max_element(all(v)))
#define argmin(v) distance((v).begin(), min_element(all(v)))
#define vmax(v) *max_element(all(v))
#define vmin(v) *min_element(all(v))
typedef long long int ll;
typedef pair<int, int> P;
typedef vector<P> vpair;
typedef vector<int> vint;
typedef vector<ll> vll;
typedef vector<double> vdouble;
typedef vector<string> vstr;
typedef vector<bool> vbool;
typedef vector<vint> vvint;
typedef vector<vll> vvll;
typedef vector<vstr> vvstr;
typedef vector<vbool> vvbool;
const ll LINF = 2000000000000000000ll;
const int INF = 1000000100;
const ll MOD = 1e9+7;

vll base(32);

struct SegmentTree {
    int n;
    vector<int> node;
    SegmentTree(string s) {
        int sz = s.length();
        n = 1; while(n < sz) n *= 2;
        node.resize(2*n-1, 0);
        for(int i=0; i<sz; i++) {
            node[i+n-1] = base[s[i]-'a'];
        }
        for(int i=n-2; i>=0; i--) node[i] = (node[2*i+1] | node[2*i+2]);
    }

    void update(int k, char val) {
        k += (n - 1);
        node[k] = base[val-'a'];
        while(k > 0) {
            k = (k - 1) / 2;
            node[k] = (node[2*k+1] | node[2*k+2]);
        }
    }

    int query(int a, int b, int k=0, int l=0, int r=-1) {
        if(r < 0) r = n;
        if(r <= a || b <= l) return 0;
        if(a <= l && r <= b) return node[k];
        int vl = query(a, b, 2*k+1, l, (l+r)/2);
        int vr = query(a, b, 2*k+2, (l+r)/2, r);
        return (vl | vr);
    }
};

void show_bit(ll n) {
    vint res(32, 0);
    rrep(i, 32) {
        if (n >= base[i]) {
            res[i] = 1;
            n -= base[i];
        }
    }
    out_ary(res);
}

int main() {
    int n;
    string s;
    int q;
    cin >> n >> s >> q;

    base[0] = 1;
    srep(i, 1, 32) base[i] = base[i-1]*2;

    SegmentTree st(s);

    rep(qi, q) {
        int a;
        cin >> a;
        if (a == 1) {
            int i;
            char c;
            cin >> i >> c;
            --i;
            st.update(i, c);
        }
        else {
            int l, r;
            cin >> l >> r;
            --l;
            ll res = st.query(l, r);
            int ans = 0;
            while (res) {
                if (res & 1) ans++;
                res >>= 1;
            }
            cout << ans << endl;
        }
    }
    
    return 0;
}

Measured memory_bytes: 5508