#include <bits/stdc++.h>
using namespace std;
int N, Q;
int A[100010];
int AI[4 * 100010][121];
void UpdateData(int left[121], int right[121], int v[61]) {
  for (int t = 0; t < 60; t++) v[t] = left[t] + right[(t + left[t]) % 60];
}
void Build(int node, int S, int D) {
  if (S >= D) {
    for (int t = 0; t < 60; t++)
      if (t % A[S] == 0)
        AI[node][t] = 2;
      else
        AI[node][t] = 1;
    return;
  }
  int M = (S + D) / 2;
  Build(2 * node, S, M);
  Build(2 * node + 1, M + 1, D);
  UpdateData(AI[2 * node], AI[2 * node + 1], AI[node]);
}
void Update(int node, int S, int D, int P) {
  if (S >= D) {
    for (int t = 0; t < 60; t++)
      if (t % A[S] == 0)
        AI[node][t] = 2;
      else
        AI[node][t] = 1;
    return;
  }
  int M = (S + D) / 2;
  if (P <= M)
    Update(2 * node, S, M, P);
  else
    Update(2 * node + 1, M + 1, D, P);
  UpdateData(AI[2 * node], AI[2 * node + 1], AI[node]);
}
int ans[61], aux[61];
bool first = 0;
void Query(int node, int S, int D, int L, int R) {
  if (L <= S && D <= R) {
    if (first == 1) {
      UpdateData(ans, AI[node], aux);
      for (int t = 0; t < 60; t++) ans[t] = aux[t];
    } else {
      for (int t = 0; t < 60; t++) ans[t] = AI[node][t];
      first = 1;
    }
    return;
  }
  int M = (S + D) / 2;
  if (L <= M) Query(2 * node, S, M, L, R);
  if (R > M) Query(2 * node + 1, M + 1, D, L, R);
  UpdateData(AI[2 * node], AI[2 * node + 1], AI[node]);
}
int main() {
  cin >> N;
  for (int i = 1; i <= N; i++) cin >> A[i];
  Build(1, 1, N);
  cin >> Q;
  for (int i = 1; i <= Q; i++) {
    char c;
    int x, y;
    cin >> c >> x >> y;
    first = 0;
    if (c == 'A') {
      memset(ans, 0, sizeof(ans));
      Query(1, 1, N, x, y - 1);
      cout << ans[0] << '\n';
    } else {
      A[x] = y;
      Update(1, 1, N, x);
    }
  }
  return 0;
}
