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
#include <vector>
#include <bitset>
#include <iostream>

constexpr char ALPHA = 'a';
constexpr int ONE = 1;

int main()
{
  int N;
  std::cin >> N;
  std::vector<int> S(N);
  for(auto& s : S) {
    char c;
    std::cin >> c;
    s = ONE << (c - ALPHA);
  }
  int Q;
  std::cin >> Q;
  while (Q--) {
    int q;
    std::cin >> q;
    if (q == ONE) {
      int i;
      char c;
      std::cin >> i >> c;
      S[i - 1] = 1 << (c - ALPHA);
    } else {
      int r, l;
      std::cin >> r >> l;
      --r;
      int res{};
      for (int i = r; i < l; ++i) {
          res |= S[i];
      }
      std::bitset<32> ans(res);
      std::cout << ans.count() << '\n';
    }
  }
  return 0;
}