Problem:
Score : 500 points

Problem Statement

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.

Sample Input 1

7
abcdbbd
6
2 3 6
1 5 z
2 1 1
1 4 a
1 7 d
2 1 7

Sample Output 1

3
1
5

In the first query, cdbb contains three kinds of letters: b , c , and d, so we print 3.

In the second query, S is modified to abcdzbd.

In the third query, a contains one kind of letter: a, so we print 1.

In the fourth query, S is modified to abcazbd.

In the fifth query, S does not change and is still abcazbd.

In the sixth query, abcazbd contains five kinds of letters: a, b, c, d, and z, so we print 5.

Solution in Java8 (OpenJDK 1.8.0) (judge verdict: Time Limit Exceeded)

import java.util.*;
import java.util.stream.Collectors;
import java.io.*;
import java.nio.charset.StandardCharsets;

public class Main {
	int N;
	char[] S;
	int Q;
	Query[] queries;
	Map<Character, Set<Integer>> map;

	static class Query {
		int type;
		int i, l, r;
		char c;

		Query(String line) {
			String[] tokens = line.split(" ");
			type = Integer.parseInt(tokens[0]);
			if (type == 1) {
				i = Integer.parseInt(tokens[1]) - 1;
				c = tokens[2].charAt(0);
			} else {
				l = Integer.parseInt(tokens[1]) - 1;
				r = Integer.parseInt(tokens[2]) - 1;
			}
		}
	}

	public static void main(String[] args) throws IOException {
		InputStreamReader reader = new InputStreamReader(System.in, StandardCharsets.UTF_8);
		BufferedReader in = new BufferedReader(reader);
		Main ins = new Main(in);
		ins.calc();
		ins.showResult();
	}

	Main(BufferedReader in) throws IOException {
		N = Integer.parseInt(in.readLine());
		S = in.readLine().toCharArray();
		Q = Integer.parseInt(in.readLine());
		queries = new Query[Q];
		for (int i = 0; i < Q; ++i) {
			queries[i] = new Query(in.readLine());
		}
		this.map = new HashMap<>();
		for (int i = 0; i < N; ++i) {
			Character c = S[i];
			if (!map.containsKey(c)) {
				map.put(c, new HashSet<>());
			}
			map.get(c).add(i);
		}
	}

	int eval(Query query) {
		if (query.type == 1) {
			// replaceする
			char old = S[query.i];
			S[query.i] = query.c;
			map.get(old).remove(query.i);
			if(!map.containsKey(query.c)) {
				map.put(query.c, new HashSet<>());
			}
			map.get(query.c).add(query.i);
			return -1;
		} else {
			// countする
			int count = 0;
			for (Set<Integer> set : map.values()) {
				long num = set.stream().filter(x -> x >= query.l && x <= query.r).count();
				if (num > 0) {
					++count;
				}
			}
			return count;
		}
	}

	void calc() {
		for (int i = 0; i < Q; ++i) {
			int count = eval(queries[i]);
			if (count >= 0) {
				System.out.println(count);
			}
		}
	}

	void showResult() {
	}

}