# import pypyjit
# pypyjit.set_param("max_unroll_recursion=-1")
from collections import *
from functools import *
from itertools import *
from heapq import *
import sys, math,random,time
# input = sys.stdin.readline

class SegTree:
    """
    Segment Tree
    """

    def __init__(self, init_val, segfunc, ide_ele):
        """
        初期化

        init_val: 配列の初期値
        """
        n = len(init_val)
        self.segfunc = segfunc
        self.ide_ele = ide_ele
        self.num = 1 << (n - 1).bit_length()
        self.tree = [ide_ele] * 2 * self.num
        # 配列の値を葉にセット
        for i in range(n):
            self.tree[self.num + i] = init_val[i]
        # 構築していく
        for i in range(self.num - 1, 0, -1):
            self.tree[i] = segfunc(self.tree[2 * i], self.tree[2 * i + 1])

    def update(self, k, x):
        """
        k番目の値をxに更新

        k: index(0-index)
        x: update value
        """
        k += self.num
        self.tree[k] = x
        while k > 1:
            tk = k>>1
            self.tree[tk] = self.segfunc(self.tree[tk<<1], self.tree[(tk<<1)+1])
            k >>= 1

    def query(self, l, r):
        """
        [l, r)のsegfuncしたものを得る

        l: index(0-index)
        r: index(0-index)
        """
        res_l = self.ide_ele
        res_r = self.ide_ele
        
        l += self.num
        r += self.num
        while l < r:
            if l & 1:
                res_l = self.segfunc(res_l, self.tree[l])
                l += 1
            if r & 1:
                res_r = self.segfunc(self.tree[r - 1], res_r)
            l >>= 1
            r >>= 1
        res = self.segfunc(res_l,res_r)
        return res
    
N = int(input())
S = list(input())
S = [ord(s)-ord('A') for s in S]
Q = int(input())
M = 26
ide_ele = tuple([0]*(M*(M+1)+1))
L = M*(M+1)+1
def segfunc(x,y):
    z = [0]*(M*(M+1)+1)
    for i in range(L):
        z[i] = x[i]+y[i]
    for i in range(M):
        for j in range(M):
            if i!=j:
                z[-1] = (z[-1] 
                     + x[i]*y[M*(i+1)+j] 
                     + x[M*(i+1)+i]*y[j])
            z[M*(i+1)+j] = z[M*(i+1)+j] + x[i]*y[j]
    return tuple(z)

I = []
for s in S:
    X = [0]*(M*(M+1)+1)
    X[s] = 1
    I.append(tuple(X))

T = SegTree(I,segfunc,ide_ele)
for _ in range(Q):
    query = tuple(input().split())
    if query[0]=='1':
        x,c = query[1:]
        x = int(x) - 1
        c = ord(c) - ord('A')
        X = [0]*(M*(M+1)+1)
        X[c] = 1
        T.update(x,tuple(X))
    else:
        l,r = map(int,query[1:])
        l -= 1
        print(T.query(l,r)[-1])
        # print(l,r,sum(T.query(l,r)))
# print(T.query(0,2))