Given the task definition, example input & output, solve the new input case.
In this task, you are given a list of unique integers you need to swap the positions of maximum and minimum element in the list and return the updated list.
Example: [1,45,67,43,58,98,41,34,57]
Output: [98,45,67,43,58,1,41,34,57]
1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input case for you: [447, 170, 78, 324, 75, 397, 187, 24, 79, 73, 148, 127, 277, 419, 121, 408, 20, 384, 354, 109]
Output:
[20, 170, 78, 324, 75, 397, 187, 24, 79, 73, 148, 127, 277, 419, 121, 408, 447, 384, 354, 109]