<p>You are given an integer array <code>nums</code>. You can choose <strong>exactly one</strong> index (<strong>0-indexed</strong>) and remove the element. Notice that the index of the elements may change after the removal.</p>
<p>For example, if <code>nums = [6,1,7,4,1]</code>:</p>
<ul>
<li>Choosing to remove index <code>1</code> results in <code>nums = [6,7,4,1]</code>.</li>
<li>Choosing to remove index <code>2</code> results in <code>nums = [6,1,4,1]</code>.</li>
<li>Choosing to remove index <code>4</code> results in <code>nums = [6,1,7,4]</code>.</li>
</ul>
<p>An array is <strong>fair</strong> if the sum of the odd-indexed values equals the sum of the even-indexed values.</p>
<p>Return the <em><strong>number</strong> of indices that you could choose such that after the removal, </em><code>nums</code><em></em><em>is <strong>fair</strong>. </em></p>