
"""simple docstring"""

def       lowercase__  (   lowerCAmelCase			:   int = 1_000	)	-> int:






    """simple docstring"""




    UpperCAmelCase       =   0
    UpperCAmelCase       =   0
    while 1:
        num += 3
        if num >= n:
            break
        total += num
        num += 2
        if num >= n:
            break
        total += num
        num += 1
        if num >= n:
            break
        total += num
        num += 3
        if num >= n:
            break
        total += num
        num += 1
        if num >= n:
            break
        total += num
        num += 2
        if num >= n:
            break
        total += num
        num += 3
        if num >= n:
            break
        total += num
    return total


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





"""simple docstring"""

SCREAMING_SNAKE_CASE_         =  {
    0: '''underwear''',
    1: '''pants''',
    2: '''belt''',
    3: '''suit''',
    4: '''shoe''',
    5: '''socks''',
    6: '''shirt''',
    7: '''tie''',
    8: '''watch''',
}

SCREAMING_SNAKE_CASE_         =  [[1, 4], [2, 4], [3], [], [], [4], [2, 7], [3], []]

SCREAMING_SNAKE_CASE_         =  [0 for x in range(len(graph))]
SCREAMING_SNAKE_CASE_         =  []




def       lowercase__  (   lowerCAmelCase			:   Optional[int]	,			lowerCAmelCase			:   Any	)	-> List[str]:






    """simple docstring"""




    UpperCAmelCase       =   1
    while stack:
        UpperCAmelCase       =   stack.pop()
        print(lowerCAmelCase	,			clothes[current_clothing]	)
        order += 1




def       lowercase__  (   lowerCAmelCase			:   List[Any]	,			lowerCAmelCase			:   Any	,			lowerCAmelCase			:   Dict	)	-> Optional[Any]:






    """simple docstring"""




    UpperCAmelCase       =   1
    for v in graph[u]:
        if not visited[v]:
            depth_first_search(lowerCAmelCase	,			lowerCAmelCase	,			lowerCAmelCase	)

    stack.append(lowerCAmelCase	)




def       lowercase__  (   lowerCAmelCase			:   Tuple	,			lowerCAmelCase			:   Dict	)	-> Optional[Any]:






    """simple docstring"""




    for v in range(len(lowerCAmelCase	)	):
        if not visited[v]:
            depth_first_search(lowerCAmelCase	,			lowerCAmelCase	,			lowerCAmelCase	)


if __name__ == "__main__":
   topological_sort(graph, visited)
   print(stack)
   print_stack(stack, clothes)



