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    def primePalindrome(self, N: int) -> int:\n        if N == 1:\n            return 2\n\n        N_ary = []\n        compute_N = N\n        while not compute_N == 0:\n            N_ary.insert(0, compute_N % 10)\n            compute_N //= 10\n            \n        middle = len(N_ary) // 2\n        for i in range(middle, len(N_ary)):\n            N_ary[i] = N_ary[len(N_ary) - 1 - i] = min(N_ary[i], N_ary[len(N_ary) - 1 - i])\n            \n        result = 0\n        while True:\n            num = self.ary_to_int(N_ary)\n            if num < N:\n                N_ary = self.compute_next_ary(N_ary)\n                continue\n            is_prime = True\n            for i in range(2, num):\n                if i**2 > num:\n                    break\n                if num % i == 0:\n                    is_prime = False\n                    break\n            if is_prime == True:\n                result = num\n                break\n            N_ary = self.compute_next_ary(N_ary)\n            \n        return result\n\n\n    def ary_to_int(self, ary: List[int]) -> int:\n        result = 0\n        for num in ary:\n            result = result * 10 + num\n        return result\n    \n        \n    def compute_next_ary(self, ary: List[int]) -> List[int]:\n        middle = len(ary) // 2\n\n        is_all_nine = True\n        for i in range(middle, len(ary)):\n            if not ary[i] == 9:\n                is_all_nine = False\n                break                \n        if is_all_nine:\n            ary = [0 for i in range(len(ary) + 1)]\n            ary[0] = ary[-1] = 1\n            return ary\n        \n        for i in range(middle, len(ary)):\n            if ary[i] == 9:\n                ary[i] = ary[len(ary) - 1 - i] = 0\n            else:\n                ary[i] = ary[len(ary) - 1 - i] = ary[i] + 1\n                break\n        return ary\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: 6390