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
import java.util.*;
import java.util.function.*;

public class Main{
	public static void main(String[] $){
		Scanner s=new Scanner(System.in);
		int n=s.nextInt();

		SegmentTree<BitSet> seg=new SegmentTree<>(n,
				new BitSet(0),
				(a,b)->{
					BitSet o=(BitSet)a.clone();
					o.or(b);
					return o;
				});

		BitSet[] cache=new BitSet[26];
		for(int i=0;i<26;++i){
			cache[i]=new BitSet(i+1);
			cache[i].set(i);
		}

		{
			String t=s.next();
			for(int i=0;i<n;++i)
				seg.build_set(i,cache[t.charAt(i)-'a']);
			seg.build();
		}

		for(int q=s.nextInt();q>0;--q){
			if(s.nextInt()==1){
				seg.apply(s.nextInt()-1,cache[s.next().charAt(0)-'a']);
			}else{
				System.out.println(seg.query(s.nextInt()-1,s.nextInt()).cardinality());
			}
		}
	}
}

/**
 * @see http://codeforces.com/blog/entry/18051
 */
class SegmentTree<T>{
	T initv,array[];
	int size;

	/**
	 * a+0=a<br>
	 * a+(b+c)=(a+b)+c
	 */
	BinaryOperator<T> merger;

	SegmentTree(int size,T initvalue,BinaryOperator<T> merger){
		this.size=size;
		this.initv=initvalue;
		this.merger=merger;
		initArray();
	}
	@SuppressWarnings("unchecked")
	private void initArray(){
		array=(T[])new Object[size*2];
		Arrays.fill(array,initv);
	}

	void build_set(int i,T v){
		array[i+size]=v;
	}
	void build(){
		for(int i=size-1;i>0;--i)
			array[i]=merger.apply(array[i<<1],array[i<<1|1]);
	}

	void apply(int p,T value){
		for(array[p+=size]=value;p>1;p>>=1)
			array[p>>1]=merger.apply(array[p],array[p^1]);
	}
	/**
	 * [l, r)
	 */
	T query(int l,int r){
		T res=initv;
		for(l+=size,r+=size;l<r;l>>=1,r>>=1){
			if((l&1)>0) res=merger.apply(res,array[l++]);
			if((r&1)>0) res=merger.apply(res,array[--r]);
		}
		return res;
	}
}
