title: minimum sum required to make xor of some integers to zero
body: <p>Here's a question which deals with algorithm and bitwise xor operation.
  We are given <strong><code>x1*x2*x3*....*xn=P</code></strong>, where star(<code>*</code>) operation represents XOR(bitwise) operation and  <strong>x1 to xn are positive integers</strong>. P is also a positive integer. We need to <strong>find min(a1+a2+a3+.....an)</strong> <em>such that</em> this relation holds--> <strong><code>(x1+a1)*(x2+a2)*(x3+a3)*....*(xn+an)=0</code></strong>. '+' represents normal addition operation.</p>