
"""simple docstring"""



def  _UpperCamelCase	(						_A      )    ->  int:





    """simple docstring"""

    if divisor % 5 == 0 or divisor % 2 == 0:
        return 0
    _UpperCAmelCase          =   1
    _UpperCAmelCase          =   1
    while repunit:
        _UpperCAmelCase          =   (1_0 * repunit + 1) % divisor
        repunit_index += 1
    return repunit_index


def  _UpperCamelCase	(						_A = 1_0_0_0_0_0_0      )    ->  int:





    """simple docstring"""

    _UpperCAmelCase          =   limit - 1
    if divisor % 2 == 0:
        divisor += 1
    while least_divisible_repunit(_A      ) <= limit:
        divisor += 2
    return divisor


if __name__ == "__main__":
 print(F"{solution() = }")

"""simple docstring"""



from collections.abc import Callable

import numpy as np


def  _UpperCamelCase	(						_A					,      _A					,      _A					,      _A					,      _A      )    ->  np.array:





    """simple docstring"""

    _UpperCAmelCase          =   int(np.ceil((x_end - xa) / step_size      )      )
    _UpperCAmelCase          =   np.zeros((n + 1,)      )
    _UpperCAmelCase          =   ya
    _UpperCAmelCase          =   xa

    for k in range(_A      ):
        _UpperCAmelCase          =   y[k] + step_size * ode_func(_A					,      y[k]      )
        _UpperCAmelCase          =   y[k] + (
            (step_size / 2) * (ode_func(_A					,      y[k]      ) + ode_func(x + step_size					,      _A      ))
        )
        x += step_size

    return y


if __name__ == "__main__":
 import doctest

 doctest.testmod()