#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e5 + 5;
const int mod = 1e9 + 7;
long long qpow(long long a, long long b) {
  long long res = 1;
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
struct node {
  int l, r, time[60];
} tree[maxn << 2];
int a[maxn];
void pushup(int root) {
  for (int i = 0; i < 60; ++i) {
    int tp = tree[root << 1].time[i];
    tree[root].time[i] = tp + tree[root << 1 | 1].time[(i + tp) % 60];
  }
}
void update(int root, int l, int r, int id, int val) {
  if (l == r) {
    for (int i = 0; i < 60; ++i) {
      tree[root].time[i] = 1 + !(i % val);
    }
    return;
  }
  int mid = l + r >> 1;
  if (mid >= id)
    update(root << 1, l, mid, id, val);
  else
    update(root << 1 | 1, mid + 1, r, id, val);
  pushup(root);
}
void build(int root, int l, int r) {
  if (l == r) {
    for (int i = 0; i < 60; ++i) {
      tree[root].time[i] = 1 + !(i % a[l]);
    }
    return;
  }
  int mid = l + r >> 1;
  build(root << 1, l, mid);
  build(root << 1 | 1, mid + 1, r);
  pushup(root);
}
int query(int root, int l, int r, int ql, int qr, int t) {
  if (l == ql && r == qr) {
    return tree[root].time[t];
  }
  int mid = l + r >> 1;
  int tmp = 0;
  if (qr <= mid) {
    return query(root << 1, l, mid, ql, qr, t);
  }
  if (ql > mid) return query(root << 1 | 1, mid + 1, r, ql, qr, t);
  tmp = query(root << 1, l, mid, ql, mid, t);
  t += tmp;
  return tmp + query(root << 1 | 1, mid + 1, r, mid + 1, qr, t % 60);
}
int main() {
  int n;
  scanf("%d", &n);
  for (int i = 1; i <= n; ++i) scanf("%d", &a[i]);
  build(1, 1, n);
  int q;
  scanf("%d", &q);
  char c;
  int l, r;
  while (q--) {
    scanf(" %c %d%d", &c, &l, &r);
    if (c == 'C') {
      update(1, 1, n, l, r);
    } else {
      printf("%d\n", query(1, 1, n, l, r - 1, 0));
    }
  }
  return 0;
}
