这咋搞啊啊啊

auto isprime(long long  j) {
	long long a = sqrt(j);
	for (long long  i = 2; i <= a; i++)
		if (j % i == 0)
			return 0;
	return 1;
}
auto ishuiwen(long long i) {
	string str = to_string(i);
	int start = 0, end = str.size() - 1;
	while (start < end) {
		if (str[start] != str[end])
			return 0;
		start++;
		end--;
	}
	return 1;
}
int main()
{
	long long a, b;
	cin >> a >> b;
	for (long long i = a; i <= b; i += (i % 2 == 0 ? 1 : 2)) {
		if (isprime(i) && ishuiwen(i)) {
			cout << i << endl;
		}
	}
	
	return 0;
}```