The number ```89``` is the first positive integer that has a particular, curious property:

The square of ```89``` is ```7921```; ```89² = 7921```

The reverse of ```7921``` is ```1297```, and ```1297``` is a prime number.

The cube of ```89``` is ```704969```; ```89³ = 704969```

The reverse of ```704969``` is ```969407```, and ```969407``` is a prime number.

The first four terms of this sequence having this special property are:
```
n-th term      term value
    1               89 
    2              271
    3              325
    4              328
```

Create a function ```sq_cub_rev_prime()```, that receives the ordinal number of the sequence and outputs its correspoding value.

Use the above table to show how the function should work:
```python 
sq_cub_rev_prime(1) == 89 
sq_cub_rev_prime(2) == 271
sq_cub_rev_prime(3) == 325
sq_cub_rev_prime(4) == 328
```
Your code will be tested up to the 250th term

This is not a registered sequence of OESIS, so if you are one of the first ten people that solve this kata, you may have the privilege to register the sequence at https://oeis.org, with your name. If you do so, please, mention in your biography that you are a Codewarrior.

Memoize your results to pass the tests.

Enjoy it!

```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 = 'def _try_composite(a, d, n, s):\n        if pow(a, d, n) == 1:\n                return False\n        for i in range(s):\n                if pow(a, 2 ** i * d, n) == n - 1:\n                        return False\n        return True  # n  is definitely composite\n\n\ndef is_prime(n, _precision_for_huge_n=16):\n        if n in _known_primes:\n                return True\n        if any((n % p) == 0 for p in _known_primes) or n in (0, 1):\n                return False\n        d, s = n - 1, 0\n        while not d % 2:\n                d, s = d >> 1, s + 1\n        # Returns exact according to http://primes.utm.edu/prove/prove2_3.html\n        if n < 1373653:\n                return not any(_try_composite(a, d, n, s) for a in (2, 3))\n        if n < 25326001:\n                return not any(_try_composite(a, d, n, s) for a in (2, 3, 5))\n        if n < 118670087467:\n                if n == 3215031751:\n                        return False\n                return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7))\n        if n < 2152302898747:\n                return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11))\n        if n < 3474749660383:\n                return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13))\n        if n < 341550071728321:\n                return not any(_try_composite(a, d, n, s) for a in (2, 3, 5, 7, 11, 13, 17))\n        # otherwise\n        return not any(_try_composite(a, d, n, s)\n                       for a in _known_primes[:_precision_for_huge_n])\n\n\n_known_primes = [2, 3]\n_known_primes += [x for x in range(5, 1000, 2) if is_prime(x)]\n\ncounter = 1\ni = 1\nresults = {}\nwhile counter < 251:\n    square = i * i\n    cube = square * i\n    rs = int("".join(reversed(str(square))))\n    rc = int("".join(reversed(str(cube))))\n\n    if is_prime(rs) and is_prime(rc):\n        results[counter] = i\n        counter += 1\n\n    i += 1\n\n\ndef sq_cub_rev_prime(n):\n    return results[n]'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'sq_cub_rev_prime'
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: 5288