Please solve the programming task below using a self-contained code snippet in a markdown code block.

Given an integer n, return the smallest prime palindrome greater than or equal to n.
An integer is prime if it has exactly two divisors: 1 and itself. Note that 1 is not a prime number.

For example, 2, 3, 5, 7, 11, and 13 are all primes.

An integer is a palindrome if it reads the same from left to right as it does from right to left.

For example, 101 and 12321 are palindromes.

The test cases are generated so that the answer always exists and is in the range [2, 2 * 108].
 
Please complete the following python code precisely:
```python
class Solution:
    def primePalindrome(self, n: int) -> int:
```