Longest Subsequence With Non-Zero Bitwise XOR

class Solution:
    def longestSubsequence(self, nums: List[int]) -> int:
        xors = 0
        found_not_zero = 0
        for x in nums:
            xors ^= x
            if x:
                found_not_zero = True

        if xors:
            return len(nums)

        return len(nums) - 1 if found_not_zero else 0