#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101000;
const int MOD = 60;
int maxrt = 0;
int tt[MAXN * 4 + 100][MOD];
void PushUP(int *val, int *lct, int *rct) {
  for (int i = 0; i < MOD; i++) {
    val[i] = lct[i] + rct[(i + lct[i]) % MOD];
  }
}
void insert(int pos, int val, int rt, int l, int r) {
  if (r - l == 1) {
    for (int i = 0; i < MOD; i++) {
      tt[rt][i] = (i % val == 0) ? 2 : 1;
    }
    return;
  }
  int mid = (l + r) / 2;
  if (mid > pos) {
    insert(pos, val, rt * 2 + 1, l, mid);
  } else {
    insert(pos, val, rt * 2 + 2, mid, r);
  }
  PushUP(tt[rt], tt[rt * 2 + 1], tt[rt * 2 + 2]);
}
int query(int ql, int qr, int v, int rt, int l, int r) {
  if (ql <= l && r <= qr) {
    return tt[rt][v];
  }
  int mid = (l + r) / 2;
  int lv = 0, rv = 0;
  if (mid > ql && l < qr) {
    lv = query(ql, qr, v, rt * 2 + 1, l, mid);
  }
  if (mid < qr && r > ql) {
    rv = query(ql, qr, (lv + v) % MOD, rt * 2 + 2, mid, r);
  }
  return lv + rv;
}
int main() {
  int n, x;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    insert(i, x, 0, 0, n);
  }
  char cmd[10];
  int val[MOD];
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int a, b;
    scanf("%s%d%d", cmd, &a, &b);
    if (cmd[0] == 'C') {
      insert(a - 1, b, 0, 0, n);
    } else {
      printf("%d\n", query(a - 1, b - 1, 0, 0, 0, n));
    }
  }
  return 0;
}

### Prompt

Your challenge is to write a Cpp solution to the following problem:

Some country consists of (n + 1) cities, located along a straight highway. Let's number the cities with consecutive integers from 1 to n + 1 in the order they occur along the highway. Thus, the cities are connected by n segments of the highway, the i-th segment connects cities number i and i + 1. Every segment of the highway is associated with a positive integer ai > 1 — the period of traffic jams appearance on it. 

In order to get from city x to city y (x < y), some drivers use the following tactics. 

Initially the driver is in city x and the current time t equals zero. Until the driver arrives in city y, he perfors the following actions:

  * if the current time t is a multiple of ax, then the segment of the highway number x is now having traffic problems and the driver stays in the current city for one unit of time (formally speaking, we assign t = t + 1); 
  * if the current time t is not a multiple of ax, then the segment of the highway number x is now clear and that's why the driver uses one unit of time to move to city x + 1 (formally, we assign t = t + 1 and x = x + 1). 



You are developing a new traffic control system. You want to consecutively process q queries of two types:

  1. determine the final value of time t after the ride from city x to city y (x < y) assuming that we apply the tactics that is described above. Note that for each query t is being reset to 0. 
  2. replace the period of traffic jams appearing on the segment number x by value y (formally, assign ax = y). 



Write a code that will effectively process the queries given above.

Input

The first line contains a single integer n (1 ≤ n ≤ 105) — the number of highway segments that connect the n + 1 cities.

The second line contains n integers a1, a2, ..., an (2 ≤ ai ≤ 6) — the periods of traffic jams appearance on segments of the highway.

The next line contains a single integer q (1 ≤ q ≤ 105) — the number of queries to process.

The next q lines contain the descriptions of the queries in the format c, x, y (c — the query type). 

If c is character 'A', then your task is to process a query of the first type. In this case the following constraints are satisfied: 1 ≤ x < y ≤ n + 1.

If c is character 'C', then you need to process a query of the second type. In such case, the following constraints are satisfied: 1 ≤ x ≤ n, 2 ≤ y ≤ 6.

Output

For each query of the first type output a single integer — the final value of time t after driving from city x to city y. Process the queries in the order in which they are given in the input.

Examples

Input

10
2 5 3 2 3 5 3 4 2 4
10
C 10 6
A 2 6
A 1 3
C 3 4
A 3 11
A 4 9
A 5 6
C 7 3
A 8 10
A 2 5


Output

5
3
14
6
2
4
4

### Response

```cpp
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 101000;
const int MOD = 60;
int maxrt = 0;
int tt[MAXN * 4 + 100][MOD];
void PushUP(int *val, int *lct, int *rct) {
  for (int i = 0; i < MOD; i++) {
    val[i] = lct[i] + rct[(i + lct[i]) % MOD];
  }
}
void insert(int pos, int val, int rt, int l, int r) {
  if (r - l == 1) {
    for (int i = 0; i < MOD; i++) {
      tt[rt][i] = (i % val == 0) ? 2 : 1;
    }
    return;
  }
  int mid = (l + r) / 2;
  if (mid > pos) {
    insert(pos, val, rt * 2 + 1, l, mid);
  } else {
    insert(pos, val, rt * 2 + 2, mid, r);
  }
  PushUP(tt[rt], tt[rt * 2 + 1], tt[rt * 2 + 2]);
}
int query(int ql, int qr, int v, int rt, int l, int r) {
  if (ql <= l && r <= qr) {
    return tt[rt][v];
  }
  int mid = (l + r) / 2;
  int lv = 0, rv = 0;
  if (mid > ql && l < qr) {
    lv = query(ql, qr, v, rt * 2 + 1, l, mid);
  }
  if (mid < qr && r > ql) {
    rv = query(ql, qr, (lv + v) % MOD, rt * 2 + 2, mid, r);
  }
  return lv + rv;
}
int main() {
  int n, x;
  scanf("%d", &n);
  for (int i = 0; i < n; i++) {
    scanf("%d", &x);
    insert(i, x, 0, 0, n);
  }
  char cmd[10];
  int val[MOD];
  int q;
  scanf("%d", &q);
  for (int i = 0; i < q; i++) {
    int a, b;
    scanf("%s%d%d", cmd, &a, &b);
    if (cmd[0] == 'C') {
      insert(a - 1, b, 0, 0, n);
    } else {
      printf("%d\n", query(a - 1, b - 1, 0, 0, 0, n));
    }
  }
  return 0;
}

```