Given array a of length 1 ≤ n ≤ 44, 0 ≤ a_i ≤ 2⁴⁴. Calculate d_i = number of subsets that their xor has i '1' bits.
I think this is a meet-in-the-middle problem but I couldn't solve it, so I need help.