#include <iostream>
#include <cstdio>
#include <fstream>
using namespace std;
typedef long long ll;

template <typename T>
T read() {
	T x = 0, w = 1;
	char ch = 0;
	while (ch < '0' || ch > '9') {
		if (ch == '-') w = -1;
		ch = getchar();
	}
	while (ch >= '0' && ch <= '9') {
		x = (x << 3) + (x << 1) + (ch - '0');
		ch = getchar();
	}
	return x * w;
}

void write(int x) {
	static int sta[35];
	int top = 0;
	do {
		sta[top++] = x % 10, x /= 10;
	} while (x);
	while (top) putchar(sta[--top] ^ 48);
}

ll gcd(ll x, ll y) {
	while (y) {
		ll t = x % y;
		x = y;
		y = t;
	}
	return x;
}

const int MAXN = 1e5 + 10;

int n, q;
ll a[MAXN], _gcd[MAXN], _xor[MAXN];

int main() {
	freopen("gcdxor.in", "r", stdin);
	freopen("gcdxor.out", "w", stdout);
	n = read<int>();
	for (int i = 1; i <= n; ++i) {
		a[i] = read<ll>();
		_gcd[i] = gcd(_gcd[i - 1], a[i]);
		_xor[i] = _xor[i - 1] ^ a[i];
	}
	scanf("%d", &q);
	while (q--) {
		char op[10];
		int id;
		ll x;
		scanf("%s", op);
		if (op[0] == 'M') {
			scanf("%d %lld", &id, &x);
			id++;
			a[id] = x;
			for (int i = id; i <= n; ++i) {
				_gcd[i] = gcd(_gcd[i - 1], a[i]);
				_xor[i] = _xor[i - 1] ^ a[i];
			}
		} else {
			scanf("%lld", &x);
			for (int i = 1; i <= n; ++i) {
				if (_gcd[i] * _xor[i] == x) {
					printf("%d\n", i - 1);
					goto NEXT;
				}
			}
			printf("no\n");
			NEXT:;
		}
	}
	return 0;
}