def alternating_parity(nums):
    if not nums:
        return 0
    current = best = 1
    for i in range(1, len(nums)):
        if nums[i] % 2 != nums[i - 1] % 2:
            current += 1
        else:
            current = 1
        best = max(best, current)
    return best