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 static java.lang.Math.*;
import java.math.BigInteger;

public class Main {
	public static void main(String[] args){
		Scanner sc = new Scanner(System.in);
		
		// 入力
		int n = sc.nextInt();
		String s = sc.next();
		char[] array = s.toCharArray();
		BIT[] bit = new BIT[26];
		for(int i = 0; i < 26; i++){
		    bit[i] = new BIT(n, 2);
		}
		for(int i = 0; i < n; i++){
		    int index = s.charAt(i) - 'a';
		    bit[index].add(i, n-1, 1);
		}
		int q = sc.nextInt();
		for(int i = 0; i < q; i++){
		    int type = sc.nextInt();
		    if(type == 1){
		        int j = sc.nextInt()-1;
		        int indexM = array[j] - 'a';
		        bit[indexM].add(j, n-1, -1);
		        String t = sc.next();
		        int indexP = t.charAt(0) - 'a';
		        bit[indexP].add(j, n-1, 1);
		        array[j] = t.charAt(0);
		    }else{
		        int l = sc.nextInt()-1;
		        int r = sc.nextInt()-1;
		        int cnt = 0;
		        for(int j = 0; j < 26; j++){
		            if(l-1 >= 0){
		                if(bit[j].get(r) - bit[j].get(l-1) > 0) cnt++;
		            }else{
		                if(bit[j].get(r) > 0) cnt++;
		            }
		        }
		        System.out.println(cnt);
		    }
		}
	}
}

class BIT {
    int n;
    long[] array;
    int mode = 1;
    
    public BIT(int n){
        this.n = n;
        this.array = new long[n+1];
    }
    
    public BIT(int n, int mode){
        this.n = n;
        this.array = new long[n+1];
        this.mode = mode;
    }
    
    public BIT(int[] a){
        this.n = a.length;
        this.array = new long[n+1];
        init(a);
    }
    public BIT(long[] a){
        this.n = a.length;
        this.array = new long[n+1];
        init(a);
    }
    
    public BIT(int[] a, int mode){
        this.n = a.length;
        this.array = new long[n+1];
        this.mode = mode;
        init(a);
    }
    public BIT(long[] a, int mode){
        this.n = a.length;
        this.array = new long[n+1];
        this.mode = mode;
        init(a);
    }
    
    public void init(int[] a){
        for(int i = 0; i < n; i++){
            add(i, a[i]);
        }
    }
    public void init(long[] a){
        for(int i = 0; i < n; i++){
            add(i, a[i]);
        }
    }

    public void add(int i, long a){
        switch(mode){
            case 1:
                for(i++; i < array.length; i += i&-i){
                    array[i] += a;
                }
                break;
                
            case 2:
                add(i, i, a);
                break;
                
            default:
        }
    }
    
    public void add(int from, int to, long a){ // mode 2 only
        switch(mode){
            case 1:
                break;
                
            case 2:
                int i = from;
                for(i++; i < array.length; i += i&-i){
                    array[i] += a;
                }
                i = to + 1;
                for(i++; i < array.length; i += i&-i){
                    array[i] -= a;
                }
                break;
                
            default:
        }
    }
    
    public long get(int i){
        switch(mode){
            case 1:
                return getSum(i, i);
            case 2:
                return getSum(i);
            default:
                return getSum(i, i);
        }
    }
    
    public long getSum(int i){ // mode 1 only
        long r = 0;
        for(i++; i > 0; i -= i&-i){
            r += array[i];
        }
        return r;
    }
    
    public long getSum(int from, int to){ // mode 1 only
        return getSum(to) - getSum(from - 1);
    }
    
    public String toString(){
        StringBuilder sb = new StringBuilder();
        sb.append("[");
        for(int i = 0; i < n; i++){
            sb.append(get(i));
            if(i != n-1) sb.append(", ");
        }
        sb.append("]");
        return sb.toString();
    }
}


