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 is_prime(self, n):\n        small_primes = (2, 3, 5, 7, 11, 13, 17, 19)\n        if n == 1:\n            return False\n        if n in small_primes:\n           return True\n        for p in small_primes:\n            if n % p == 0:\n                return False\n        check_limit = int(n**0.5)+1\n        for p in range(small_primes[-1], check_limit, 2):\n            if n % p == 0:\n                return False\n        return True\n\n    def is_odd_len_palindrome(self, n):\n        n_str = str(n)\n        total_digit = len(n_str)\n        len_is_odd = total_digit % 2 != 0\n        if not len_is_odd:\n            return False\n        half_len_n = int((total_digit+1)/2)\n        if n_str[:half_len_n] != n_str[total_digit-half_len_n:][::-1]:\n            return False\n        return True\n\n    def find_odd_len_palindrome_after_n(self, n):\n        if n < 9:\n            return n + 1\n        elif n < 11:\n            return 11\n        n_str = str(n)\n        total_digit = len(n_str)\n        len_is_odd = total_digit % 2 != 0\n        if not len_is_odd:\n            return int('1' + '0'*(total_digit-1) + '1')\n        half_len_n = int((total_digit+1)/2)\n        left_str = n_str[:half_len_n]\n        right_str = left_str[:total_digit-half_len_n][::-1]\n        p = int(left_str+right_str)\n        if p > n:\n            return p\n        else:\n            left = int(left_str)\n            left += 1\n            increase_digit = len(str(left)) > len(left_str)\n            left_str = str(left)\n            if increase_digit:\n                return int('1' + '0' * total_digit + '1')\n            left_str = left_str[:half_len_n]\n            right_str = left_str[:total_digit-half_len_n][::-1]\n            return int(left_str+right_str)\n\n\n    def primePalindrome(self, N: int) -> int:\n        if self.is_odd_len_palindrome(N) and self.is_prime(N):\n            return N\n        elif N == 11:\n            return N\n        i = self.find_odd_len_palindrome_after_n(N)\n        while i < 2 * 10 ** 8:\n            if self.is_prime(i):\n                return i\n            i = self.find_odd_len_palindrome_after_n(i)\n        return i\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: 6590