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: [463, 157, 394, 291, 236, 444, 476, 438, 339, 215, 398, 198, 326, 134, 195, 249, 239, 482, 268, 368]
Solution:
[463, 157, 394, 291, 236, 444, 476, 438, 339, 215, 398, 198, 326, 482, 195, 249, 239, 134, 268, 368]