#include <bits/stdc++.h>
using namespace std;
constexpr int seed = 131;
constexpr long long LLMAX = 2e18;
constexpr int MOD = 1e9 + 7;
constexpr double eps = 1e-8;
constexpr int MAXN = 1e6 + 10;
constexpr int hmod1 = 0x48E2DCE7;
constexpr int hmod2 = 0x60000005;
inline long long sqr(long long x) { return x * x; }
inline int sqr(int x) { return x * x; }
inline double sqr(double x) { return x * x; }
inline int mul(int x, int y) { return 1ll * x * y % MOD; }
inline int sub(int x, int y) { return x >= y ? x - y : MOD + x - y; }
inline int add(int x, int y) { return x + y >= MOD ? x + y - MOD : x + y; }
inline int dcmp(double x) {
  if (fabs(x) < eps) return 0;
  return (x > 0 ? 1 : -1);
}
inline long long qpow(long long a, long long n) {
  long long sum = 1;
  while (n) {
    if (n & 1) sum = sum * a % MOD;
    a = a * a % MOD;
    n >>= 1;
  }
  return sum;
}
long long gcd(long long a, long long b) { return b == 0 ? a : gcd(b, a % b); }
long long exgcd(long long a, long long b, long long &x, long long &y) {
  long long d;
  (b == 0 ? (x = 1, y = 0, d = a)
          : (d = exgcd(b, a % b, y, x), y -= a / b * x));
  return d;
}
vector<pair<long long, long long> > fac;
bool is[MAXN];
int a[MAXN], prime[MAXN], cnt;
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  for (int i = 2; i < MAXN; i++) {
    if (!a[i]) prime[cnt++] = i;
    for (int j = 0; j < cnt && i * prime[j] < MAXN; j++) {
      a[i * prime[j]] = 1;
      if (i % prime[j] == 0) break;
    }
  }
  int i, n;
  cin >> n;
  int left = n;
  for (i = 0; prime[i] * prime[i] <= n; i++) {
    cout << "B " << prime[i] << endl;
    cout.flush();
    int x;
    cin >> x;
    cout << "A " << prime[i] << endl;
    cout.flush();
    int y;
    cin >> y;
    for (int j = prime[i]; j <= n; j += prime[i]) left -= !is[j], is[j] = 1;
    if (y) {
      fac.push_back({prime[i], 1});
      for (i++; prime[i] <= n; i++) {
        cout << "B " << prime[i] << endl;
        cout.flush();
        int x;
        cin >> x;
        for (int j = prime[i]; j <= n; j += prime[i]) x -= !is[j], is[j] = 1;
        if (x) fac.push_back({prime[i], 1});
      }
      break;
    }
  }
  if (fac.empty()) {
    for (int s = i; prime[i] <= n; i++) {
      cout << "B " << prime[i] << endl;
      cout.flush();
      int x;
      cin >> x;
      for (int j = prime[i]; j <= n; j += prime[i]) left -= !is[j], is[j] = 1;
      if (prime[i + 1] > n || i - s == 100) {
        cout << "A " << 1 << endl;
        cout.flush();
        int y;
        cin >> y;
        if (left != y) {
          for (int j = s; j <= i; j++) {
            cout << "A " << prime[j] << endl;
            cout.flush();
            int z;
            cin >> z;
            if (z) {
              fac.push_back({prime[j], 1});
              i = cnt - 2;
              break;
            }
          }
        }
        s = i + 1;
      }
    }
  }
  int ans = 1;
  for (int i = 0; i < (int)fac.size(); i++) {
    for (long long j = fac[i].first * fac[i].first; j <= n; j *= fac[i].first) {
      cout << "A " << j << endl;
      cout.flush();
      int x;
      cin >> x;
      if (x)
        fac[i].second++;
      else
        break;
    }
  }
  for (auto i : fac) ans *= qpow(i.first, i.second);
  cout << "C " << ans << endl;
  cout.flush();
  return 0;
}
