#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
template <class T>
inline T tmin(T a, T b) {
  return (a < b) ? a : b;
}
template <class T>
inline T tmax(T a, T b) {
  return (a > b) ? a : b;
}
template <class T>
inline void add_max(T &a, T b) {
  if (b > a) a = b;
}
template <class T>
inline void add_min(T &a, T b) {
  if (b < a) a = b;
}
template <class T>
inline T tabs(T a) {
  return (a > 0) ? a : -a;
}
template <class T>
T gcd(T a, T b) {
  while (b != 0) {
    T c = a;
    a = b, b = c % b;
  }
  return a;
}
const int N = 100005;
int n, a[N];
struct node {
  vector<int> t;
  node() { t.resize(60); }
};
struct SegmentTree {
  vector<node> seg;
  SegmentTree() {}
  SegmentTree(int _n) {
    int n = 1;
    while (n <= _n) n = n << 1;
    seg.resize(n << 1);
  }
  inline void update_node(int ind) {
    int c1 = ind << 1, c2 = c1 | 1;
    for (int i = (0); i < (60); ++i) {
      seg[ind].t[i] = seg[c1].t[i] + seg[c2].t[(i + seg[c1].t[i]) % 60];
    }
  }
  void build_tree(int ind, int s, int e) {
    if (e - s == 1) {
      seg[ind].t.resize(60);
      for (int i = (0); i < (60); ++i) {
        if (i % a[s])
          seg[ind].t[i] = 1;
        else
          seg[ind].t[i] = 2;
      }
      return;
    }
    int c1 = ind << 1, c2 = c1 | 1, m = (s + e) >> 1;
    build_tree(c1, s, m);
    build_tree(c2, m, e);
    update_node(ind);
  }
  void update(int ind, int s, int e, int idx, int val) {
    if (s > idx || e <= idx) return;
    if (s == idx && e - s == 1) {
      a[s] = val;
      for (int i = (0); i < (60); ++i) {
        if (i % a[s])
          seg[ind].t[i] = 1;
        else
          seg[ind].t[i] = 2;
      }
      return;
    }
    int c1 = ind << 1, c2 = c1 | 1, m = (s + e) >> 1;
    update(c1, s, m, idx, val);
    update(c2, m, e, idx, val);
    update_node(ind);
  }
  vector<int> query(int ind, int s, int e, int ss, int ee) {
    if (s >= ee || e <= ss) return vector<int>(60, 0);
    if (s >= ss && e <= ee) return seg[ind].t;
    int c1 = ind << 1, c2 = c1 | 1, m = (s + e) >> 1;
    vector<int> vl = query(c1, s, m, ss, ee);
    vector<int> vr = query(c2, m, e, ss, ee);
    vector<int> ans(60, 0);
    for (int i = (0); i < (60); ++i) {
      ans[i] = vl[i] + vr[(i + vl[i]) % 60];
    }
    return ans;
  }
};
int main(int argc, char *argv[]) {
  ios_base::sync_with_stdio(false);
  int q, x, y;
  char c;
  cin >> n;
  for (int i = (0); i < (n); ++i) {
    cin >> a[i];
  }
  SegmentTree segtree(n);
  segtree.build_tree(1, 0, n);
  cin >> q;
  for (int i = (0); i < (q); ++i) {
    cin >> c >> x >> y;
    --x;
    if (c == 'A') {
      --y;
      vector<int> ans = segtree.query(1, 0, n, x, y);
      printf("%d\n", ans[0]);
    } else
      segtree.update(1, 0, n, x, y);
  }
  return 0;
}
