#include #define rep(i,a,b) for(int i=a;i=b;i--) #define fore(i,a) for(auto &i:a) #pragma GCC optimize ("-O3") using namespace std; void _main(); int main() { cin.tie(0); ios::sync_with_stdio(false); _main(); } //--------------------------------------------------------------------------------------------------- template struct ModInt { static const int Mod = MOD; unsigned x; ModInt() : x(0) { } ModInt(signed sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } ModInt(signed long long sig) { x = sig < 0 ? sig % MOD + MOD : sig % MOD; } int get() const { return (int)x; } ModInt &operator+=(ModInt that) { if ((x += that.x) >= MOD) x -= MOD; return *this; } ModInt &operator-=(ModInt that) { if ((x += MOD - that.x) >= MOD) x -= MOD; return *this; } ModInt &operator*=(ModInt that) { x = (unsigned long long)x * that.x % MOD; return *this; } ModInt &operator/=(ModInt that) { return *this *= that.inverse(); } ModInt operator+(ModInt that) const { return ModInt(*this) += that; } ModInt operator-(ModInt that) const { return ModInt(*this) -= that; } ModInt operator*(ModInt that) const { return ModInt(*this) *= that; } ModInt operator/(ModInt that) const { return ModInt(*this) /= that; } ModInt inverse() const { long long a = x, b = MOD, u = 1, v = 0; while (b) { long long t = a / b; a -= t * b; std::swap(a, b); u -= t * v; std::swap(u, v); } return ModInt(u); } bool operator==(ModInt that) const { return x == that.x; } bool operator!=(ModInt that) const { return x != that.x; } ModInt operator-() const { ModInt t; t.x = x == 0 ? 0 : Mod - x; return t; } }; template ostream& operator<<(ostream& st, const ModInt a) { st << a.get(); return st; }; template ModInt operator^(ModInt a, unsigned long long k) { ModInt r = 1; while (k) { if (k & 1) r *= a; a *= a; k >>= 1; } return r; } typedef ModInt<1000000007> mint; struct func { mint a, b, c; int f; func(mint a = 1, mint b = 0, mint c = 0, int f = 0) : a(a), b(b), c(c), f(f) {} }; func operator*(func x, func y) { // op1 if (x.f and y.f) return func(x.a, x.b + x.c * y.a + y.b, y.c, 1); // op2 if (x.f) return func(x.a, x.b, x.c * y.a, 1); // op3 if (y.f) return func(x.a * y.a, y.b, y.c, 1); // op4 if (!x.f and !y.f) return func(x.a * y.a, 0, 0, 0); assert(0); } //----------------------------------------------------------------- template struct SegTree { // [L,R) V comp(V l, V r) { return l * r; }; vector val; SegTree() { val = vector(NV * 2); } V get(int x, int y, int l = 0, int r = NV, int k = 1) { // x<=i1) i >>= 1, val[i] = comp(val[i * 2],val[i * 2 + 1]); } }; SegTree st; /*---------------------------------------------------------------------------------------------------             ∧_∧       ∧_∧  (´<_` )  Welcome to My Coding Space!      ( ´_ゝ`) /  ⌒i     /   \    | |     /   / ̄ ̄ ̄ ̄/  |   __(__ニつ/  _/ .| .|____      \/____/ (u ⊃ ---------------------------------------------------------------------------------------------------*/ int N; int A[101010]; char B[101010]; int Q; //--------------------------------------------------------------------------------------------------- void update(int i) { if (B[i] == '*') st.update(i, func(A[i], 0, 0, 0)); else st.update(i, func(1, 0, A[i], 1)); } //--------------------------------------------------------------------------------------------------- void _main() { cin >> N; cin >> A[0]; B[0] = '+'; rep(i, 0, N / 2) cin >> B[i + 1] >> A[i + 1]; rep(i, 0, N / 2 + 1) update(i); cin >> Q; rep(q, 0, Q) { string s; int x, y; cin >> s >> x >> y; if (s == "!") { if (x % 2 == 1) { x /= 2; y /= 2; swap(A[x], A[y]); update(x); update(y); } else { x /= 2; y /= 2; swap(B[x], B[y]); update(x); update(y); } } else { x /= 2; y /= 2; func f; if (B[x] == '*') { B[x] = '+'; update(x); f = st.get(x, y + 1); B[x] = '*'; update(x); } else f = st.get(x, y + 1); mint ans = f.b + f.c; printf("%d\n", ans.get()); } } }