import std.conv, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

void chmin(T)(ref T t, in T f) { if (t > f) t = f; }
void chmax(T)(ref T t, in T f) { if (t < f) t = f; }

int binarySearch(T)(in T[] as, in bool delegate(T) test) { int low = -1, upp = cast(int)(as.length); for (; low + 1 < upp; ) { int mid = (low + upp) >> 1; (test(as[mid]) ? low : upp) = mid; } return upp; }
int lowerBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a < val)); }
int upperBound(T)(in T[] as, in T val) { return as.binarySearch((T a) => (a <= val)); }


enum MO = 10L^^9 + 7;

/*
  true: _*a_
  false: _*a + b + c_
*/
struct P {
  bool f;
  long a, b, c;
  this(bool f, long a, long b, long c) {
    this.f = f;
    this.a = a;
    this.b = b;
    this.c = c;
  }
  P opBinary(string op)(P o) if (op == "*") {
    return f ? (o.f ? P(true, (a * o.a) % MO, 0, 0)
                    : P(false, (a * o.a) % MO, o.b, o.c))
             : (o.f ? P(false, a, b, c * o.a)
                    : P(false, a, (b + c * o.a + o.b) % MO, o.c));
  }
}
P makeP(in string[] s) {
  switch (s[0]) {
    case "+": return P(false, 1, 0, s[1].to!long);
    case "*": return P(true, s[1].to!long, 0, 0);
    default: assert(false);
  }
}

class SegmentTree {
  int n;
  P[] prod;
  this(P[] ini) {
    for (n = 1; n < ini.length; n <<= 1) {}
    prod = new P[n << 1];
    foreach (i, val; ini) {
      prod[n + i] = val;
    }
    foreach_reverse (a; 1 .. n) {
      prod[a] = prod[a << 1] * prod[a << 1 | 1];
    }
  }
  void update(int a, P val) {
    prod[a += n] = val;
    for (a >>= 1; a; a >>= 1) {
      prod[a] = prod[a << 1] * prod[a << 1 | 1];
    }
  }
  P rangeProd(int a, int b) {
    P retL = P(true, 1, 0, 0);
    P retR = P(true, 1, 0, 0);
    for (a += n, b += n; a <= b; a >>= 1, b >>= 1) {
      if ( a & 1) retL = retL * prod[a++];
      if (~b & 1) retR = prod[b--] * retR;
    }
    return retL * retR;
  }
}

int N;
string[] C;
int Q;
string[] T;
int[] X, Y;

void main() {
  try {
    for (; ; ) {
      N = readInt() + 1;
      C = new string[N];
      C[0] = "+";
      foreach (i; 1 .. N) {
        C[i] = readToken();
      }
      Q = readInt();
      T = new string[Q];
      X = new int[Q];
      Y = new int[Q];
      foreach (q; 0 .. Q) {
        T[q] = readToken();
        X[q] = readInt();
        Y[q] = readInt();
      }
      auto seg = new SegmentTree(iota(N / 2).map!(i => makeP(C[i * 2 .. i * 2 + 2])).array);
      debug {
        foreach (i; 0 .. N / 2) foreach (j; i .. N / 2) {
          writefln("%s %s: %s", i, j, seg.rangeProd(i, j));
        }
      }
      foreach (q; 0 .. Q) {
        switch (T[q]) {
          case "!": {
            swap(C[X[q]], C[Y[q]]);
            seg.update(X[q] / 2, makeP(C[X[q] / 2 * 2 .. X[q] / 2 * 2 + 2]));
            seg.update(Y[q] / 2, makeP(C[Y[q] / 2 * 2 .. Y[q] / 2 * 2 + 2]));
          } break;
          case "?": {
            long ans;
            const x = C[X[q]].to!long;
            if (X[q] == Y[q]) {
              ans = x;
            } else {
              const res = seg.rangeProd(X[q] / 2 + 1, Y[q] / 2);
              ans = res.f ? (x * res.a) : (x * res.a + res.b + res.c);
            }
            ans %= MO;
            writeln(ans);
          } break;
          default: assert(false);
        }
      }
    }
  } catch (EOFException e) {
  }
}