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

import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.*;

/**
 * Created by hama_du on 2015/01/07.
 */
public class ProblemD {
    public static class SegmentTree60 {
        int[][] data;
        int N;

        public void reset(int[] a) {
            int n = a.length;
            for (int i = 0 ; i < n ; i++) {
                Arrays.fill(data[N-1+i], 1);
                for (int k = 0 ; k < 60 ; k += a[i]) {
                    data[N-1+i][k] = 2;
                }
            }
            for (int i = N-2 ; i >= 0 ; i--) {
                int x = i*2+1;
                int y = i*2+2;
                for(int k = 0 ; k < 60 ; k++) {
                    data[i][k] = data[x][k] + data[y][(k+data[x][k])%60];
                }
            }
        }

        public SegmentTree60(int[] a) {
            int n = a.length;
            N = Integer.highestOneBit(n+1)<<1;
            data = new int[N<<1][60];
            reset(a);
        }

        public void change(int i, int v) {
            int idx = N-1+i;
            Arrays.fill(data[idx], 1);
            for (int k = 0 ; k < 60 ; k += v) {
                data[idx][k] = 2;
            }
            while (true) {
                idx = (idx-1)>>1;
                int x = (idx<<1)+1;
                int y = (idx<<1)+2;
                for(int k = 0 ; k < 60 ; k++) {
                    data[idx][k] = data[x][k] + data[y][(k+data[x][k])%60];
                }
                if (idx == 0) {
                    break;
                }
            }
        }

        public int sum(int i, int j) {
            sum = 0;
            sum(i, j, 0, 0, N);
            return sum;
        }

        int sum;

        private void sum(int i, int j, int idx, int fr, int to) {
            if (j <= fr || to <= i) {
                return;
            }
            if (i <= fr && to <= j) {
                sum += data[idx][sum%60];
            } else {
                int med = (fr + to) >> 1;
                sum(i, j, idx * 2 + 1, fr, med);
                sum(i, j, idx * 2 + 2, med, to);
            }
        }
    }

    public static void main(String[] args) {
        InputReader in = new InputReader(System.in);
        PrintWriter out = new PrintWriter(System.out);
        int n = in.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = in.nextInt();
        }

        SegmentTree60 seg60 = new SegmentTree60(a);

        int q = in.nextInt();
        while (--q >= 0) {
            char c = in.nextChar();
            int arg1 = in.nextInt();
            int arg2 = in.nextInt();
            if (c == 'A') {
                out.println(seg60.sum(arg1 - 1, arg2 - 1));
            } else {
                seg60.change(arg1 - 1, arg2);
            }
        }
        out.flush();
    }

    public static void debug(Object... o) {
        System.err.println(Arrays.deepToString(o));
    }
}

class InputReader {
    private InputStream stream;
    private byte[] buf = new byte[1024];
    private int curChar;
    private int numChars;
    private SpaceCharFilter filter;

    public InputReader(InputStream stream) {
        this.stream = stream;
    }

    public int next() {
        if (numChars == -1)
            throw new InputMismatchException();
        if (curChar >= numChars) {
            curChar = 0;
            try {
                numChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (numChars <= 0)
                return -1;
        }
        return buf[curChar++];
    }

    public int nextInt() {
        int c = next();
        while (isSpaceChar(c))
            c = next();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = next();
        }
        int res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = next();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public char nextChar() {
        int c = next();
        while (isSpaceChar(c))
            c = next();
        return (char)c;
    }

    public long nextLong() {
        int c = next();
        while (isSpaceChar(c))
            c = next();
        long sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = next();
        }
        long res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = next();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public boolean isSpaceChar(int c) {
        if (filter != null)
            return filter.isSpaceChar(c);
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);
    }
}
