====== Nim ======

===== 풀이 =====
  * [[ps:problems:boj:16895]]와 동일한 문제. 테스트 케이스가 여러개 주어진다는 점만 다르고, 나머지 부분은 동일하다

===== 코드 =====
<dkpr py>
"""Solution code for "BOJ 7685. Nim".

- Problem link: https://www.acmicpc.net/problem/7685
- Solution link: http://www.teferi.net/ps/problems/boj/7685

Tags: [Sprague-Grundy]
"""

import sys


def main():
    while (n := int(sys.stdin.readline())) != 0:
        k = [int(x) for x in sys.stdin.readline().split()]

        grundy = 0
        for k_i in k:
            grundy ^= k_i
        answer = sum(1 for k_i in k if grundy ^ k_i < k_i)
        print(answer)


if __name__ == '__main__':
    main()

</dkpr>

{{tag>BOJ ps:problems:boj:플래티넘_4}}