E. Deleting Numbers（分类讨论，交互题）

int p[N], cnt;
bool vis[N + 1];
void x_x()
{
	f(i, 2, N)
	{
		if (!vis[i])p[++cnt] = i;
		for (int j = 1;p[j] <= N / i;j++)
		{
			vis[p[j] * i] = true;
			if (i%p[j] == 0)break;
		}
	}
}
int query2(char c, int x)
{
	printf("%c %d", c, x);
	cout << endl;
	int tmp;cin >> tmp;
	return tmp;
}
int main()
{
	int n = in();
	x_x();
	memset(vis, false, sizeof vis);
	int num = (int)sqrt(n);
	int idx1_ed = upper_bound(p + 1, p + 1 + cnt, num) - p;
	//(经典素因子分类)
	idx1_ed--;//小质数
	int idx2_ed = upper_bound(p + 1, p + 1 + cnt, n) - p;
	idx2_ed--;//大质数(大于根号n的质数顶多有1个)
	ll fin = 1;
	f(i, 1, idx1_ed)
	{
		query2('B', p[i]);
		for (int k = 1;k*p[i] <= n;k++)
			if (!vis[k*p[i]])vis[k*p[i]] = true;
		ll ans = p[i];
		while (ans <= n)//每个小质数在答案出现的次数
		{
			int tmp=query2('A', ans);
			if (tmp == 0)break;
			ans *= p[i];
		}
		fin *= ans / p[i];
	}
	//debug(fin);
	if (fin == 1)//没有小质因子，只包含一个大质因数，130+9530+100+100 ok
	{
		int pre = query2('A', 1);
		int img = 0;
		int nk = idx2_ed - idx1_ed;
		if (nk == 0)goto hh;
		int per = (int)sqrt(nk);//sqrt(10)
		int	avg = nk / per;//10/3
		int num_kuai = per + 1;//3+1
		int pre_idx = idx1_ed + 1;
		f(j, 1, num_kuai)
		{
			f(i, pre_idx, min(pre_idx + avg, idx2_ed))
			{
				query2('B', p[i]);
				for (int k = 1;k*p[i] <= n;k++)
				{
					if (!vis[k*p[i]])
					{
						img++;
						vis[k*p[i]] = true;
					}
				}
			}
			int remain = query2('A', 1);//分块查询
			int fact = pre - remain;
			if (fact != img)//在块中
			{
				f(i, pre_idx, min(pre_idx + avg, idx2_ed))
				{
					if (query2('A', p[i]))
					{
						fin *= p[i];
						goto hh;
					}
				}
			}
			pre_idx = min(pre_idx + avg, idx2_ed) + 1;
		}
	}
	else//有小质数 300+5112*2?还剩下一个大质数，直接2*query枚举
	{
		int top = n / fin;
		if (top == 1)goto hh;
		int idx3_ed = upper_bound(p + 1, p + 1 + cnt, top) - p;
		idx3_ed--;
		//多模几组样例解决不确定的地方
		f(i, idx1_ed + 1, idx3_ed)
		{
			int img = 0;//理应没被筛过的
			for (int k = 1;k*p[i] <= n;k++)
			{
				if (!vis[k*p[i]])
				{
					img++;
					vis[k*p[i]] = true;
				}
			}
			if (img != query2('B', p[i]))
			{
				fin *= p[i];
				goto hh;
			}
		}
	}
hh:
	printf("C %d\n", fin);
	return 0;
}