Given an integer n, find and return the smallest prime palindrome that is greater than or equal to n.

An integer is a prime number if it is strictly greater than $1$ and has no positive divisors other than $1$ and itself.

An integer is a palindrome if it reads the same forward and backward.

Constraints:

• $1 \leq$ n $\leq 10^8$

Now, let’s take a moment to make sure you’ve correctly understood the problem. The quiz below helps you check if you’re solving the correct problem:

We have a game for you to play. Rearrange the logical building blocks to develop a clearer understanding of how to solve this problem.

Implement your solution in the following coding playground.