In this task you will be given a list of integers. A list contains numbers separated by a comma. You need to round every integer to the closest power of 2. A power of 2 is a number in the form '2^n', it is a number that is the result of multiplying by 2 n times. The following are all powers of 2, '2, 4, 8, 16, 32, 64, 128, 256, 512, 1024, 2048, 4096'. If an integer is exactly in equally far from two different powers of 2 then you should output the larger power of 2. The output should be a list of integers that is the result of rounding each integer int the input list to the closest power of 2. The output should include a '[' to denote the start of the output list and ']' to denote the end of the output list.

Q: [239, 2000, 3564, 1111, 22, 48, 3]

A: [256, 2048, 4096, 1024, 16, 64, 4]
****
Q: [102, 1668, 2192, 3236, 15, 39, 3, 132, 610, 2336, 4717, 16, 70, 2, 130, 1376]

A: [128, 2048, 2048, 4096, 16, 32, 4, 128, 512, 2048, 4096, 16, 64, 2, 128, 1024]
****
Q: [54, 618, 2546, 2825, 24, 52, 4, 232, 966, 311, 4211, 20, 85, 3, 16, 1609]

A:
[64, 512, 2048, 2048, 32, 64, 4, 256, 1024, 256, 4096, 16, 64, 4, 16, 2048]
****