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: [10, 163, 396, 358, 325, 207, 211, 253, 26, 473, 353, 164, 444, 274, 313, 228, 329, 128, 294, 387]
Output:
[473, 163, 396, 358, 325, 207, 211, 253, 26, 10, 353, 164, 444, 274, 313, 228, 329, 128, 294, 387]