#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const int MOD = 1e9+7;
int N;
char v[100010];
const int blk = 230;
int bl[100010],L[100010],R[100010];
int S[blk*10],rv[blk*10],lv[blk*10],mv[blk*10],B;
int fp[blk*10],lp[blk*10];

void upd(int &x)
{
	if (x < 0) x += MOD;
	if (x >= MOD) x -= MOD;
}

int calc(int l,int r)//num---num
{
	int sum = 0,nowv = 1;
	//printf("calc %d %d\n",l,r);
	for (int i=l;i<=r;i+=2)
	{
		nowv = (1LL * nowv * (v[i] - '0')) % MOD;
		//printf("%d %d\n",i,nowv);
		if (v[i+1] == '+' || i==r)
		{
			upd(sum += nowv);
			nowv = 1;
		}
	}
	//printf("calc %d %d=%d\n",l,r,sum);
	return sum;
}

void build(int b)
{
	fp[b] = lp[b] = 0;
	for (int i=L[b];i<R[b];i++)
	{
		if (v[i] == '+')
		{
			if (!fp[b]) fp[b] = i;
			lp[b] = i;
		}
	}
	S[b] = calc(L[b],R[b]-1);
	lv[b] = calc(L[b],fp[b]-1);
	rv[b] = calc(lp[b]+1,R[b]-1);
	mv[b] = S[b] - lv[b];
	upd(mv[b]);
	upd(mv[b] -= rv[b]);
}

int query(int x,int y)
{
	//printf("query %d %d\n",x,y);
	if (bl[x] == bl[y]) return calc(x,y);
	int sum = 0,nowv = 1; 
	for (int i=x;i<R[bl[x]];i+=2)
	{
		nowv = 1LL * nowv * (v[i] - '0') % MOD;
		if (v[i+1] == '+')
		{
			upd(sum += nowv);
			nowv = 1;	
		}
	}
	//printf("%d %d\n",sum,nowv);
	for (int i=bl[x]+1;i<bl[y];i++)
	{
		if (v[R[i]] == '+')
		{
			if (fp[i])
			{
				nowv = 1LL * nowv * lv[i] % MOD;
				upd(sum += nowv);
				upd(sum += S[i]);
				upd(sum -= lv[i]);
			}
			else
			{
				nowv = 1LL * nowv * S[i] % MOD;
				upd(sum += nowv);
			}
			nowv = 1;
		}
		else
		{
			if (fp[i])
			{
				nowv = 1LL * nowv * lv[i] % MOD;
				upd(sum += nowv);
				upd(sum += mv[i]);
				nowv = rv[i];
			}
			else
			{
				nowv = 1LL * nowv * S[i] % MOD;
			}
		}
		//printf("%d %d\n",sum,nowv);
	}
	for (int i=L[bl[y]];i<=y;i+=2)
	{
		nowv = 1LL * nowv * (v[i] - '0') % MOD;
		if (v[i+1] == '+' || i==y)
		{
			upd(sum += nowv);
			nowv = 1;	
		}
	}
	//printf("%d %d\n",sum,nowv);
	return sum;
}

int main()
{
	//freopen("619.in","r",stdin);
	//freopen("619.out","w",stdout);
	scanf("%d",&N);
	for (int i=1;i<=N;i++)bl[i] = (i - 1) / blk + 1;
	B = bl[N];
	for (int i=1;i<=N;i++)
	{
		if (bl[i] != bl[i-1]) L[bl[i]] = i;
		if (bl[i] != bl[i+1]) R[bl[i]] = i;
	}
	for (int i=1;i<=N;i++)
	{
		char tmp[2];
		scanf("%s",tmp);
		v[i] = tmp[0];
	}
	
	for (int i=1;i<=B;i++)
	{
		build(i);
		//printf("%d: fp=%d lp=%d S=%d\n",i,fp[i],lp[i],S[i]);
	}
	int Q;
	scanf("%d",&Q);
	while(Q--)
	{
		char tmp[2];
		int x,y;
		scanf("%s",tmp);
		scanf("%d%d",&x,&y);
		if (tmp[0] == '?')
		{
			printf("%d\n",query(x,y));
		}
		else
		{
			if (v[x] != v[y])
			{
				swap(v[x],v[y]);
				build(bl[x]);
				build(bl[y]);
			}
		}
	}
}