title: Find number of subsets, that xor of remaining numbers equals 0
body: <p>Given n numbers, find minimum number of subsets, such that xor of remaining numbers is equal to 0. For example:</p>
  
  <p><code>{1,1,3,4,5}</code></p>
  
  <p>result is equal to 3, because we can delete subsets {1,3} (in two ways) or {3,4,5}.</p>
  
  <p>I'm searching for something faster than O(2^n) brute-force.</p>
  
  <p>This is a duplicate of that question:
  <a href="https://stackoverflow.com/questions/33718953/find-number-of-subsets-that-xor-of-remaining-numbers-equals-to-0">Find number of subsets, that xor of remaining numbers equals to 0</a></p>
  
  <p>But the answer which was marked by OP is really unclear. Could you re-describe that? Or just add something by yourself.</p>