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.math.*;
import java.io.BufferedInputStream;
public class Main{
    static TreeSet[] count;
    static int[] st;
    public static void main(String[] args){
        Scanner sc = new Scanner (new BufferedInputStream(System.in));
        int n = sc.nextInt();
        String s = sc.next();
        st = new int[n];
        int times = sc.nextInt();
        count = new TreeSet[26];
        for(int i = 0; i < n; ++i) {
            int index = s.charAt(i) - 'a';
            st[i] = index; 
            if(count[index] == null) {
                count[index] = new TreeSet<Integer>();
            }
            count[index].add(i);
        }
        for(int time = 0; time < times; ++time) {
            int type = sc.nextInt();
            int index = sc.nextInt();
            int third;
            if(type == 2) {
                third = sc.nextInt();
                query(index - 1, third);
            } else {
                third = sc.next().charAt(0) - 'a';
                change(index - 1, third);
            }
        }
      }

      private static void query(int start, int end) {
          int res = 0;
          for(int i = 0; i < 26; ++i) {
              if(count[i] == null) continue;
              Integer high = (Integer) count[i].ceiling(start);
              if(high != null && high >= start && high < end) res++;
          }
          System.out.println(res);
      }

      private static void change(int index, int target) {
          int ori = st[index];
        if(ori == target) return;
          count[ori].remove(index);
          st[index] = target;
          if(count[target] == null) count[target] = new TreeSet<Integer>();
          count[target].add(index);
      }
}