





'''simple docstring'''






def 							_lowerCamelCase(  UpperCamelCase__    : Union[str, Any]		)		->  Dict:
    A       :       Optional[int]							=						[0] * len(UpperCamelCase__		)
    A       :       Tuple							=						[]
    A       :       List[str]							=						[1] * len(UpperCamelCase__		)

    for values in graph.values():
        for i in values:
            indegree[i] += 1

    for i in range(len(UpperCamelCase__		)		):
        if indegree[i] == 0:
            queue.append(UpperCamelCase__		)

    while queue:
        A       :       List[str]							=						queue.pop(0		)
        for x in graph[vertex]:
            indegree[x] -= 1

            if long_dist[vertex] + 1 > long_dist[x]:
                A       :       Any							=						long_dist[vertex] + 1

            if indegree[x] == 0:
                queue.append(UpperCamelCase__		)

    print(max(UpperCamelCase__		)		)


# Adjacency list of Graph
snake_case_     =	{0: [2, 3, 4], 1: [2, 7], 2: [5], 3: [5, 7], 4: [7], 5: [6], 6: [7], 7: []}





longest_distance(graph)







'''simple docstring'''






from __future__ import annotations

import math
def 							_lowerCamelCase(  UpperCamelCase__    : int		)		->  list[int]:

    if num <= 0:
        A       :       str							=						F'''{num}: Invalid input, please enter a positive integer.'''
        raise ValueError(UpperCamelCase__		)

    A       :       int							=						[True] * (num + 1)
    A       :       Dict							=						[]
    A       :       str							=						2
    A       :       Any							=						int(math.sqrt(UpperCamelCase__		)		)

    while start <= end:
        # If start is a prime
        if sieve[start] is True:
            prime.append(UpperCamelCase__		)

            # Set multiples of start be False
            for i in range(start * start    ,       num + 1    ,       UpperCamelCase__		):
                if sieve[i] is True:
                    A       :       Union[str, Any]							=						False

        start += 1

    for j in range(end + 1    ,       num + 1		):
        if sieve[j] is True:
            prime.append(UpperCamelCase__		)

    return prime


if __name__ == "__main__":
     print(prime_sieve(int(input("""Enter a positive integer: """).strip())))
