Find the smallest prime palindrome greater than or equal to N.
Recall that a number is prime if it's only divisors are 1 and itself, and it is greater than 1. 
For example, 2,3,5,7,11 and 13 are primes.
Recall that a number is a palindrome if it reads the same from left to right as it does from right to left. 
For example, 12321 is a palindrome.
 

Example 1:
Input: 6
Output: 7


Example 2:
Input: 8
Output: 11


Example 3:
Input: 13
Output: 101



 
Note:

1 <= N <= 10^8
The answer is guaranteed to exist and be less than 2 * 10^8.

```python

USER_FILENAME = "<user_code>"
import sys, json, builtins
import math, heapq, bisect, itertools, functools, collections, statistics, fractions, decimal, operator, array, random, re, string, os, pathlib
try:
    import resource as _res
except Exception:
    _res = None
from collections import Counter, defaultdict, deque, OrderedDict
from functools import lru_cache, reduce
from itertools import accumulate, permutations, combinations, product
from math import gcd, ceil, floor, sqrt
from decimal import Decimal
try:
    from typing import *
except Exception:
    pass
try:
    sys.setrecursionlimit(1_000_000)
except Exception:
    pass
try:
    import site as _site
    try:
        _sys_sites = _site.getsitepackages() if hasattr(_site, "getsitepackages") else []
        for _p in _sys_sites:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
    try:
        _usp = _site.getusersitepackages()
        if isinstance(_usp, str):
            _usp = [_usp]
        for _p in _usp:
            if _p and _p not in sys.path:
                sys.path.append(_p)
    except Exception:
        pass
except Exception:
    pass

def _disabled_input(*args, **kwargs):
    raise RuntimeError("input() is disabled in callable mode")
builtins.input = _disabled_input

ns = {"__name__": "__judge__"}  # prevent if __name__ == "__main__" blocks
for _k, _v in list(globals().items()):
    if not _k.startswith("_"):
        ns[_k] = _v
_CODE = 'class Solution:\n    \n    def next_palindrome(self,n):\n        if self.AreAll9s(n):\n            pal = str(1)  \n            for i in range(1, len(str(n))):  \n                pal = pal + str(0)  \n            pal = pal + str(1)\n            return int(pal)\n            \n        x = len(str(n))\n        if x>2:\n            first_num = n//10**(x-1)\n            if x%2==0:\n                pal = str(1)\n                for i in range(1, len(str(n))):\n                    pal = pal + str(0)\n                pal = pal + str(1)\n                return int(pal)\n            if first_num%2==0 or first_num%5==0:\n                n = (first_num+1) * (10**(x-1))\n            \n        if x%2 == 0:\n            first_half = n//(10**(x//2))\n            first_half_reversed = str(first_half)[::-1]\n            second_half = n%(10**(x//2))\n            if int(first_half_reversed) > second_half:\n                return int(str(first_half)+first_half_reversed)\n            else:\n                first_half = first_half + 1\n                pal = str(first_half)+str(first_half)[::-1]\n                return int(pal)\n            \n        else:\n            first_half = n//(10**(x//2))\n            second_half = n%(10**x//2)\n            first_half_reversed = str(first_half//10)[::-1]\n            if int(first_half_reversed) > second_half:\n                return int(str(first_half)+first_half_reversed)\n            else:\n                first_half = first_half + 1\n                pal = str(first_half)+str(first_half//10)[::-1]\n                return int(pal)\n            \n        \n    def AreAll9s(self,  n):  \n        for i in str(n): \n            if( int(i) != 9 ) : \n                return 0\n        return 1\n    \n    def mrange(self, start, stop, step):\n        while start < stop:\n            yield start\n            start += step\n        \n    def check_prime(self, num):\n        if num == 2:\n            return True\n        if (num < 2) or (num % 2 == 0):\n            return False\n        return all(num % i for i in self.mrange(3, int((num)**0.5) + 1, 2))\n    \n    def primePalindrome(self, N: int) -> int:\n        x = N\n        while x>=N:\n            if x>11:\n                x = self.next_palindrome(x)\n                if self.check_prime(x):\n                    return x\n            else:\n                if self.check_prime(x):\n                    return x\n                x= x+1\n            \n        \n        \n'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'primePalindrome'
if _fn_name:
    if "Solution" in ns:
        try:
            _obj = ns["Solution"]()
            if hasattr(_obj, _fn_name):
                _target = getattr(_obj, _fn_name)
        except Exception:
            _target = None
    if _target is None and _fn_name in ns and callable(ns[_fn_name]):
        _target = ns[_fn_name]
# Fallback: if there's exactly one user-defined function, use it
if _target is None:
    _cands = [v for k, v in ns.items() if callable(v) and getattr(v, "__module__", "") in ("__judge__", "__main__")]
    _user_funcs = [c for c in _cands if getattr(c, "__name__", "").startswith("_") is False]
    if len(_user_funcs) == 1:
        _target = _user_funcs[0]
if _target is None:
    raise RuntimeError(f"Could not resolve callable '{_fn_name}'")

_raw = sys.stdin.read().strip()
if _raw:
    _parsed = json.loads(_raw)
    if isinstance(_parsed, dict):
        _kwargs = _parsed.get("kwargs", {})
        _args = _parsed.get("args", [])
    else:
        _args, _kwargs = _parsed, {}
else:
    _args, _kwargs = [], {}
if not isinstance(_args, (list, tuple)):
    _args = [_args]
_res = _target(*_args, **_kwargs)
try:
    sys.stdout.write(repr(_res) + "\n")
except Exception:
    pass

```

Measured memory_bytes: 6382