Check if an array (or equivalent) has the same number of odd and even numbers - Code Golf Edition! Inspired by this code review question, I am curious to see what happens if we turn that into a code-golf challenge!

The description is easy, the input is an array or any similar data structure with only unsigned integers, the output is a boolean if the number of odd numbers is equal to the number of even numbers inside (true or false doesn't matter, as long as the opposite is used in case the number doesn't match)

Here are some examples with true as output for matching (thanks to the original OP)

[5, 1, 0, 2]      -&gt;  true 
[5, 1, 0, 2, 11]  -&gt;  false
[]                -&gt;  true 


Usual code-golf rules, shortest code wins.
Haskell, 20 bytes



(==0).sum.map((-1)^)


Try it online!