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.io.*;import java.math.*;
public class Main{
	//Don't have to see. start------------------------------------------
	static class InputIterator{
		ArrayList<String> inputLine = new ArrayList<String>(1024);
		int index = 0; int max;
		InputIterator(){
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			while(true){
				String read;
				try{
					read = br.readLine();
				}catch(IOException e){
					read = null;
				}
				if(read != null){
					inputLine.add(read);
				}else{
					break;
				}
			}
			max = inputLine.size();
		}
		boolean hasNext(){return (index < max);}
		String next(){
			if(hasNext()){
				String returnStr = inputLine.get(index);
				index++;
				return returnStr;
			}else{
				throw new IndexOutOfBoundsException("There is no more input");
			}
		}
	}
  
	static InputIterator ii = new InputIterator();//This class cannot be used in reactive problem.
	static PrintWriter out = new PrintWriter(System.out);
	static void flush(){out.flush();}
	static void myout(Object t){out.println(t);}
	static void myerr(Object t){System.err.print("debug:");System.err.println(t);}
	static String next(){return ii.next();}
	static int nextInt(){return Integer.parseInt(next());}
	static long nextLong(){return Long.parseLong(next());}
	static ArrayList<String> nextStrArray(){return myHanSpSplit(next());}
	static ArrayList<String> myHanSpSplit(String str){return new ArrayList<String>(Arrays.asList(str.split(" ")));}
	static ArrayList<String> nextCharArray(){return mySingleSplit(next());}
	static ArrayList<String> mySingleSplit(String str){return new ArrayList<String>(Arrays.asList(str.split("")));}
	static ArrayList<Integer> nextIntArray(){
		ArrayList<Integer> ret = new ArrayList<Integer>();
		ArrayList<String> input = nextStrArray();
		for(int i = 0; i < input.size(); i++){
			ret.add(Integer.parseInt(input.get(i)));
		}
		return ret;
	}
	static ArrayList<Long> nextLongArray(){
		ArrayList<Long> ret = new ArrayList<Long>();
		ArrayList<String> input = nextStrArray();
		for(int i = 0; i < input.size(); i++){
			ret.add(Long.parseLong(input.get(i)));
		}
		return ret;
	}
	static String kaigyoToStr(String[] list){return String.join("\n",list);}
	static String kaigyoToStr(ArrayList<String> list){return String.join("\n",list);}
	static String hanSpToStr(String[] list){return String.join(" ",list);}
	static String hanSpToStr(ArrayList<String> list){return String.join(" ",list);}
	public static void main(String[] args){
		Runtime rt = Runtime.getRuntime();
		long mae = System.currentTimeMillis();
		solve();
		flush();
		long ato = System.currentTimeMillis();
		myerr("time : " + (ato - mae) + "ms");
		myerr("memory : " + ((rt.totalMemory() - rt.freeMemory()) / 1024) + "KB");
	}
	//Don't have to see. end------------------------------------------
	static void solve(){//Here is the main function
		int N = nextInt();
		ArrayList<String> list = nextCharArray();
		HashMap<String, TreeSet<Integer>> map = new HashMap<String, TreeSet<Integer>>(1000);
		ArrayList<String> alpha = mySingleSplit("abcdefghijklmnopqrstuvwxyz");
		for(int i = 0; i < alpha.size(); i++){
			map.put(alpha.get(i), new TreeSet());
		}
		for(int i = 0; i < N; i++){
			TreeSet<Integer> tmp = map.get(list.get(i));
			tmp.add(i + 1);
			map.put(list.get(i), tmp);
		}
		int Q = nextInt();
		for(int i = 0; i < Q; i++){
			ArrayList<String> tmp = nextStrArray();
			if(tmp.get(0).equals("1")){
				int changeIndex = Integer.parseInt(tmp.get(1));
				for(int j = 0; j < alpha.size(); j++){
					TreeSet set = map.get(alpha.get(j));
					if(set.contains(changeIndex)){
						set.remove(changeIndex);
						map.put(alpha.get(j), set);
						break;
					}
				}
				TreeSet set = map.get(tmp.get(2));
				set.add(changeIndex);
				map.put(tmp.get(2), set);
			}else{
				int L = Integer.parseInt(tmp.get(1));
				int R = Integer.parseInt(tmp.get(2));
				int count = 0;
				for(int j = 0; j < alpha.size(); j++){
					TreeSet set = map.get(alpha.get(j));
					Object high = set.floor(R);
					Object low = set.ceiling(L);
					if(low != null && high != null){
						if((int)low <= (int)high){
							count++;
						}
					}
				}
				myout(count);
			}
		}
	}
	//Method addition frame start

	//Method addition frame end
}