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.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

import java.util.*;

class Main {

    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);

        int N = in.nextInt();
        String S = in.next();
        char[] cc = S.toCharArray();
        int Q = in.nextInt();
        ArrayList<TreeSet<Integer>> list = new ArrayList<TreeSet<Integer>>();
        for (int i=0;i<26;i++) {
            TreeSet<Integer> add = new TreeSet<Integer>();
            list.add(add);
        }
        for (int i=0;i<N;i++) {
            list.get((int)cc[i]-97).add(i);
        }
        // System.out.println(list);
        for (int q=0;q<Q;q++) {
            int num = in.nextInt();
            if (num==1) {
                int i = in.nextInt()-1;
                char c = in.next().charAt(0);
                list.get((int)cc[i]-97).remove(i);
                list.get((int)c-97).add(i);
                cc[i] = c;
            } else { // num==2
                int l = in.nextInt()-1;
                int r = in.nextInt()-1;
                int ans = 0;
                for (int i=0;i<26;i++) {
                    if (list.get(i).higher(l-1)!=null && list.get(i).lower(r+1)!=null) {
                        int low = list.get(i).higher(l-1);
                        int high = list.get(i).lower(r+1);
                        // out.println("char, low, high: "+(char)(i+97)+" "+low+" "+high);
                        // if (low==high) ans++;
                        if (l<=low && l<=high && low<=r && high<=r) ans++;
                    }
                }
                out.println(ans);
            }
        }
        // out.println(list);

        out.close();
    }

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine());
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int nextInt() {
            return Integer.parseInt(next());
        }

        public long nextLong() {
            return Long.parseLong(next());
        }

    }
}
