The first positive integer, `n`, with its value `4n² + 1`, being divisible by `5` and `13` is `4`. (condition 1)

It can be demonstrated that we have infinite numbers that may satisfy the above condition.

If we name **ai**, the different terms of the sequence of numbers with this property, we define `S(n)` as:



We are interested in working with numbers of this sequence from 10 to 15 digits. Could you elaborate a solution for these results?

You will be given an integer value `m`(always valid an positive) and you should output the closest value of the sequence to `m`.

If the given value `m` is in the sequence, your solution should return the same value.

In the case that there are two possible solutions: `s1` and `s2`, (`s1 < s2`), because `|m - s1| = |m - s2|`, output the highest solution `s2`

No hardcoded solutions are allowed.

No misterious formulae are required, just good observation to discover hidden patterns.

See the example tests to see output format and useful examples, edge cases are included.

Features of the random tests
`1000 <= m <= 5.2 e14`

**Note** Sierpinsky presented the numbers that satisfy condition (1)

```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 SierpinskiSumFunc():\n    def __init__(self):\n        sierpinski_number = 4\n        sierpinski_numbers_add = (5, 47, 5, 8)  # (47, 5, 8, 5)\n        sierpinski_sum = [4, ]\n        n = 0\n        while sierpinski_sum[-1] < 520000000000000:\n            sierpinski_number += sierpinski_numbers_add[n]\n            sierpinski_sum.append(sierpinski_sum[-1] + sierpinski_number)\n            n = 0 if n == 3 else n + 1\n        self.sierpinski_sum = tuple(sierpinski_sum)\n\n\nsierpinski_sum_obj = SierpinskiSumFunc()\n\ndef find_closest_value(m):\n    if m <= 4:\n        return 4\n    if m <= 100000:\n        sierpinski_sum = sierpinski_sum_obj.sierpinski_sum\n        nn = 0\n        while True:\n            if m == sierpinski_sum[nn]:\n                return m\n            elif m < sierpinski_sum[nn + 1] and m > sierpinski_sum[nn]:\n                return sierpinski_sum[nn + 1] if m - sierpinski_sum[nn + 1] >= sierpinski_sum[nn] - m else sierpinski_sum[nn]\n            nn += 1\n    elif m > 100000:\n        sierpinski_sum = sierpinski_sum_obj.sierpinski_sum\n        nn = -1\n        while True:\n            if m == sierpinski_sum[nn]:\n                return m\n            elif m > sierpinski_sum[nn - 1] and m < sierpinski_sum[nn]:\n                return sierpinski_sum[nn - 1] if m - sierpinski_sum[nn - 1] < sierpinski_sum[nn] - m else sierpinski_sum[nn]\n            if m < sierpinski_sum[nn - 20]:\n                nn -= 20\n            else:\n                nn -= 1'
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'find_closest_value'
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: 5780