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.Arrays;
import java.util.Scanner;

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
 
public class Main {
	
	public static void main(String[] args) throws NumberFormatException, IOException {
		Main mainObj = new Main();
		mainObj.solve();
	}
	
	public void solve() throws NumberFormatException, IOException {
		FastScanner sc = new FastScanner();
		int n = Integer.parseInt(sc.nextLine());
		String str = sc.nextLine();
		int q = Integer.parseInt(sc.nextLine());
		
    SegmentTree segTree = new SegmentTree(str.length(), (a,b) -> a | b, 0);
    for(int i = 0; i < n; i++){
      segTree.update(i, 1<<(str.charAt(i) - 97));
    }
		
		for(int i = 0; i < q; i++) {
      String[] queryArr = sc.nextLine().split(" ");
			int queryNo = Integer.parseInt(queryArr[0]);
			if(queryNo == 1) {
				int pos = Integer.parseInt(queryArr[1]) - 1;
        char val = queryArr[2].charAt(0);
        int intVal = val - 97;
				segTree.update(pos, 1<<intVal);
			}else if(queryNo == 2){
				
				int left = Integer.parseInt(queryArr[1]) - 1;
				int right = Integer.parseInt(queryArr[2]);
				
				System.out.println(testBit(segTree.query(left, right, 0, 0, -1)));
			}
		}
	}
	
	public class SegmentTree {
    int arrSize;
    int[] tree;
    TreeFunc treeFunc;
    int notInSectionValue;
    
    public SegmentTree(int size, TreeFunc treeFunc, int notInSectionValue) {
      arrSize = 1;
      while(arrSize < size) {
        arrSize *= 2;
      }
      tree = new int[arrSize * 2 - 1];
      this.treeFunc = treeFunc;
      this.notInSectionValue = notInSectionValue;
    }
    
    public void update(int pos, int val) {
      int pointer = arrSize+pos-1;
      tree[pointer] = val;
      while(pointer > 0) {
        pointer = (pointer-1)/2;
        tree[pointer] = treeFunc.calc(tree[pointer*2+1], tree[pointer*2+2]);
      }
    }
    
    public int query(int a, int b, int k, int l, int r) {
      
      if(r < 0) {
        r =  arrSize;
      }
      
      if(r <= a || b <= l) {
        return notInSectionValue;
      }
      if(a <= l && r <= b) {
        return tree[k];
      }
      
      return treeFunc.calc(query(a, b, k * 2 + 1, l, (l+r)/2),query(a,b,k*2+2, (l+r)/2, r));
    }
  }

  @FunctionalInterface
  interface TreeFunc{
    public int calc(int left,int right); 
  }
  
	
	
	public int testBit(int bit) {
		int ans = 0;
		for(int i = 0; i < 26; i++) {
			if(((bit>>i) & 1 ) == 1) {
				ans++;
			}
		}
		return ans;
	}
 
  public class FastScanner {
	
    BufferedReader reader;
    private StringTokenizer st;
    
    public FastScanner() {
      st = null;
      reader = new BufferedReader(new InputStreamReader(System.in));
    }
  
    
    public String next() {
      if(st == null || !st.hasMoreElements()) {
        try {
          st = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          e.printStackTrace();
        }
      }
      return st.nextToken();
    }
    
    public String nextLine() {
      st = null;
      String readLine = null;
      try {
        readLine = reader.readLine();
      } catch (IOException e) {
        e.printStackTrace();
      }
      return readLine;
    }
    
    public int nextInt() {
      return Integer.parseInt(next());
    }
    
    public long nextLong() {
      return Long.parseLong(next());
    }
    
    public int[] nextIntArr(int n) {
      int[] retArr = new int[n];
      for(int i = 0; i < n; i++) {
        retArr[i] = nextInt();
      }
      return retArr;
    }
    
    public long[] nextLongArr(int n) {
      long[] retArr = new long[n];
      for(int i = 0; i < n; i++) {
        retArr[i] = nextLong();
      }
      return retArr;
    }
  }
  
}
