You are given a string S of length N consisting of lowercase English letters.

Process Q queries of the following two types:

* Type 1: change the i_q-th character of S to c_q. (Do nothing if the i_q-th character is already c_q.)
* Type 2: answer the number of different characters occurring in the substring of S between the l_q-th and r_q-th characters (inclusive).

Constraints

* N, Q, i_q, l_q, and r_q are integers.
* S is a string consisting of lowercase English letters.
* c_q is a lowercase English letter.
* 1 \leq N \leq 500000
* 1 \leq Q \leq 20000
* |S| = N
* 1 \leq i_q \leq N
* 1 \leq l_q \leq r_q \leq N
* There is at least one query of type 2 in each testcase.

Input

Input is given from Standard Input in the following format:


N
S
Q
Query_1
\vdots
Query_Q


Here, Query_i in the 4-th through (Q+3)-th lines is one of the following:


1 i_q c_q



2 l_q r_q


Output

For each query of type 2, print a line containing the answer.

Example

Input

7
abcdbbd
6
2 3 6
1 5 z
2 1 1
1 4 a
1 7 d
2 1 7


Output

3
1
5
#include<bits/stdc++.h>
using namespace std;

int N,Q;
string S;
bool tree[1<<20][26];

void update(int x,int c,bool b){
	x+=1<<19;
	tree[x][c]=b;
	while(x){
		x/=2;
		tree[x][c]=(tree[x+x][c]|tree[x+x+1][c]);
	}
}

bool calc(int l,int r,int c){
	l+=1<<19;
	r+=1<<19;
	while(l<=r){
		if(tree[l][c]|tree[r][c])return true;
		l=(l+1)/2;
		r=(r-1)/2;
	}
	return false;
}

int main(){
	cin>>N>>S>>Q;
	for(int i=0;i<N;i++){
		update(i,S[i]-'a',true);
	}
	for(int i=0;i<Q;i++){
		int t;
		cin>>t;
		if(t==1){
			int i;
			char c;
			cin>>i>>c;
			i--;
			update(i,S[i]-'a',false);
			S[i]=c;
			update(i,S[i]-'a',true);
		}
		else{
			int l,r;
			cin>>l>>r;
			l--;
			r--;
			int cnt=0;
			for(int i=0;i<26;i++){
				cnt+=calc(l,r,i);
			}
			cout<<cnt<<endl;
		}
	}
}
