Hello Codeforces community! Hope you all are doing well.

I need some help with the following question that I had while understanding xor basis.

Given an array A. You need to tell how many arrays B of length n exist that satisfy the following property: For each A[i], a subset of B exist such that its xor is equal to A[i] and 0 <= B[i] < 2^k.