#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;

#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount

#define INF 1e16
#define mod 1000000007LL

typedef vector<ll> vec;
typedef vector<vec> mat;

mat operator*(const mat& a,const mat& b){
  mat res(4,vec(4,0));
  const ll modl=8*mod*mod;
  rep(i,4){
    rep(k,4){
      rep(j,4){
        res[i][j]+=a[i][k]*b[k][j];
        if(res[i][j]>=modl)res[i][j]-=modl;
      }
    }
    rep(j,4)res[i][j]%=mod;
  }
  return res;
}

vector<mat> dat;
int sz;
mat e;

void init(int n_){
  sz=1;
  while(sz<n_) sz*=2;
  dat.resize(2*sz-1);
  for(int i=0;i<2*sz-1;i++){
    dat[i]=mat(4,vec(4,0));
    rep(j,4)dat[i][j][j]=1;
  }
  e=mat(4,vec(4,0));
  rep(i,4)e[i][i]=1;
}

void update(int k,mat a){
  k+=sz-1;
  dat[k]=a;
  while(k>0){
    k=(k-1)/2;
    dat[k]=dat[k*2+2]*dat[k*2+1];
  }
}

mat query(int a,int b,int k=0,int l=0,int r=sz){
  if(r<=a||b<=l)return e;
  if(a<=l&&r<=b)return dat[k];
  else{
    return query(a,b,k*2+2,(l+r)/2,r)*query(a,b,k*2+1,l,(l+r)/2);
  }
}


int n,q;
vector<char> cs;

ll pls[4][4]={
  {1, 0, 1, 0},
  {0, 0, 0, 1},
  {0, 0, 0, 0},
  {0, 0, 0, 1},
};

ll mul[4][4]={
  {1, 0, 0, 0},
  {0, 0, 1, 0},
  {0, 0, 0, 0},
  {0, 0, 0, 1},
};

ll num[4][4]={
  {1, 0, 0, 0},
  {0, 1, 0, 0},
  {0, 0, 10, 0},
  {0, 0, 0, 1},
};

int main(){
  scanf("%d",&n);
  init(n);
  rep(i,n){
    char c;
    cin>>c;
    mat m(4,vec(4,0));
    cs.push_back(c);
    if(isdigit(cs[i])){
      rep(j,4)rep(k,4)m[j][k]=num[j][k];
      m[2][1]=cs[i]-'0';
    }else if(cs[i]=='+'){
      rep(j,4)rep(k,4)m[j][k]=pls[j][k];
    }else if(cs[i]=='*'){
      rep(j,4)rep(k,4)m[j][k]=mul[j][k];
    }
    update(i,m);
  }
  mat mpls(4,vec(4,0));
  rep(i,4)rep(j,4)mpls[i][j]=pls[i][j];

  scanf("%d",&q);
  while(q--){
    char typ;
    cin>>typ;
    if(typ=='?'){
      int l,r;
      scanf("%d%d",&l,&r);
      l--;
      mat m=query(l,r);
      m=mpls*m;
      cout<<(m[0][1]+m[0][3])%mod<<endl;
    }else{
      int a,b;
      scanf("%d%d",&a,&b);
      a--;b--;
      mat m1(4,vec(4)),m2(4,vec(4));
      if(isdigit(cs[a])){
        rep(j,4)rep(k,4)m1[j][k]=num[j][k];
        m1[2][1]=cs[a]-'0';
      }else if(cs[a]=='+'){
        rep(j,4)rep(k,4)m1[j][k]=pls[j][k];
      }else if(cs[a]=='*'){
        rep(j,4)rep(k,4)m1[j][k]=mul[j][k];
      }

      if(isdigit(cs[b])){
        rep(j,4)rep(k,4)m2[j][k]=num[j][k];
        m2[2][1]=cs[b]-'0';
      }else if(cs[b]=='+'){
        rep(j,4)rep(k,4)m2[j][k]=pls[j][k];
      }else if(cs[b]=='*'){
        rep(j,4)rep(k,4)m2[j][k]=mul[j][k];
      }
      swap(cs[a],cs[b]);
      update(a,m2); update(b,m1);
    }
  }
  return 0;
}