



'''simple docstring'''


from collections import deque







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      int						):
      lowercase        =							len(_lowerCamelCase						)
      lowercase        =							deque()
      lowercase        =							[False for _ in range(_lowerCamelCase						)]
      lowercase        =							[-1 for _ in range(_lowerCamelCase						)]
      lowercase        =							index_of[:]

      def strong_connect(lowercase_    :      List[str] ,  lowercase_    :      List[str] ,  lowercase_    :      Dict						):
            lowercase        =							index  # the number when this node is seen
            lowercase        =							index  # lowest rank node reachable from here
            index += 1
            stack.append(_lowerCamelCase						)
            lowercase        =							True

            for w in g[v]:
                  if index_of[w] == -1:
                        lowercase        =							strong_connect(_lowerCamelCase ,  _lowerCamelCase ,  _lowerCamelCase						)
                        lowercase        =							(
                            lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
                        )
                  elif on_stack[w]:
                        lowercase        =							(
                            lowlink_of[w] if lowlink_of[w] < lowlink_of[v] else lowlink_of[v]
                        )

            if lowlink_of[v] == index_of[v]:
                  lowercase        =							[]
                  lowercase        =							stack.pop()
                  lowercase        =							False
                  component.append(_lowerCamelCase						)
                  while w != v:
                        lowercase        =							stack.pop()
                        lowercase        =							False
                        component.append(_lowerCamelCase						)
                  components.append(_lowerCamelCase						)
            return index

      lowercase        =							[]
      for v in range(_lowerCamelCase						):
            if index_of[v] == -1:
                  strong_connect(_lowerCamelCase ,  0 ,  _lowerCamelCase						)

      return components







def      SCREAMING_SNAKE_CASE				(				lowercase_    :      Any ,  lowercase_    :      List[Any]						):
      lowercase        =							[[] for _ in range(_lowerCamelCase						)]
      for u, v in edges:
            g[u].append(_lowerCamelCase						)
      return g


if __name__ == "__main__":
      # Test
      lowercase_      :				Any   					=    7
      lowercase_      :				int   					=    [0, 0, 1, 2, 3, 3, 4, 4, 6]
      lowercase_      :				Dict   					=    [1, 3, 2, 0, 1, 4, 5, 6, 5]
      lowercase_      :				Dict   					=    [(u, v) for u, v in zip(source, target)]
      lowercase_      :				Optional[int]   					=    create_graph(n_vertices, edges)

      assert [[5], [6], [4], [3, 2, 1, 0]] == tarjan(g)







'''simple docstring'''


def      SCREAMING_SNAKE_CASE				(				):
						lowercase        =							[]
						lowercase        =							1

						while len(lowercase_						) < 1E6:
												constant.append(str(lowercase_						)						)
												i += 1

						lowercase        =							"""""".join(lowercase_						)

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


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


