#include<bits/stdc++.h>
using namespace std;
using ll=long long;
constexpr int CHAR_NUM=26;

struct S{
  array<ll,CHAR_NUM>MM,MA,A;
  ll MMA;
  void print(){
    cout<<MMA<<'/';
    for(int i=0;i<26;i++){
      cout<<A[i]<<',';
    }cout<<'/';
    for(int i=0;i<26;i++){
      cout<<MA[i]<<',';
    }cout<<'/';
    for(int i=0;i<26;i++){
      cout<<MM[i]<<',';
    }cout<<'\n';
  }
};
S seg_e(){
  S ret;
  for(int i=0;i<CHAR_NUM;i++){
    ret.MM[i]=0;
    ret.MA[i]=0;
    ret.A[i]=0;
  }
  ret.MMA=0;
  return ret;
}
S seg_op(S a,S b){
  S ret=seg_e();
  ret.MMA=a.MMA+b.MMA;
  for(int i=0;i<CHAR_NUM;i++){
    ret.A[i]+=a.A[i]+b.A[i];
    ret.MA[i]+=a.MA[i]+b.MA[i];
    ret.MM[i]+=a.MM[i]+b.MM[i];
  }
  ll aMM_s=accumulate(a.MM.begin(),a.MM.end(),0ll),
  aMA_s=accumulate(a.MA.begin(),a.MA.end(),0ll),
  aA_s=accumulate(a.A.begin(),a.A.end(),0ll);
  ll bMM_s=accumulate(b.MM.begin(),b.MM.end(),0ll),
  bMA_s=accumulate(b.MA.begin(),b.MA.end(),0ll),
  bA_s=accumulate(b.A.begin(),b.A.end(),0ll);
  for(int i=0;i<CHAR_NUM;i++){
    ret.MMA+=a.A[i]*b.MA[i];
    ret.MMA+=a.MM[i]*(bA_s-b.A[i]);
    ret.MM[i]+=a.A[i]*b.A[i];
    ret.MA[i]+=a.A[i]*(bA_s-b.A[i]);
  }
  return ret;
}

namespace Lib {
template <class S, auto op, auto e>
struct segtree {
  int size, _n;
  vector<S> seg;
  segtree(int n) {
    _n = n;
    size = 1;
    while (size < n) size <<= 1;
    seg = vector<S>(size * 2, e());
  }
  void set(int p, S val) {
    p += size;
    seg[p] = val;
    while (p /= 2) {
      seg[p] = op(seg[p * 2], seg[p * 2 + 1]);
    }
  }
  S prod(int l, int r) {
    S retL = e(), retR = e();
    for (l += size, r += size; l < r; l /= 2, r /= 2) {
      if (l % 2) retL = op(retL, seg[l++]);
      if (r % 2) retR = op(seg[--r], retR);
    }
    return op(retL, retR);
  }
  S get(int p) { return seg[p + size]; }
  template <class F>
  int max_right(int L, F f) {
    L += size;
    S sm = e();
    do {
      while (L % 2 == 0) L /= 2;
      if (!f(op(sm, seg[L]))) {
        while (L < size) {
          L *= 2;
          if (f(op(sm, seg[L]))) {
            sm = op(sm, seg[L]);
            L++;
          }
        }
        return L - size;
      }
      sm = op(sm, seg[L]);
      L++;
    } while ((L & -L) != L);
    return _n;
  }

  template <class F>
  int min_left(int R, F f) {
    R += size;
    S sm = e();
    do {
      R--;
      while (R > 1 && R % 2 == 1) R /= 2;
      if (!f(op(seg[R], sm))) {
        while (R < size) {
          R = R * 2 + 1;
          if (f(op(seg[R], sm))) {
            sm = op(seg[R], sm);
            R--;
          }
        }
        return R + 1 - size;
      }
      sm = op(seg[R], sm);
    } while ((R & -R) != R);
    return 0;
  }
};
}  // namespace Lib
int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  int N;
  cin>>N;
  string T;
  cin>>T;
  Lib::segtree<S,seg_op,seg_e> seg(N);
  for(int i=0;i<N;i++){
    S t=seg_e();
    t.A[T[i]-'A']=1;
    seg.set(i,t);
  }
  int Q;
  cin>>Q;
  while(Q--){
    int a;;
    cin>>a;
    if(a==1){
      int x;
      char c;
      cin>>x>>c;
      --x;
      S t=seg_e();
      t.A[c-'A']=1;
      seg.set(x,t);
    }else if(a==2){
      int l,r;
      cin>>l>>r;
      --l;
      cout<<seg.prod(l,r).MMA<<'\n';
      // seg.prod(l,r).print();
    }
  }
}