


def UpperCamelCase_				(				)	->   List[Any]:
      a__	:  Optional[int]     =   []
      a__	:  Dict     =   1

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

      a__	:  Dict     =   "".join(__a      )

      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())



'''simple docstring'''



def A ():
						for n in range(1					,      1000000						):
												yield n * (n + 1) // 2


def A (__lowerCamelCase :List[Any]						):
						_lowerCAmelCase    		=					1
						_lowerCAmelCase    		=					2
						while i * i <= n:
												_lowerCAmelCase    		=					0
												while n % i == 0:
																		n //= i
																		multiplicity += 1
												divisors_count *= multiplicity + 1
												i += 1
						if n > 1:
												divisors_count *= 2
						return divisors_count


def A ():
						return next(i for i in triangle_number_generator() if count_divisors(__lowerCamelCase						) > 500						)


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