#include <bits/stdc++.h>
using namespace std;
const int maxn = 100005;
struct Node {
  int t[60];
} v[maxn << 2];
int n, Q, A[maxn];
void build(int l, int r, int x = 1) {
  if (l == r) return;
  int m = (l + r) >> 1;
  build(l, m, x << 1), build(m + 1, r, x << 1 | 1);
  for (int i = 0; i < (int)(60); ++i) {
    int tmp;
    v[x].t[i] = v[x << 1].t[i] + 1 + ((v[x << 1].t[i] + i) % A[m] == 0),
    v[x].t[i] += tmp = v[x << 1 | 1].t[(v[x].t[i] + i) % 60];
  }
}
int q_res, pre, prel, prer;
void query(int l, int r, int L, int R, int x = 1) {
  if (L <= l && r <= R) {
    if (pre == -1)
      q_res = v[x].t[0];
    else
      q_res += 1 + (q_res % A[pre] == 0), q_res += v[x].t[q_res % 60];
    pre = r, prel = l, prer = r;
    return;
  }
  int m = (l + r) >> 1;
  if (L <= m) query(l, m, L, R, x << 1);
  if (R > m) query(m + 1, r, L, R, x << 1 | 1);
}
void modify(int l, int r, int pos, int x = 1) {
  if (l == r) return;
  int m = (l + r) >> 1;
  if (pos <= m)
    modify(l, m, pos, x << 1);
  else
    modify(m + 1, r, pos, x << 1 | 1);
  for (int i = 0; i < (int)(60); ++i)
    v[x].t[i] = v[x << 1].t[i] + 1 + ((v[x << 1].t[i] + i) % A[m] == 0),
    v[x].t[i] += v[x << 1 | 1].t[(v[x].t[i] + i) % 60];
}
int main(int argc, char const *argv[]) {
  scanf("%d", &n);
  for (int i = (int)(1); i <= (int)(n); ++i) scanf("%d", A + i);
  build(1, n + 1);
  scanf("%d", &Q);
  for (int q = 0; q < (int)(Q); ++q) {
    int x, y;
    char op[3];
    scanf("%s%d%d", op, &x, &y);
    if (op[0] == 'A') {
      pre = -1, q_res = 0;
      query(1, n + 1, x, y, 1);
      printf("%d\n", q_res);
    } else {
      A[x] = y;
      modify(1, n + 1, x, 1);
    }
  }
  return 0;
}
