#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;i++)
#define bFor(i,a,b) for(i=a;i>=(ll)b;i--)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N-1,0)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define endl "\n"
#define pb push_back
#define eb emplace_back
#define print(v) cout<<v<<endl
#define printyes cout<<"Yes"<<endl
#define printno cout<<"No"<<endl
#define printYES cout<<"YES"<<endl
#define printNO cout<<"NO"<<endl
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
const ll mod=1000000007;
const ll inf=1LL<<60;
const double PI = acos(-1);
const double eps = 1e-9;
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;} 
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;} 

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a) {
  ll b=mod,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+mod)%mod;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n){
  ll res=1;
  while(n){
    if(n&1)res=res*a%mod;
    a=a*a%mod;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return a;return (a%b==0)?b:gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n){
  ll ans=0;
  while(n){n/=10;ans++;}
  return ans;
}

ll sumdigits(ll n){
  ll ans=0;
  while(n){ans+=n%10;n/=10;}
  return ans;
}

struct segtree{
  ll N,E;
  using func=function<ll(ll,ll)>;
  func f;
  vec tree;
  segtree(vec& v,ll e,func F):E(e),f(F){
    ll i,K=v.size();
    N=1;
    while(N<K)N*=2;
    tree.resize(2*N-1);
    For(i,N-1,N-1+K)tree[i]=v[i-N+1];
    For(i,N+K-1,2*N-1)tree[i]=E;
    brep(i,N-1)tree[i]=f(tree[i*2+1],tree[i*2+2]);
  }
  void input(ll i,ll a){
    i+=N-1;
    tree[i]=a;
    while(i){
      i=(i-1)/2;
      tree[i]=f(tree[i*2+1],tree[i*2+2]);
    }
  }
  ll res(ll a,ll b,ll k,ll l,ll r){
    if(r<=a||b<=l)return E;
    if(a<=l&&r<=b)return tree[k];
    return f(res(a,b,2*k+1,l,(l+r)/2),res(a,b,2*k+2,(l+r)/2,r));
  }
  ll q(ll a,ll b){
    return res(a,b,0,0,N);
  }
  void prt(){
    output(tree);
  }
};
int main(){
  startupcpp();
  // ll test;cin>>test;while(test--){
  ll i,j,N,Q,ans;
  cin>>N;
  string s;cin>>s;
  cin>>Q;
  vec v(N);
  rep(i,N){
    v[i]=1LL<<(s[i]-'a');
  }
  segtree tree(v,0,[](auto l,auto r){return l|r;});
  while(Q--){
    cin>>i;
    if(i==1){
      cin>>j>>s;
      j--;
      tree.input(j,1LL<<(s[0]-'a'));
    }else{
      cin>>i>>j;
      N=tree.q(i-1,j);
      ans=0;
      while(N){
        ans+=N&1;
        N>>=1;
      }
      print(ans);
    }
  }
  return 0;
}

Measured memory_bytes: 13084