title: Code to find unique elements among lists / sets
body: <p><a href="https://i.stack.imgur.com/hUq9n.jpg" rel="nofollow noreferrer"><img src="https://i.stack.imgur.com/hUq9n.jpg" alt="Shaded area required"></a></p>
  
  <p>The above shaded area, according to <a href="https://www.wolframalpha.com/input/?i=A+XOR+B+XOR+C+XOR+(A+AND+B+AND+C)&amp;rawformassumption=%7B%22C%22,+%22XOR%22%7D+-%3E+%7B%22MathOperator%22%7D" rel="nofollow noreferrer">Wolfram</a> is supposed to represent: </p>
  
  <pre><code> A XOR B XOR C XOR (A AND B AND C)
  </code></pre>
  
  <p>How to translate this into python code? The code must closely correlate to the set operations as provided in the above expression, at least that is the preference. The code must be generic enough to handle more more than 3 lists as well. </p>
  
  <p><strong>UPDATE:</strong> 
  Seems like Wolfram is throwing up an erroneous venn diagram? 
  Also, what we actually want is </p>
  
  <pre><code>(A XOR B XOR C) - (A AND B AND C)
  </code></pre>
  
  <p>and I am not able to represent that in Wolfram. </p>