You will be given a definition of a task first, then an example. Follow the example to solve a new instance of the task.
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.

[1,45,67,43,58,98,41,34,57]
Solution: [98,45,67,43,58,1,41,34,57]
Why? 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

New input: [180, 328, 143, 398, 304, 22, 357, 214, 233, 334, 242, 477, 55, 281, 497, 71, 173, 381, 314, 336]
Solution:
[180, 328, 143, 398, 304, 497, 357, 214, 233, 334, 242, 477, 55, 281, 22, 71, 173, 381, 314, 336]