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.

Let me give you an example: [1,45,67,43,58,98,41,34,57]
The answer to this example can be: [98,45,67,43,58,1,41,34,57]
Here is why: 1 is the minimum element and 98 is the maximum element and their positions are swapped in the resulting list.

OK. solve this:
[206, 36, 371, 116, 91, 285, 177, 162, 283, 67, 164, 123, 436, 170, 196, 213, 385, 205, 431, 268]
Answer:
[206, 436, 371, 116, 91, 285, 177, 162, 283, 67, 164, 123, 36, 170, 196, 213, 385, 205, 431, 268]