Task Distribution

You are given a list of tasks, each with a specific duration, that need to be distributed across a number of workers. The goal is to minimize the time the last worker finishes their tasks. The input contains an integer n (the number of workers) followed by a list of integers representing the durations of each task. You need to determine and output the minimum possible time taken by the last worker. Example input: 3 2 3 5 8 Output: 10