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.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.List;
import java.util.Scanner;
import java.util.Set;
import java.util.TreeSet;
import java.util.ArrayList;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        Scanner in = new Scanner(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        SimpleStringQueries solver = new SimpleStringQueries();
        solver.solve(1, in, out);
        out.close();
    }

    static class SimpleStringQueries {
        public void solve(int testNumber, Scanner in, PrintWriter out) {
            int n = in.nextInt();
            char[] s = in.next().toCharArray();
            List<TreeSet<Integer>> list = new ArrayList<>();
            for (int i = 0; i < 26; i++) {
                list.add(new TreeSet<>());
            }

            for (int i = 0; i < s.length; i++) {
                TreeSet<Integer> set = list.get(s[i] - 'a');
                set.add(i);
            }
            int q = in.nextInt();
            for (int j = 0; j < q; j++) {

                int num = Integer.parseInt(in.next());
                if (num == 1) {
                    int i = Integer.parseInt(in.next()) - 1;
                    char c = in.next().charAt(0);
                    Set<Integer> fromTarget = list.get(s[i] - 'a');
                    fromTarget.remove(i);

                    Set<Integer> toTarget = list.get(c - 'a');
                    toTarget.add(i);

                    s[i] = c;
                } else {
                    int l = Integer.parseInt(in.next()) - 1;
                    int r = Integer.parseInt(in.next());
                    long result = 0;
                    for (int i = 0; i < 26; i++) {
                        TreeSet<Integer> set = list.get(i);
                        if (set.isEmpty()) {
                            continue;
                        }
                        int lpos = set.ceiling(l) == null ? Integer.MAX_VALUE : set.ceiling(l);
                        int rpos = set.ceiling(r) == null ? Integer.MAX_VALUE : set.ceiling(r);
                        if (lpos < rpos) {
                            result++;
                        }
                    }
                    out.println(result);
                }
            }
        }

    }
}

