def A__  (			)				->		Optional[Any]:

       '''simple docstring'''





       A						:     List[str]         =[]
       A						:     Any         =1

       while len(_lowerCAmelCase					) < 1e6:
              constant.append(str(_lowerCAmelCase					)					)
              i += 1

       A						:     Any         ="".join(_lowerCAmelCase					)

       return (
           int(constant[0]					)
           * int(constant[9]					)
           * int(constant[99]					)
           * int(constant[999]					)
           * int(constant[9_999]					)
           * int(constant[99_999]					)
           * int(constant[999_999]					)
       )


if __name__ == "__main__":
    print(solution())







def A__  (			lowercase:     int					)				->		int:
       if not isinstance(lowercase,		lowercase					) or number < 0:
              raise ValueError('Input must be a non-negative integer'					)

       A						:     Any         =0
       while number:
              # This way we arrive at next set bit (next 1) instead of looping
              # through each bit and checking for 1s hence the
              # loop won't run 32 times it will only run the number of `1` times
              number &= number - 1
              count += 1
       return count


if __name__ == "__main__":
    import doctest

    doctest.testmod()






