Consider the following array:

```
[1, 12, 123, 1234, 12345, 123456, 1234567, 12345678, 123456789, 12345678910, 1234567891011...]
```

If we join these blocks of numbers, we come up with an infinite sequence which starts with `112123123412345123456...`. The list is infinite.

You will be given an number (`n`) and your task will be to return the element at that index in the sequence, where `1 ≤ n ≤ 10^18`. Assume the indexes start with `1`, not `0`.  For example:

```
solve(1) = 1, because the first character in the sequence is 1. There is no index 0. 
solve(2) = 1, because the second character is also 1.
solve(3) = 2, because the third character is 2.
```

More examples in the test cases. Good luck!

```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 = "import math\n\ndef seq_len_formula(s, b, n, i): return s + i * b + n * (i * (i + 1) // 2)\n\ndef point_gen():\n    num_len, block_len, seq_len = 0, 0, 0\n    while True:\n        yield num_len, block_len, seq_len\n        num_of_blocks = 9 * 10 ** num_len\n        num_len += 1\n        seq_len = seq_len_formula(seq_len, block_len, num_len, num_of_blocks)\n        block_len = block_len + num_len * num_of_blocks\n        \ndef linear_search(index, parameter):\n    params = {'block_len': 1, 'seq_len': 2}\n    required_point = 0, 0, 0\n    for point in point_gen():\n        if point[params[parameter]] >= index: return required_point\n        required_point = point\n\ndef index_for_block(num_len, block_len, index):\n    corrector = num_of_blocks = 9 * 10 ** (num_len - 1)\n    seq_len = seq_len_formula(0, block_len, num_len, num_of_blocks)\n    while not seq_len < index <= seq_len_formula(0, block_len, num_len, num_of_blocks + 1):\n        corrector = math.ceil(corrector / 2)\n        num_of_blocks = num_of_blocks - corrector if seq_len >= index else num_of_blocks + corrector\n        seq_len = seq_len_formula(0, block_len, num_len, num_of_blocks)\n    return index - seq_len\n\ndef solve(index):\n    initial_len, initial_block_len, initial_seq_len = linear_search(index, 'seq_len')\n    index = index_for_block(initial_len + 1, initial_block_len, index - initial_seq_len)\n    buffer = linear_search(index, 'block_len')\n    num_len, block_len = 10 ** buffer[0] - 1, buffer[1]\n    amount_of_nums = math.ceil((index - block_len) / len(str(num_len + 1)))\n    return int(str(amount_of_nums + num_len)[index - amount_of_nums * len(str(num_len + 1)) - block_len - 1])"
_co = compile(_CODE, USER_FILENAME, "exec")
exec(_co, ns, ns)

_target = None
_fn_name = 'solve'
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: 7016