#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <math.h>

int main(){
    int N = 0;
    scanf("%d%*c", &N);
    char* C = (char*)malloc((sizeof(char))*N);
    int i;
    for(i=0;i<N;i++){
        scanf("%c%*c", &C[i]);
    }
    int Q = 0;
    scanf("%d%*[^\n]%*c", &Q);
    char* T = (char*)malloc((sizeof(char))*Q);
    int** XY = (int**)malloc((sizeof(int*))*Q);
    for(i=0;i<Q;i++){
        XY[i] = (int*)malloc((sizeof(int))*2);
    }
    for(i=0;i<Q;i++){
        getchar();
        scanf("%c%d%d%*[^\n]%*c", &T[i], &XY[i][0], &XY[i][1]);
    }

    for(i=0;i<Q;i++){
        if(T[i] == '!'){
            int x = XY[i][0] - 1;
            int y = XY[i][1] - 1;
            char Cx = C[x];
            char Cy = C[y];
            C[x] = Cy;
            C[y] = Cx;
        } else {
            double res = 0;
            double* num = (double*)malloc((sizeof(double))*N);
            int j;
            int x = XY[i][0] - 1;
            int y = XY[i][1] - 1;
            for(j=x;j<y+1;j=j+2){
                num[j] = C[j] - '0';
            }
            for(j=x+1;j<y;j=j+2){
                if(C[j] == '*'){
                    double p = num[j-1] * num[j+1];
                    num[j-1] = 0;
                    num[j+1] = p;
                }
            }
            for(j=x;j<y+1;j=j+2){
                res += num[j];
            }
            res = fmod(res, (1000000000L + 7));
            printf("%.0lf\n", res);
        }
    }
    return 0;
}